Theory of Cryptography : 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II / edited by Dennis Hofheinz, Alon Rosen.

Format:

Book

Contributor:

Hofheinz, Dennis, editor.

Rosen, Alon, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Security and cryptology ; SL 4, 11892.

Security and Cryptology ; 11892

Language:

English

Subjects (All):

Data encryption (Computer science).

Computer networks.

Application software.

Data structures (Computer science).

Computer security.

Computers.

Cryptology.

Computer Communication Networks.

Information Systems Applications (incl. Internet).

Data Structures and Information Theory.

Systems and Data Security.

Computing Milieux.

Local Subjects:

Cryptology.

Computer Communication Networks.

Information Systems Applications (incl. Internet).

Data Structures and Information Theory.

Systems and Data Security.

Computing Milieux.

Physical Description:

1 online resource (XIV, 578 pages) : 565 illustrations, 7 illustrations in color.

Edition:

First edition 2019.

Contained In:

Springer eBooks

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2019.

System Details:

text file PDF

Summary:

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.

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

Other Format:

Printed edition:

ISBN:

978-3-030-36033-7

9783030360337

Access Restriction:

Restricted for use by site license.