default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID45th CRYPTO 2025, Santa Barbara, CA, USA - Part IV
- Yael Tauman Kalai, Seny F. Kamara:
Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2025, Proceedings, Part IV. Lecture Notes in Computer Science 16003, Springer 2025, ISBN 978-3-032-01883-0
Secure Computation
- Rohit Chatterjee, Xiao Liang, Omkant Pandey, Takashi Yamakawa:
The Round Complexity of Black-Box Post-quantum Secure Computation. 3-35 - Junru Li, Yifan Song:
Constant-Round Asynchronous MPC with Optimal Resilience and Linear Communication. 36-69 - Vipul Goyal, Junru Li, Rafail Ostrovsky, Yifan Song:
Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing. 70-104 - Seunghwan Lee, Jaesang Noh, Taejeong Kim, Dohyuk Kim, Dong-Joon Shin:
Actively Secure MPC in the Dishonest Majority Setting: Achieving Constant Complexity in Online Communication, Computation Per Gate, Rounds, and Private Input Size. 105-139 - Aarushi Goel, Mingyuan Wang, Zhiheng Wang:
Multiparty Distributed Point Functions. 140-173 - Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan:
Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer. 174-206 - Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan:
Efficient Pseudorandom Correlation Generators over $\mathbb {Z}/p^k\mathbb {Z}$. 207-240 - Nir Bitansky
, Saroja Erabelli, Rachit Garg:
Additive Randomized Encodings from Public Key Encryption. 241-260 - Akhil Bandarupalli, Xiaoyu Ji, Aniket Kate, Chen-Da Liu-Zhang, Yifan Song:
Computationally Efficient Asynchronous MPC with Linear Communication and Low Additive Overhead. 261-294 - Jan Bormet, Stefan Dziembowski, Sebastian Faust, Tomasz Lizurej, Marcin Mielniczuk:
Strong Secret Sharing with Snitching. 295-327 - George Lu, Brent Waters:
How to Make Any Computational Secret Sharing Scheme Adaptively Secure. 328-355 - Allison Bishop, Matthew Green, Yuval Ishai, Abhishek Jain, Paul Lou:
Fully Anonymous Secret Sharing. 356-389 - Yuval Ishai, Hanjun Li, Huijia Lin:
A Unified Framework for Succinct Garbling from Homomorphic Secret Sharing. 390-425 - Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl:
Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR. 426-458 - Fei Xu, Honggang Hu, Changhong Xu:
Bitwise Garbling Schemes - A Model with 32λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\frac{3}{2}\lambda $$\end{document}-Bit Lower Bound of Ciphertexts. 459-488 - Geoffroy Couteau, Carmit Hazay, Aditya Hegde, Naman Kumar:
ømega (1/λ )-Rate Boolean Garbling Scheme from Generic Groups. 489-521 - Kelong Cong, Emmanuela Orsini, Erik Pohle, Oliver Zajonc:
Row Reduction Techniques for n-Party Garbling. 522-555 - David Heath, Vladimir Kolesnikov, Varun Narayanan, Rafail Ostrovsky, Akash Shah:
Multiparty Garbling from OT with Linear Scaling and RAM Support. 556-588 - Jake Januzelli, Mike Rosulek, Lawrence Roy:
Lower Bounds for Garbled Circuits from Shannon-Type Information Inequalities. 589-618 - Raphael Heitjohann, Jonas von der Heyden, Tibor Jager:
Rerandomizable Garbling, Revisited. 619-651 - Hanlin Liu, Xiao Wang, Kang Yang, Yu Yu:
Authenticated BitGC for Actively Secure Rate-One 2PC. 652-687
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-13 21:57 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:
