Abstract is missing.
- The Round Complexity of Black-Box Post-quantum Secure ComputationRohit Chatterjee, Xiao Liang 0014, Omkant Pandey, Takashi Yamakawa. 3-35 [doi]
- Constant-Round Asynchronous MPC with Optimal Resilience and Linear CommunicationJunru Li, Yifan Song. 36-69 [doi]
- Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round CollapsingVipul Goyal, Junru Li, Rafail Ostrovsky, Yifan Song 0001. 70-104 [doi]
- 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 Shin. 105-139 [doi]
- Multiparty Distributed Point FunctionsAarushi Goel, Mingyuan Wang 0001, Zhiheng Wang. 140-173 [doi]
- Computationally Differentially Private Inner-Product Protocols Imply Oblivious TransferIftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan. 174-206 [doi]
- Efficient Pseudorandom Correlation Generators over $\mathbb {Z}/p^k\mathbb {Z}$Zhe Li, Chaoping Xing, Yizhou Yao, Chen Yuan 0003. 207-240 [doi]
- Additive Randomized Encodings from Public Key EncryptionNir Bitansky, Saroja Erabelli, Rachit Garg 0001. 241-260 [doi]
- Computationally Efficient Asynchronous MPC with Linear Communication and Low Additive OverheadAkhil Bandarupalli, Xiaoyu Ji, Aniket Kate, Chen-Da Liu Zhang, Yifan Song 0001. 261-294 [doi]
- Strong Secret Sharing with SnitchingJan Bormet, Stefan Dziembowski, Sebastian Faust, Tomasz Lizurej, Marcin Mielniczuk. 295-327 [doi]
- How to Make Any Computational Secret Sharing Scheme Adaptively SecureGeorge Lu, Brent Waters. 328-355 [doi]
- Fully Anonymous Secret SharingAllison Bishop, Matthew Green 0001, Yuval Ishai, Abhishek Jain 0002, Paul Lou. 356-389 [doi]
- A Unified Framework for Succinct Garbling from Homomorphic Secret SharingYuval Ishai, Hanjun Li 0001, Huijia Lin. 390-425 [doi]
- Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCRPierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl. 426-458 [doi]
- 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 CiphertextsFei Xu, Honggang Hu, Changhong Xu. 459-488 [doi]
- ømega (1/λ )-Rate Boolean Garbling Scheme from Generic GroupsGeoffroy Couteau, Carmit Hazay, Aditya Hegde 0003, Naman Kumar 0002. 489-521 [doi]
- Row Reduction Techniques for n-Party GarblingKelong Cong, Emmanuela Orsini, Erik Pohle, Oliver Zajonc. 522-555 [doi]
- Multiparty Garbling from OT with Linear Scaling and RAM SupportDavid Heath, Vladimir Kolesnikov, Varun Narayanan, Rafail Ostrovsky, Akash Shah. 556-588 [doi]
- Lower Bounds for Garbled Circuits from Shannon-Type Information InequalitiesJake Januzelli, Mike Rosulek, Lawrence Roy. 589-618 [doi]
- Rerandomizable Garbling, RevisitedRaphael Heitjohann, Jonas von der Heyden, Tibor Jager. 619-651 [doi]
- Authenticated BitGC for Actively Secure Rate-One 2PCHanlin Liu, Xiao Wang 0012, Kang Yang 0002, Yu Yu 0001. 652-687 [doi]