default search action
41st EUROCRYPT 2022: Trondheim, Norway - Part I
- 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
Best Paper Award
- David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
EpiGRAM: Practical Garbled RAM. 3-33
Secure Multiparty Computation
- Abida Haque, David Heath, Vladimir Kolesnikov, Steve Lu, Rafail Ostrovsky, Akash Shah:
Garbled Circuits with Sublinear Evaluator. 37-64 - Michele Ciampi
Round-Optimal and Communication-Efficient Multiparty Computation. 65-95 - Diana Ghinea
Round-Optimal Byzantine Agreement. 96-119 - Ke Wu
A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss. 120-149 - Leo de Castro, Antigoni Polychroniadou:
Lightweight, Maliciously Secure Verifiable Function Secret Sharing. 150-179 - Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia:
Highly Efficient OT-Based Multiplication Protocols. 180-209 - Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box Protocol Compilers. 210-240 - Ran Cohen, Jack Doerner, Yashvanth Kondi, Abhi Shelat:
Guaranteed Output in $O(\sqrt{n})$ Rounds for Round-Robin Sampling Protocols. 241-271 - Suvradip Chakraborty, Bernardo Magri, Jesper Buus Nielsen, Daniele Venturi:
Universally Composable Subversion-Resilient Cryptography. 272-302 - Leo de Castro, Carmit Hazay, Yuval Ishai, Vinod Vaikuntanathan, Muthuramakrishnan Venkitasubramaniam:
Asymptotically Quasi-Optimal Cryptography. 303-334 - Michele Ciampi
Round-Optimal Multi-party Computation with Identifiable Abort. 335-364 - Jens Groth, Victor Shoup:
On the Security of ECDSA with Additive Key Derivation and Presignatures. 365-396 - Aarushi Goel, Mathias Hall-Andersen, Aditya Hegde, Abhishek Jain:
Secure Multiparty Computation with Free Branching. 397-426 - Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Secure Multiparty Computation with Sublinear Preprocessing. 427-457 - Craig Gentry, Shai Halevi, Vadim Lyubashevsky:
Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. 458-487
Homomorphic Encryption
- Charanjit S. Jutla, Nathan Manohar:
Sine Series Approximation of the Mod Function for Bootstrapping of Approximate HE. 491-520 - Jung Hee Cheon, Keewoo Lee:
Limits of Polynomial Packings for $\mathbb {Z}_{p^k}$ and $\mathbb {F}_{p^k}$. 521-550 - Yongwoo Lee, Joon-Woo Lee, Young-Sik Kim
High-Precision Bootstrapping for Approximate Homomorphic Encryption by Error Variance Minimization. 551-580 - Jincheol Ha, Seongkwang Kim, ByeongHak Lee, Jooyoung Lee, Mincheol Son:
Rubato: Noisy Ciphers for Approximate Homomorphic Encryption. 581-610 - Khin Mi Mi Aung
Field Instruction Multiple Data. 611-641
Obfuscation
- Li Yao, Yilei Chen, Yu Yu:
Cryptanalysis of Candidate Obfuscators for Affine Determinant Programs. 645-669 - Aayush Jain, Huijia Lin, Amit Sahai:
Indistinguishability Obfuscation from LPN over $\mathbb {F}_p$, DLIN, and PRGs in NC0. 670-699 - Jiaxin Guan
Incompressible Cryptography. 700-730 - Ran Canetti, Suvradip Chakraborty, Dakshita Khurana, Nishant Kumar, Oxana Poburinnaya, Manoj Prabhakaran:
COA-Secure Obfuscation and Applications. 731-758 - Ghada Almashaqbeh, Ran Canetti, Yaniv Erlich, Jonathan Gershoni, Tal Malkin, Itsik Pe'er, Anna Roitburd-Berman, Eran Tromer:
Unclonable Polymers and Their Cryptographic Applications. 759-789 - Damiano Abram
Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round. 790-820
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.
last updated on 2025-01-10 18:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: