default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID44th EUROCRYPT 2025: Madrid, Spain - Part V
- Serge Fehr, Pierre-Alain Fouque
:
Advances in Cryptology - EUROCRYPT 2025 - 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Madrid, Spain, May 4-8, 2025, Proceedings, Part V. Lecture Notes in Computer Science 15605, Springer 2025, ISBN 978-3-031-91091-3
Secure Multiparty Computation I
- Geoffroy Couteau, Lalita Devadas, Aditya Hegde, Abhishek Jain, Sacha Servan-Schreiber:
Multi-Key Homomorphic Secret Sharing. 3-33 - Tiantian Gong, Aniket Kate, Hemanta K. Maji, Hai H. Nguyen:
Disincentivize Collusion in Verifiable Secret Sharing. 34-64 - Daniel Collins, Yuval Efron, Jovan Komatovic:
Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement. 65-95 - Thomas Locher, Victor Shoup:
MiniCast: Minimizing the Communication Complexity of Reliable Broadcast. 96-115 - Giovanni Deligios, Ivana Klasovita, Chen-Da Liu-Zhang:
Asymptotically Optimal Early Termination for Dishonest Majority Broadcast. 116-144 - Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan:
Efficient Pseudorandom Correlation Generators for Any Finite Field. 145-175 - Chen-Da Liu-Zhang, Elisaweta Masserova, João Ribeiro, Pratik Soni, Sri Aravinda Krishnan Thyagarajan:
Efficient Distributed Randomness Generation from Minimal Assumptions Where PArties Speak Sequentially Once. 176-206 - Elette Boyle, Abhishek Jain, Sacha Servan-Schreiber, Akshayaram Srinivasan:
Simultaneous-Message and Succinct Secure Computation. 207-239 - Reo Eriguchi, Kazumasa Shinagawa:
Efficient Multiparty Private Simultaneous Messages for Symmetric Functions. 240-269 - Marc Rivinius:
MPC with Publicly Identifiable Abort from Pseudorandomness and Homomorphic Encryption. 270-300 - Elette Boyle, Ilan Komargodski, Neekon Vafa:
The Complexity of Memory Checking with Covert Security. 301-330 - Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions. 331-359 - Michele Ciampi, Ankit Kumar Misra, Rafail Ostrovsky, Akash Shah:
Black-Box Constant-Round Secure 2PC with Succinct Communication. 360-389 - Gilad Asharov, Anirudh Chandramouli, Ran Cohen, Yuval Ishai:
Peeking Into the Future: MPC Resilient to Super-Rushing Adversaries. 390-420 - Alexander Bienstock, Kevin Yeo:
Weakly Super-Invertible Matrices and Constant Communication Dishonest Majority MPC. 421-452 - Yifan Song, Xiaxi Ye:
Honest Majority MPC with Õ(|C|) Communication in Minicrypt. 453-483
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-08-24 01:08 CEST 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:
