default search action
40th CRYPTO 2020: Santa Barbara, CA, USA - Part II
- Daniele Micciancio
, Thomas Ristenpart
Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II. Lecture Notes in Computer Science 12171, Springer 2020, ISBN 978-3-030-56879-5
Public Key Cryptanalysis
- Jean-Sébastien Coron, Agnese Gini
A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem. 3-31 - Gabrielle De Micheli
Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields. 32-61 - Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. 62-91 - Wouter Castryck
Breaking the Decisional Diffie-Hellman Problem for Class Group Actions Using Genus Theory. 92-120 - Balthazar Bauer, Georg Fuchsbauer, Julian Loss:
A Classification of Computational Assumptions in the Algebraic Group Model. 121-151
Lattice Algorithms and Cryptanalysis
- Paul Kirchner, Thomas Espitau, Pierre-Alain Fouque
Fast Reduction of Algebraic Lattices over Cyclotomic Fields. 155-185 - Martin R. Albrecht, Shi Bai, Pierre-Alain Fouque
Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k1/(2k) Time kk/8+o(k). 186-212 - Tamalika Mukherjee, Noah Stephens-Davidowitz:
Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP. 213-242 - Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski:
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. 243-273 - Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz:
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. 274-295 - Feng-Hao Liu, Zhedong Wang:
Rounding in the Rings. 296-326
Lattice-Based and Post-quantum Cryptography
- Dana Dachman-Soled, Léo Ducas, Huijing Gong, Mélissa Rossi:
LWE with Side Information: Attacks and Concrete Security Estimation. 329-358 - Qian Guo
A Key-Recovery Timing Attack on Post-quantum Primitives Using the Fujisaki-Okamoto Transformation and Its Application on FrodoKEM. 359-386 - Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Efficient Pseudorandom Correlation Generators from Ring-LPN. 387-416 - Zvika Brakerski, Omri Shmueli:
Scalable Pseudorandom Quantum States. 417-440 - Jonathan Bootle
A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. 441-469 - Thomas Attema
Practical Product Proofs for Lattice Commitments. 470-499 - Eduard Hauck
Lattice-Based Blind Signatures, Revisited. 500-529
Multi-party computation
- Susumu Kiyoshima:
Round-Optimal Black-Box Commit-and-Prove with Succinct Communication. 533-561 - Carsten Baum, Emmanuela Orsini
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. 562-592 - Hemanta K. Maji, Mingyuan Wang:
Black-Box Use of One-Way Functions is Useless for Optimal Fair Coin-Tossing. 593-617 - Vipul Goyal, Yifan Song, Chenzhi Zhu:
Guaranteed Output Delivery Comes Free in Honest Majority MPC. 618-646 - Ivan Damgård, Claudio Orlandi, Mark Simkin:
Black-Box Transformations from Passive to Covert Security with Public Verifiability. 647-676 - Bar Alon
MPC with Friends and Foes. 677-706 - Erica Blum
Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback. 707-731 - Suvradip Chakraborty, Stefan Dziembowski, Jesper Buus Nielsen:
Reverse Firewalls for Actively Secure MPCs. 732-762 - David Heath, Vladimir Kolesnikov:
Stacked Garbling - Garbled Circuit Proportional to Longest Execution Path. 763-792 - Chun Guo, Jonathan Katz, Xiao Wang
Better Concrete Security for Half-Gates Garbling (in the Multi-instance Setting). 793-822 - Daniel Escudero, Satrajit Ghosh, Marcel Keller
Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. 823-852
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: