Del 11892 i serien Lecture Notes in Computer Science

Theory of Cryptography

17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part II

Häftad, Engelska, 2019

719 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2019-11-24
Mått155 x 235 x 32 mm
Vikt885 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor578
FörlagSpringer Nature Switzerland AG
ISBN9783030360320

Tillhör följande kategorier

Tillämpad datateknik inom Data och IT
Hårdvara inom Data och IT
Referensverk och tvärvetenskap inom Samhälle och politik
IT-säkerhet inom Data och IT

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.