Cantitate/Preț
Produs
Total produse
Vezi coșul
Theory of Cryptography de Dennis Hofheinz

Theory of Cryptography: Lecture Notes in Computer Science, cartea 11892

Editat de Dennis Hofheinz, Alon Rosen
en Limba Engleză Paperback – 24 noi 2019
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33713 lei

Preț vechi: 42141 lei
-20%

Puncte Express: 506
Paperback (2) de la 33713 lei

Carte tipărită la comandă

Livrare economică 08-22 iunie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030360320
ISBN-10: 3030360326
Pagini: 592
Ilustrații: XIV, 578 p. 565 illus., 7 illus. in color.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.89 kg
Ediția:1st ed. 2019
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.