Abstract is missing.
- A Theory of Composition for Differential ObliviousnessMingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon. 3-34 [doi]
- On Differential Privacy and Adaptive Data Analysis with Bounded SpaceItai Dinur, Uri Stemmer, David P. Woodruff, Samson Zhou. 35-65 [doi]
- Deniable Authentication When Signing Keys LeakSuvradip Chakraborty, Dennis Hofheinz, Ueli Maurer, Guilherme Rito. 69-100 [doi]
- Let Attackers Program Ideal Models: Modularity and Composability for Adaptive CompromiseJoseph Jaeger. 101-131 [doi]
- Almost Tight Multi-user Security Under Adaptive Corruptions & Leakages in the Standard ModelShuai Han 0001, Shengli Liu 0001, Dawu Gu. 132-162 [doi]
- Privately Puncturing PRFs from Lattices: Adaptive Security and Collusion Resistant PseudorandomnessRupeng Yang. 163-193 [doi]
- Constrained Pseudorandom Functions from Homomorphic Secret SharingGeoffroy Couteau, Pierre Meyer, Alain Passelègue, Mahshid Riahinia. 194-224 [doi]
- Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic EncryptionYongwoo Lee, Daniele Micciancio, Andrey Kim, Rakyong Choi, Maxim Deryabin, Jieun Eom, Donghoon Yoo. 227-256 [doi]
- e and Faster Bootstrapping for Homomorphic EncryptionRobin Geelen, Ilia Iliashenko, Jiayi Kang, Frederik Vercauteren. 257-286 [doi]
- Functional Commitments for All Functions, with Transparent Setup and from SISLeo de Castro, Chris Peikert. 287-320 [doi]
- Batch Bootstrapping I: - A New Framework for SIMD Bootstrapping in Polynomial ModulusFeng-Hao Liu, Han Wang. 321-352 [doi]
- Batch Bootstrapping II: - Bootstrapping in Polynomial Modulus only Requires O~(1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tilde{O}(1)$$\end{document} FHE Multiplications in AmortizationFeng-Hao Liu, Han Wang. 353-384 [doi]
- Succinct Vector, Polynomial, and Functional Commitments from LatticesHoeteck Wee, David J. Wu 0001. 385-416 [doi]
- Efficient Laconic Cryptography from Learning with ErrorsNico Döttling, Dimitris Kolonelos, Russell W. F. Lai, Chuanwei Lin, Giulio Malavolta, Ahmadreza Rahimi. 417-446 [doi]
- Fully Adaptive Decentralized Multi-Authority ABEPratish Datta, Ilan Komargodski, Brent Waters. 447-478 [doi]
- On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based EncryptionAayush Jain, Huijia Lin, Ji Luo 0002. 479-510 [doi]
- Registered Attribute-Based EncryptionSusan Hohenberger, George Lu, Brent Waters, David J. Wu 0001. 511-542 [doi]
- Unbounded Quadratic Functional Encryption and More from PairingsJunichi Tomida. 543-572 [doi]
- Multi-key and Multi-input Predicate Encryption from Learning with ErrorsDanilo Francati, Daniele Friolo, Giulio Malavolta, Daniele Venturi 0001. 573-604 [doi]
- Broadcast, Trace and Revoke with Optimal Parameters from Polynomial HardnessShweta Agrawal, Simran Kumari, Anshu Yadav, Shota Yamada 0001. 605-636 [doi]
- 1/3-Size Ciphertexts and O(1)-Size Keys from k-LinJunqing Gong 0001, Ji Luo 0002, Hoeteck Wee. 637-668 [doi]