Advances in Cryptology – CRYPTO 2019

39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part III

Häftad, Engelska, 2019

Av Alexandra Boldyreva, Daniele Micciancio

1 979 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

The three-volume set, LNCS 11692, LNCS 11693, and LNCS 11694, constitutes the refereed proceedings of the 39th Annual International Cryptology Conference, CRYPTO 2019, held in Santa Barbara, CA, USA, in August 2019. The 81 revised full papers presented were carefully reviewed and selected from 378 submissions.

Produktinformation

Utgivningsdatum2019-08-01
Mått155 x 235 x 47 mm
Vikt1 299 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor859
FörlagSpringer Nature Switzerland AG
ISBN9783030269531

Tillhör följande kategorier

Informationsteknik: allmänt inom Data och it
Programvaruutveckling inom Data och it
Hårdvara inom Data och it
Artificiell intelligens inom Data och it
Referensverk och tvärvetenskap inom Samhalle och politik
IT-säkerhet inom Data och it

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.-