知识中心主页
文献服务
文献资源
外文期刊
外文会议
专业机构
智能制造
高级检索
版权声明
使用帮助
会议文集
文集名
Advances in Cryptology - EUROCRYPT 2025
会议名
44th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2025)
中译名
《第四十四届国际密码技术理论及应用年度会议,卷5》
机构
International Association for Cryptologic Research (IACR)
会议日期
May 4-8, 2025
会议地点
Madrid, Spain
出版年
2025
馆藏号
356943
题名
作者
出版年
Multi-Key Homomorphic Secret Sharing
Geoffroy Couteau; Lalita Devadas; Aditya Hegde; Abhishek Jain; Sacha Servan-Schreiber
2025
Disincentivize Collusion in Verifiable Secret Sharing
Tiantian Gong; Aniket Kate; Hemanta K. Maji; Hai H. Nguyen
2025
Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement
Daniel Collins; Yuval Efron; Jovan Komatovic
2025
MiniCast: Minimizing the Communication Complexity of Reliable Broadcast
Thomas Locher; Victor Shoup
2025
Asymptotically Optimal Early Termination for Dishonest Majority Broadcast
Giovanni Deligios; Ivana Klasovita; Chen-Da Liu-Zhang
2025
Efficient Pseudorandom Correlation Generators for Any Finite Field
Zhe Li; Chaoping Xing; Yizhou Yao; Chen Yuan
2025
Efficient Distributed Randomness Generation from Minimal Assumptions Where PArties Speak Sequentially Once
Chen-Da Liu-Zhang; Elisaweta Masserova; Joao Ribeiro; Pratik Soni; Sri AravindaKrishnan Thyagarajan
2025
Simultaneous-Message and Succinct Secure Computation
Elette Boyle; Abhishek Jain; Sacha Servan-Schreiber; Akshayaram Srinivasan
2025
Efficient Multiparty Private Simultaneous Messages for Symmetric Functions
Reo Eriguchi; Kazumasa Shinagawa
2025
MPC with Publicly Identifiable Abort from Pseudorandomness and Homomorphic Encryption
Marc Rivinius
2025
The Complexity of Memory Checking with Covert Security
Elette Boyle; Ilan Komargodski; Neekon Vafa
2025
Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions
Michele Ciampi; Rafail Ostrovsky; Luisa Siniscalchi; Hendrik Waldner
2025
Black-Box Constant-Round Secure 2PC with Succinct Communication
Michele Ciampi; Ankit Kumar Misra; Rafail Ostrovsky; Akash Shah
2025
Peeking Into the Future: MPC Resilient to Super-Rushing Adversaries
Gilad Asharov; Anirudh Chandramouli; Ran Cohen; Yuval Ishai
2025
Weakly Super-Invertible Matrices and Constant Communication Dishonest Majority MPC
Alexander Bienstock; Kevin Yeo
2025
Honest Majority MPC with O(|C|) Communication in Minicrypt
Yifan Song; Xiaxi Ye
2025
制造业外文文献服务平台