default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 28 matches
- 2022
- Damiano Abram, Peter Scholl, Sophia Yakoubov:
Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round. EUROCRYPT (1) 2022: 790-820 - Ghada Almashaqbeh, Ran Canetti, Yaniv Erlich, Jonathan Gershoni, Tal Malkin, Itsik Pe'er, Anna Roitburd-Berman, Eran Tromer:
Unclonable Polymers and Their Cryptographic Applications. EUROCRYPT (1) 2022: 759-789 - Khin Mi Mi Aung, Enhui Lim, Sim Jun Jie, Benjamin Hong Meng Tan, Huaxiong Wang, Sze Ling Yeo:
Field Instruction Multiple Data. EUROCRYPT (1) 2022: 611-641 - Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Secure Multiparty Computation with Sublinear Preprocessing. EUROCRYPT (1) 2022: 427-457 - Ran Canetti, Suvradip Chakraborty, Dakshita Khurana, Nishant Kumar, Oxana Poburinnaya, Manoj Prabhakaran:
COA-Secure Obfuscation and Applications. EUROCRYPT (1) 2022: 731-758 - Leo de Castro, Carmit Hazay, Yuval Ishai, Vinod Vaikuntanathan, Muthuramakrishnan Venkitasubramaniam:
Asymptotically Quasi-Optimal Cryptography. EUROCRYPT (1) 2022: 303-334 - Leo de Castro, Antigoni Polychroniadou:
Lightweight, Maliciously Secure Verifiable Function Secret Sharing. EUROCRYPT (1) 2022: 150-179 - Suvradip Chakraborty, Bernardo Magri, Jesper Buus Nielsen, Daniele Venturi:
Universally Composable Subversion-Resilient Cryptography. EUROCRYPT (1) 2022: 272-302 - Jung Hee Cheon, Keewoo Lee:
Limits of Polynomial Packings for $\mathbb {Z}_{pk}$ and $\mathbb {F}_{pk}$. EUROCRYPT (1) 2022: 521-550 - Michele Ciampi, Rafail Ostrovsky, Hendrik Waldner, Vassilis Zikas:
Round-Optimal and Communication-Efficient Multiparty Computation. EUROCRYPT (1) 2022: 65-95 - Michele Ciampi, Divya Ravi, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Multi-party Computation with Identifiable Abort. EUROCRYPT (1) 2022: 335-364 - Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat:
Guaranteed Output in $O(\sqrt{n})$ Rounds for Round-Robin Sampling Protocols. EUROCRYPT (1) 2022: 241-271 - Craig Gentry, Shai Halevi, Vadim Lyubashevsky:
Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. EUROCRYPT (1) 2022: 458-487 - Diana Ghinea, Vipul Goyal, Chen-Da Liu-Zhang:
Round-Optimal Byzantine Agreement. EUROCRYPT (1) 2022: 96-119 - Aarushi Goel, Mathias Hall-Andersen, Aditya Hegde, Abhishek Jain:
Secure Multiparty Computation with Free Branching. EUROCRYPT (1) 2022: 397-426 - Jens Groth, Victor Shoup:
On the Security of ECDSA with Additive Key Derivation and Presignatures. EUROCRYPT (1) 2022: 365-396 - Jiaxin Guan, Daniel Wichs, Mark Zhandry:
Incompressible Cryptography. EUROCRYPT (1) 2022: 700-730 - Jincheol Ha, Seongkwang Kim, ByeongHak Lee, Jooyoung Lee, Mincheol Son:
Rubato: Noisy Ciphers for Approximate Homomorphic Encryption. EUROCRYPT (1) 2022: 581-610 - Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia:
Highly Efficient OT-Based Multiplication Protocols. EUROCRYPT (1) 2022: 180-209 - Abida Haque, David Heath, Vladimir Kolesnikov, Steve Lu, Rafail Ostrovsky, Akash Shah:
Garbled Circuits with Sublinear Evaluator. EUROCRYPT (1) 2022: 37-64 - David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
EpiGRAM: Practical Garbled RAM. EUROCRYPT (1) 2022: 3-33 - Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box Protocol Compilers. EUROCRYPT (1) 2022: 210-240 - Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from LPN over $\mathbb {F}_p$, DLIN, and PRGs in NC0. EUROCRYPT (1) 2022: 670-699 - Charanjit S. Jutla, Nathan Manohar:
Sine Series Approximation of the Mod Function for Bootstrapping of Approximate HE. EUROCRYPT (1) 2022: 491-520 - Yongwoo Lee, Joon-Woo Lee, Young-Sik Kim, Yongjune Kim, Jong-Seon No, HyungChul Kang:
High-Precision Bootstrapping for Approximate Homomorphic Encryption by Error Variance Minimization. EUROCRYPT (1) 2022: 551-580 - Ke Wu, Gilad Asharov, Elaine Shi:
A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss. EUROCRYPT (1) 2022: 120-149 - Li Yao, Yilei Chen, Yu Yu:
Cryptanalysis of Candidate Obfuscators for Affine Determinant Programs. EUROCRYPT (1) 2022: 645-669 - Orr Dunkelman, Stefan Dziembowski:
Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part I. Lecture Notes in Computer Science 13275, Springer 2022, ISBN 978-3-031-06943-7 [contents]
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-31 11:20 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint