Abstract is missing.
- Revisiting Lattice Attacks on Overstretched NTRU ParametersPaul Kirchner, Pierre-Alain Fouque. 3-26 [doi]
- Short Generators Without Quantum Computers: The Case of MultiquadraticsJens Bauch, Daniel J. Bernstein, Henry de Valence, Tanja Lange, Christine van Vredendaal. 27-59 [doi]
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional EncryptionPrabhanjan Ananth, Aayush Jain, Amit Sahai. 91-121 [doi]
- From Minicrypt to Obfustopia via Private-Key Functional EncryptionIlan Komargodski, Gil Segev. 122-151 [doi]
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear MapsPrabhanjan Ananth, Amit Sahai. 152-181 [doi]
- Computation of a 768-Bit Prime Field Discrete LogarithmThorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata, Colin Stahlke. 185-201 [doi]
- A Kilobit Hidden SNFS Discrete Logarithm ComputationJoshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé. 202-231 [doi]
- Improved Private Set Intersection Against Malicious AdversariesPeter Rindal, Mike Rosulek. 235-259 [doi]
- Formal Abstractions for Attested Execution Secure ProcessorsRafael Pass, Elaine Shi, Florian Tramèr. 260-289 [doi]
- One-Shot Verifiable Encryption from LatticesVadim Lyubashevsky, Gregory Neven. 293-323 [doi]
- Short Stickelberger Class Relations and Application to Ideal-SVPRonald Cramer, Léo Ducas, Benjamin Wesolowski. 324-348 [doi]
- Concurrently Composable Security with Shielded Super-Polynomial SimulatorsBrandon Broadnax, Nico Döttling, Gunnar Hartung, Jörn Müller-Quade, Matthias Nagel. 351-381 [doi]
- Unconditional UC-Secure Computation with (Stronger-Malicious) PUFsSaikrishna Badrinarayanan, Dakshita Khurana, Rafail Ostrovsky, Ivan Visconti. 382-411 [doi]
- Private Puncturable PRFs from Standard Lattice AssumptionsDan Boneh, Sam Kim, Hart William Montgomery. 415-445 [doi]
- 1 from LWERan Canetti, Yilei Chen. 446-476 [doi]
- Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness SlackRonald Cramer, Ivan Damgård, Chaoping Xing, Chen Yuan. 479-500 [doi]
- Sublinear Zero-Knowledge Arguments for RAM ProgramsPayman Mohassel, Mike Rosulek, Alessandra Scafuro. 501-531 [doi]
- Parallel Implementations of Masking Schemes and the Bounded Moment Leakage ModelGilles Barthe, François Dupressoir, Sebastian Faust, Benjamin Grégoire, François-Xavier Standaert, Pierre-Yves Strub. 535-566 [doi]
- How Fast Can Higher-Order Masking Be in Software?Dahmun Goudarzi, Matthieu Rivain. 567-597 [doi]
- Multi-input Inner-Product Functional Encryption from PairingsMichel Abdalla, Romain Gay, Mariana Raykova 0001, Hoeteck Wee. 601-626 [doi]
- Simplifying Design and Analysis of Complex Predicate Encryption SchemesShashank Agrawal, Melissa Chase. 627-656 [doi]
- 4-Normal Form for Elliptic CurvesDavid Kohel. 659-678 [doi]
- Efficient Compression of SIDH Public KeysCraig Costello, David Jao, Patrick Longa, Michael Naehrig, Joost Renes, David Urbanik. 679-706 [doi]