Advances in Cryptology ¿ CRYPTO 2020

40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17¿21, 2020, Proceedings, Part II
Herausgegeben:Micciancio, Daniele; Ristenpart, Thomas

• Broschiertes Buch

Produktbeschreibung

Conference on Cryptologic Research, CRYPTO 2020, which was held during August 17-21, 2020. Crypto has traditionally been held at UCSB every year, but due to the COVID-19 pandemic it will be an online event in 2020.

The 85 papers presented in the proceedings were carefully reviewed and selected from a total of 371 submissions. They were organized in topical sections as follows:

Part I: Security Models; Symmetric and Real World Cryptography; Hardware Security and Leakage Resilience; Outsourced encryption; Constructions.

Part II: Public Key Cryptanalysis; Lattice Algorithms and Cryptanalysis; Lattice-based and Post Quantum Cryptography; Multi-Party Computation.

Part III: Multi-Party Computation; Secret Sharing; Cryptanalysis; Delay functions; Zero Knowledge.

Produktdetails

• Lecture Notes in Computer Science 12171
• Verlag: Springer / Springer International Publishing / Springer, Berlin
• Artikelnr. des Verlages: 978-3-030-56879-5
• 1st ed. 2020
• Seitenzahl: 872
• Erscheinungstermin: 13. August 2020
• Englisch
• Abmessung: 235mm x 155mm x 47mm
• Gewicht: 1293g
• ISBN-13: 9783030568795
• ISBN-10: 3030568792
• Artikelnr.: 59809904

Inhaltsangabe

Public Key Cryptanalysis- A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem.- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields.- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment.- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory.- A Classification of Computational Assumptions in the Algebraic Group Model.- Lattice Algorithms and Cryptanalysis.- Fast reduction of algebraic lattices over cyclotomic fields.- Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)).- Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP.- Random Self-reducibility of Ideal-SVP via Arakelov Random Walks.- Slide Reduction, Revisited'ÄîFilling the Gaps in SVP Approximation.- Rounding in the Rings.- Lattice-based and post-quantum cryptography.- LWE with Side Information: Attacks and Concrete Security Estimation.- A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM.- Efficient Pseudorandom Correlation Generators from Ring-LPN.- Scalable Pseudorandom Quantum States.- A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge.- Practical Product Proofs for Lattice Commitments.-Lattice-Based Blind Signatures, Revisited.- Multi-Party Computation.- 12171 Round-optimal Black-box Commit-and-prove with Succinct Communication.- Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability.- Black-box use of One-way Functions is Useless for Optimal Fair Coin-Tossing.- Guaranteed Output Delivery Comes Free in Honest Majority MPC.- Black-Box Transformations from Passive to Covert Security with Public Verifiability.- MPC with Friends and Foes.- Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback.- Reverse Firewalls for Actively SecureMPCs.- Stacked Garbling: Garbled Circuit Proportional to Longest Execution Path.- Better Concrete Security for Half-Gates Garbling (in the Multi-Instance Setting).- Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits.