Advances in Cryptology – CRYPTO 2020 : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II /: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II. (2020)
- Record Type:
- Book
- Title:
- Advances in Cryptology – CRYPTO 2020 : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II /: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II. (2020)
- Main Title:
- Advances in Cryptology – CRYPTO 2020 : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II
- Further Information:
- Note: Daniele Micciancio, Thomas Ristenpart.
- Editors:
- Micciancio, Daniele
Ristenpart, Thomas - Contents:
- 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.-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 Secure MPCs.- 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. … (more)
- Publisher Details:
- Cham : Springer
- Publication Date:
- 2020
- Copyright Date:
- 2020
- Extent:
- 1 online resource (856 pages)
- Subjects:
- Computer science
Data encryption (Computer science)
Data structures (Computer science)
Computer communication systems
Computer security
Application software
Software engineering
Computers -- Information Theory
Computers -- Hardware -- Network Hardware
Computers -- Security -- General
Computers -- Information Technology
Computers -- Software Development & Engineering -- General
Algorithms & data structures
Network hardware
Computer security
Information retrieval
Software Engineering
Coding theory & cryptology - Languages:
- English
- ISBNs:
- 9783030568801
- Related ISBNs:
- 9783030568795
- Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.537773
- Ingest File:
- 03_144.xml