Abstract is missing.
- A Polynomial-Time Algorithm for Solving the Hidden Subset Sum ProblemJean-Sébastien Coron, Agnese Gini. 3-31 [doi]
- Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite FieldsGabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot. 32-61 [doi]
- Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit ExperimentFabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann. 62-91 [doi]
- Breaking the Decisional Diffie-Hellman Problem for Class Group Actions Using Genus TheoryWouter Castryck, Jana Sotáková, Frederik Vercauteren. 92-120 [doi]
- A Classification of Computational Assumptions in the Algebraic Group ModelBalthazar Bauer, Georg Fuchsbauer, Julian Loss. 121-151 [doi]
- Fast Reduction of Algebraic Lattices over Cyclotomic FieldsPaul Kirchner, Thomas Espitau, Pierre-Alain Fouque. 155-185 [doi]
- k/8+o(k)Martin R. Albrecht, Shi Bai, Pierre-Alain Fouque, Paul Kirchner, Damien Stehlé, Weiqiang Wen. 186-212 [doi]
- Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVPTamalika Mukherjee, Noah Stephens-Davidowitz. 213-242 [doi]
- Random Self-reducibility of Ideal-SVP via Arakelov Random WalksKoen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski. 243-273 [doi]
- Slide Reduction, Revisited - Filling the Gaps in SVP ApproximationDivesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz. 274-295 [doi]
- Rounding in the RingsFeng-Hao Liu, Zhedong Wang. 296-326 [doi]
- LWE with Side Information: Attacks and Concrete Security EstimationDana Dachman-Soled, Léo Ducas, Huijing Gong, Mélissa Rossi. 329-358 [doi]
- A Key-Recovery Timing Attack on Post-quantum Primitives Using the Fujisaki-Okamoto Transformation and Its Application on FrodoKEMQian Guo 0001, Thomas Johansson 0001, Alexander Nilsson. 359-386 [doi]
- Efficient Pseudorandom Correlation Generators from Ring-LPNElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl. 387-416 [doi]
- Scalable Pseudorandom Quantum StatesZvika Brakerski, Omri Shmueli. 417-440 [doi]
- A Non-PCP Approach to Succinct Quantum-Safe Zero-KnowledgeJonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen 0001, Gregor Seiler. 441-469 [doi]
- Practical Product Proofs for Lattice CommitmentsThomas Attema, Vadim Lyubashevsky, Gregor Seiler. 470-499 [doi]
- Lattice-Based Blind Signatures, RevisitedEduard Hauck, Eike Kiltz, Julian Loss, Ngoc Khanh Nguyen 0001. 500-529 [doi]
- Round-Optimal Black-Box Commit-and-Prove with Succinct CommunicationSusumu Kiyoshima. 533-561 [doi]
- Efficient Constant-Round MPC with Identifiable Abort and Public VerifiabilityCarsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez. 562-592 [doi]
- Black-Box Use of One-Way Functions is Useless for Optimal Fair Coin-TossingHemanta K. Maji, Mingyuan Wang. 593-617 [doi]
- Guaranteed Output Delivery Comes Free in Honest Majority MPCVipul Goyal, Yifan Song, Chenzhi Zhu. 618-646 [doi]
- Black-Box Transformations from Passive to Covert Security with Public VerifiabilityIvan Damgård, Claudio Orlandi, Mark Simkin 0001. 647-676 [doi]
- MPC with Friends and FoesBar Alon, Eran Omri, Anat Paskin-Cherniavsky. 677-706 [doi]
- Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous FallbackErica Blum, Chen-Da Liu Zhang, Julian Loss. 707-731 [doi]
- Reverse Firewalls for Actively Secure MPCsSuvradip Chakraborty, Stefan Dziembowski, Jesper Buus Nielsen. 732-762 [doi]
- Stacked Garbling - Garbled Circuit Proportional to Longest Execution PathDavid Heath, Vladimir Kolesnikov. 763-792 [doi]
- Better Concrete Security for Half-Gates Garbling (in the Multi-instance Setting)Chun Guo, Jonathan Katz, Xiao Wang, Chenkai Weng, Yu Yu 0001. 793-822 [doi]
- Improved Primitives for MPC over Mixed Arithmetic-Binary CircuitsDaniel Escudero 0001, Satrajit Ghosh, Marcel Keller, Rahul Rachuri, Peter Scholl. 823-852 [doi]