Advances in Cryptology – CRYPTO 2020 : 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III /: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III. (2020)

• Record Type: Book
• Further Information: Note: Daniele Micciancio, Thomas Ristenpart.
• Editors: Micciancio, Daniele; Ristenpart, Thomas
• Contents: Multi-Party Computation: Two-Sided Malicious Security for Private Intersection-Sum with Cardinality.- Private Set Intersection in the Internet Setting From Lightweight Oblivious PRF.- Multiparty Generation of an RSA Modulus.- Secret Sharing.- Non-Malleability against Polynomial Tampering.- Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model.- Nearly Optimal Robust Secret Sharing against Rushing Adversaries.- Cryptanalysis.- Cryptanalytic Extraction of Neural Network Models.- Automatic Verification of Differential Characteristics: Application to Reduced Gimli.- The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers.- Cryptanalysis of The Lifted Unbalanced Oil Vinegar Signature Scheme.- Out of Oddity -- New Cryptanalytic Techniques against Symmetric Primitives Optimized for Integrity Proof Systems.- Improved Differential-Linear Attacks with Applications to ARX Ciphers.- Cryptanalysis Results on Spook: Bringing Full-round Shadow-512 to the Light.- Cryptanalysis of LEDAcrypt.- Alzette: a 64-bit ARX-box (feat. CRAX and TRAX).- Delay functions.- Order-Fairness for Byzantine Consensus.- Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions.- Zero Knowledge.- Compressed Sigma-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics.- A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence.- Interactive Proofs for Social Graphs.- The Measure-and-Reprogram Technique 2.0: Multi-Round Fiat-Shamir and More.- Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs.- PPAD-Hardness and Delegation with Unambiguous Proofs.- New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust.- Spartan: Efficient and general-purpose zkSNARKs.- NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations.- Shorter Non-Interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages.- Non-Interactive Zero-Knowledge Arguments for QMA, with preprocessing.
• Publisher Details: Cham : Springer
• Publication Date: 2020
• Copyright Date: 2020
• Extent: 1 online resource (832 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: 9783030568771
• Related ISBNs: 9783030568764
• 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.