Abstract is missing.
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions - Or: How to Secretly Embed a Circuit in Your PRFZvika Brakerski, Vinod Vaikuntanathan. 1-30 [doi]
- Key-Homomorphic Constrained Pseudorandom FunctionsAbhishek Banerjee 0001, Georg Fuchsbauer, Chris Peikert, Krzysztof Pietrzak, Sophie Stevens. 31-60 [doi]
- Aggregate Pseudorandom Functions and Connections to LearningAloni Cohen, Shafi Goldwasser, Vinod Vaikuntanathan. 61-89 [doi]
- Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFsCarmit Hazay. 90-120 [doi]
- Verifiable Random Functions from Weaker AssumptionsTibor Jager. 121-143 [doi]
- Multi-Client Verifiable Computation with Stronger Security GuaranteesS. Dov Gordon, Jonathan Katz, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou. 144-168 [doi]
- Public Verification of Private EffortGiulia Alberini, Tal Moran, Alon Rosen. 169-198 [doi]
- Primary-Secondary-Resolver Membership Proof SystemsMoni Naor, Asaf Ziv. 199-228 [doi]
- Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-DivergenceKai-Min Chung, Rafael Pass. 229-246 [doi]
- Stretching Groth-Sahai: NIZK Proofs of Partial SatisfiabilityCarla RÃ fols. 247-276 [doi]
- Outlier PrivacyEdward Lui, Rafael Pass. 277-305 [doi]
- Function-Private Functional Encryption in the Private-Key SettingZvika Brakerski, Gil Segev. 306-324 [doi]
- Functional Encryption for Randomized FunctionalitiesVipul Goyal, Abhishek Jain 0002, Venkata Koppula, Amit Sahai. 325-351 [doi]
- Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal AssumptionsIlan Komargodski, Gil Segev, Eylon Yogev. 352-377 [doi]
- Separations in Circular Security for Arbitrary Length Key CyclesVenkata Koppula, Kim Ramchen, Brent Waters. 378-400 [doi]
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability ObfuscationNir Bitansky, Omer Paneth. 401-427 [doi]
- Random-Oracle Uninstantiability from Indistinguishability ObfuscationChristina Brzuska, Pooya Farshim, Arno Mittelbach. 428-455 [doi]
- On Obfuscation with Random OraclesRan Canetti, Yael Tauman Kalai, Omer Paneth. 456-467 [doi]
- Obfuscation of Probabilistic Circuits and ApplicationsRan Canetti, Huijia Lin, Stefano Tessaro, Vinod Vaikuntanathan. 468-497 [doi]
- Graph-Induced Multilinear Maps from LatticesCraig Gentry, Sergey Gorbunov, Shai Halevi. 498-527 [doi]
- Obfuscating Circuits via Composite-Order Graded EncodingBenny Applebaum, Zvika Brakerski. 528-556 [doi]
- Adaptively Secure Two-Party Computation from Indistinguishability ObfuscationRan Canetti, Shafi Goldwasser, Oxana Poburinnaya. 557-585 [doi]
- Adaptively Secure, Universally Composable, Multiparty Computation in Constant RoundsDana Dachman-Soled, Jonathan Katz, Vanishree Rao. 586-613 [doi]
- Two-Round Adaptively Secure MPC from Indistinguishability ObfuscationSanjam Garg, Antigoni Polychroniadou. 614-637 [doi]
- Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NPOmkant Pandey, Manoj Prabhakaran, Amit Sahai. 638-667 [doi]
- Public-Coin Differing-Inputs Obfuscation and Its ApplicationsYuval Ishai, Omkant Pandey, Amit Sahai. 668-697 [doi]