Theory of cryptography : 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II /: 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II. (2019)
- Record Type:
- Book
- Title:
- Theory of cryptography : 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II /: 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II. (2019)
- Main Title:
- Theory of cryptography : 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II
- Other Titles:
- TCC 2019
- Further Information:
- Note: Dennis Hofheinz, Alon Rosen, editors.
- Editors:
- Hofheinz, Dennis
Rosen, Alon - Other Names:
- Theory of Cryptography Conference, 17th
- Contents:
- 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.
- Publisher Details:
- Cham, Switzerland : Springer
- Publication Date:
- 2019
- Copyright Date:
- 2019
- Extent:
- 1 online resource (xiv, 578 pages), illustrations
- Subjects:
- 005.82
Data encryption (Computer science) -- Congresses
Data structures (Computer science) -- Congresses
Cryptography -- Congresses - Languages:
- English
- ISBNs:
- 9783030360337
3030360334 - Notes:
- Note: Includes bibliographical references and author index.
Note: Description based on online resource (SpringerLink, viewed December 3, 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.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.475106
- Ingest File:
- 02_626.xml