会议文集


文集名Advances in Cryptology - CRYPTO 2025
会议名45th Annual International Cryptology Conference (CRYPTO 2025)
中译名《第四十五届国际密码学年会，卷4》
机构International Association for Cryptologic Research (IACR)
会议日期August 17-21, 2025
会议地点Santa Barbara, CA, USA
出版年2025
馆藏号358577


题名作者出版年
The Round Complexity of Black-Box Post-quantum Secure ComputationRohit Chatterjee; Xiao Liang; Omkant Pandey; Takashi Yamakawa2025
Constant-Round Asynchronous MPC with Optimal Resilience and Linear CommunicationJunru Li; Yifan Song2025
Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round CollapsingVipul Goyal; Junru Li; Rafail Ostrovsky; Yifan Song2025
Actively Secure MPC in the Dishonest Majority Setting: Achieving Constant Complexity in Online Communication, Computation Per Gate, Rounds, and Private Input SizeSeunghwan Lee; Jaesang Noh; Taejeong Kim; Dohyuk Kim; Dong-Joon Shin2025
Multiparty Distributed Point FunctionsAarushi Goel; Mingyuan Wang; Zhiheng Wang2025
Computationally Differentially Private Inner-Product Protocols Imply Oblivious TransferIftach Haitner; Noam Mazor; Jad Silbak; Eliad Tsfadia; Chao Yan2025
Efficient Pseudorandom Correlation Generators over Z/p~kZZhe Li; Chaoping Xing; Yizhou Yao; Chen Yuan2025
Additive Randomized Encodings from Public Key EncryptionNir Bitansky; Saroja Erabelli; Rachit Garg2025
Computationally Efficient Asynchronous MPC with Linear Communication and Low Additive OverheadAkhil Bandarupalli; Xiaoyu Ji; Aniket Kate; Chen-Da Liu-Zhang; Yifan Song2025
Strong Secret Sharing with SnitchingJan Bormet; Stefan Dziembowski; Sebastian Faust; Tomasz Lizurej; Marcin Mielniczuk2025
How to Make Any Computational Secret Sharing Scheme Adaptively SecureGeorge Lu; Brent Waters2025
Fully Anonymous Secret SharingAllison Bishop; Matthew Green; Yuval Ishai; Abhishek Jain; Paul Lou2025
A Unified Framework for Succinct Garbling from Homomorphic Secret SharingYuval Ishai; Hanjun Li; Huijia Lin2025
Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCRPierre Meyer; Claudio Orlandi; Lawrence Roy; Peter Scholl2025
Bitwise Garbling Schemes A Model with 3/2λ-Bit Lower Bound of CiphertextsFei Xu; Honggang Hu; Changhong Xu2025
ω(1/λ)-Rate Boolean Garbling Scheme from Generic GroupsGeoffroy Couteau; Carmit Hazay; Aditya Hegde; Naman Kumar2025
Row Reduction Techniques for n-Party GarblingKelong Cong; Emmanuela Orsini; Erik Pohle; Oliver Zajonc2025
Multiparty Garbling from OT with Linear Scaling and RAM SupportDavid Heath; Vladimir Kolesnikov; Varun Narayanan; Rafail Ostrovsky; Akash Shah2025
Lower Bounds for Garbled Circuits from Shannon-Type Information InequalitiesJake Januzelli; Mike Rosulek; Lawrence Roy2025
Rerandomizable Garbling, RevisitedRaphael Heitjohann; Jonas von der Heyden; Tibor Jager2025
12



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  京公网安备11010202008970号  机械工业信息研究院 2018-2025