Advances in Cryptology -- CRYPTO 2019 : 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings.: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings. Part II (2019)

• Record Type: Book
• Other Titles: CRYPTO 2019
• Further Information: Note: Alexandra Boldyreva, Daniele Micciancio (eds.).
• Editors: Boldyreva, Alexandra; Micciancio, Daniele
• Other Names: CRYPTO (Conference), 39th
• Contents: MPC Communication Complexity.- The Communication Complexity of Threshold Private Set Intersection.- Adaptively Secure MPC with Sublinear Communication Complexity.- Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing.- Communication-Efficient Unconditional MPC with Guaranteed Output Delivery.- Symmetric Cryptanalysis.- Efficient Collision Attack Frameworks for RIPEMD-160.- Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning.- Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full MORUS.- Low Memory Attacks against Two-Round Even-Mansour using the 3-XOR Problem.- (Post) Quantum Cryptography.- How to Record Quantum Queries, and Applications to Quantum Indifferentiability.- Quantum security proofs using semi-classical oracles.- Quantum Indistinguishability of Random Sponges.- Revisiting Post-Quantum Fiat-Shamir.- Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model.- Leakage Resilience.- Unconditionally Secure Computation Against Low-Complexity Leakage.- Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System.- Non-Malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate.- Leakage Resilient Secret Sharing and Applications.- Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures.- Memory Hard Functions and Privacy Amplification.- Memory-Hard Functions from Cryptographic Primitives.- Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions.- Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge.- The Privacy Blanket of the Shuffle Model.- Attribute Based Encryption.- Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption.- Match Me if You Can: Matchmaking Encryption and its Applications.- ABE for DFA from k-Lin.- Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE.- Foundations.- The Distinction Between Fixed and Random Generators in Group-Based Assumptions.- Unifying computational entropies via Kullback–Leibler divergence.
• Publisher Details: Cham, Switzerland : Springer
• Publication Date: 2019
• Extent: 1 online resource (xv, 861 pages), illustrations (some color)
• Subjects: 005.8/2; Data encryption (Computer science) -- Congresses; Computer security -- Congresses; Electronic books
• Languages: English
• ISBNs: 9783030269517; 3030269515
• Related ISBNs: 9783030269500
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed August 30, 2019).
• 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.