Theory of Cryptography

17th International Conference, TCC 2019, Nuremberg, Germany, December 1¿5, 2019, Proceedings, Part II
Herausgegeben:Hofheinz, Dennis; Rosen, Alon

• Broschiertes Buch

Produktbeschreibung

The two-volume set LNCS 11891 and 11892 constitutes the proceedings of the 17th International Conference on Theory of Cryptography, TCC 2019, held in Nuremberg, Germany, in December 2019.
The 43 full papers presented were carefully reviewed and selected from 147 submissions. The Theory of Cryptography Conference deals with the paradigms, approaches, and techniques used to conceptualize natural cryptographic problems and provide algorithmic solutions to them and much more.

Produktdetails

• Lecture Notes in Computer Science 11892
• Verlag: Springer / Springer International Publishing / Springer, Berlin
• Artikelnr. des Verlages: 978-3-030-36032-0
• 1st ed. 2019
• Seitenzahl: 592
• Erscheinungstermin: 24. November 2019
• Englisch
• Abmessung: 235mm x 155mm x 32mm
• Gewicht: 885g
• ISBN-13: 9783030360320
• ISBN-10: 3030360326
• Artikelnr.: 57972585

Inhaltsangabe

Succinct Arguments in the Quantum Random Oracle Model.- Delegating Quantum Computation in the Quantum Random Oracle Model.- Tighter proofs of CCA security in the quantum random oracle model.- Attribute Based Encryption for Deterministic Finite Automata from DLIN.- CPA-to-CCA Transformation for KDM Security.- New Approaches to Traitor Tracing with Embedded Identities.- A Unified and Composable Take on Ratcheting.- Continuously Non-Malleable Secret Sharing for General Access Structures.- Interactive Non-Malleable Codes.- Stronger Lower Bounds for Online ORAM.- Adaptively Secure Garbling Schemes for Parallel Computations.- Statistical Difference Beyond the Polarizing Regime.- Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions & Hardness.- Fully Homomorphic NIZK and NIWI Proofs.- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND.- Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles.- Compressible FHE with Applications to PIR.- Permuted Puzzles and Cryptographic Hardness.- Linear-Size Constant-Query IOPs for Delegating Computation.- On the (In)security of Kilian-Based SNARGs.- Incrementally Verifiable Computation via Incremental PCPs.