default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID41st CRYPTO 2021: Virtual Event - Part II
- Tal Malkin
, Chris Peikert:
Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part II. Lecture Notes in Computer Science 12826, Springer 2021, ISBN 978-3-030-84244-4
Multi-party Computation
- Kai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi:
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election. 3-32 - Hemanta K. Maji, Mingyuan Wang:
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt. 33-63 - Craig Gentry, Shai Halevi, Hugo Krawczyk, Bernardo Magri, Jesper Buus Nielsen, Tal Rabin, Sophia Yakoubov:
YOSO: You Only Speak Once - Secure MPC with Stateless Ephemeral Roles. 64-93 - Arka Rai Choudhuri, Aarushi Goel, Matthew Green, Abhishek Jain, Gabriel Kaptchuk:
Fluid MPC: Secure Multiparty Computation with Dynamic Participants. 94-123 - Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen:
Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration. 124-154 - Ivan Damgård, Bernardo Magri, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Broadcast-Optimal Two Round MPC with an Honest Majority. 155-184 - Arpita Patra, Akshayaram Srinivasan:
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. 185-213 - Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
On the Round Complexity of Black-Box Secure MPC. 214-243 - Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, Yifan Song:
ATLAS: Efficient and Scalable MPC in the Honest Majority Setting. 244-274 - Vipul Goyal, Antigoni Polychroniadou, Yifan Song:
Unconditional Communication-Efficient MPC via Hall's Marriage Theorem. 275-304 - Reo Eriguchi, Kazuma Ohara, Shota Yamada, Koji Nuida:
Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions. 305-334 - Daniel Escudero, Eduardo Soria-Vazquez:
Efficient Information-Theoretic Multi-party Computation over Non-commutative Rings. 335-364 - Hanlin Liu, Yu Yu, Shuoyao Zhao, Jiang Zhang, Wenling Liu, Zhenkai Hu:
Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact. 365-394 - Gayathri Garimella, Benny Pinkas, Mike Rosulek, Ni Trieu, Avishay Yanai:
Oblivious Key-Value Stores and Amplification for Private Set Intersection. 395-425 - Jung Hee Cheon, Dongwoo Kim, Keewoo Lee:
MHz2k: MPC from HE over $\mathbb {Z}_{2^k}$ with New Packing, Simpler Reshare, and Better ZKP. 426-456 - Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Sublinear GMW-Style Compiler for MPC with Preprocessing. 457-485 - Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Daniel Wichs:
Limits on the Adaptive Security of Yao's Garbling. 486-515
Lattice Cryptography
- Martin R. Albrecht, Russell W. F. Lai:
Subtractive Sets over Cyclotomic Rings - Limits of Schnorr-Like Arguments over Lattices. 519-548 - Thomas Attema, Ronald Cramer, Lisa Kohl:
A Compressed $\varSigma $-Protocol Theory for Lattices. 549-579 - Shuichi Katsumata:
A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs. 580-610 - Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. 611-640 - Shweta Agrawal, Shafi Goldwasser, Saleet Mossel:
Deniable Fully Homomorphic Encryption from Learning with Errors. 641-670
Lattice Cryptanalysis
- Samuel B. Hopkins, Aayush Jain, Huijia Lin:
Counterexamples to New Circular Security Assumptions Underlying iO. 673-700 - Alexander May:
How to Meet Ternary LWE Keys. 701-731 - Martin R. Albrecht, Shi Bai, Jianwei Li, Joe Rowell:
Lattice Reduction with Approximate Enumeration Oracles - Practical Algorithms and Concrete Performance. 732-759 - Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque:
Towards Faster Polynomial-Time Lattice Reduction. 760-790 - Elena Kirshanova, Thijs Laarhoven:
Lower Bounds on Lattice Sieving and Information Set Decoding. 791-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-10-31 01:05 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:
