Advances in Cryptology - Crypto 2019: 39th Annual International Cryptology Conference, Santa Barbara, Ca, Usa, August 18-22, 2019, Proceedings, Part I

ISBN-13: 9783030269531 / Angielski / Miękka / 2019 / 859 str.

Alexandra Boldyreva; Daniele Micciancio

Spis treści

Trapdoor Functions.- Trapdoor Hash Functions and Their Applications.- CCA Security and Trapdoor Functions via Key-Dependent-Message Security.- Zero Knowledge I.- Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs.- Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge.- On Round Optimal Statistical Zero Knowledge Arguments.- Signatures and Messaging.- Repudiability and Claimability of Ring Signatures.- Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations.- Asymmetric Message Franking: Content Moderation for Metadata-Private End-to-End Encryption.- Obfuscation.- Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map.- Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification.- Watermarking.- Watermarking PRFs from Lattices: Stronger Security via Extractable PRFs.- Watermarking Public-Key Cryptographic Primitives.- Secure Computation.- SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension.- Universally Composable Secure Computation with Corrupted Tokens.- Reusable Non-Interactive Secure Computation.- Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.- Various Topics.- Adaptively Secure and Succinct Functional Encryption: Improving Security and Efficiency, Simultaneously.- Non-Interactive Non-Malleability from Quantum Supremacy.- Cryptographic Sensing.- Public-Key Cryptography in the Fine-Grained Setting.- Zero Knowledge II.- Exploring Constructions of Compact NIZKs from Various Assumptions.- New Constructions of Reusable Designated-Verifier NIZKs.- Scalable Zero Knowledge with no Trusted Setup.- Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation.- Key Exchange and Broadcast Encryption.- Highly Efficient Key Exchange Protocols with Optimal Tightness.- Strong Asymmetric PAKE based on Trapdoor CKEM.- Broadcast and Trace with N^∈ Ciphertext Size from Standard Assumptions.-