Cantitate/Preț
Produs

Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part I: Lecture Notes in Computer Science, cartea 11891

Editat de Dennis Hofheinz, Alon Rosen
en Limba Engleză Paperback – 23 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

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 38988 lei  6-8 săpt.
  Springer International Publishing – 24 noi 2019 38988 lei  6-8 săpt.
  Springer International Publishing – 23 noi 2019 39096 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 39096 lei

Nou

Puncte Express: 586

Preț estimativ în valută:
6918 8123$ 6072£

Carte tipărită la comandă

Livrare economică 27 ianuarie-10 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030360290
ISBN-10: 3030360296
Pagini: 598
Ilustrații: XIV, 598 p. 357 illus., 12 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.85 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology

Locul publicării:Cham, Switzerland

Cuprins

Algebraically Structured LWE, Revisited.- Lattice Trapdoors and IBE from Middle-Product LWE.- Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation.- Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems.- A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement.- Synchronous Consensus with Optimal Asynchronous Fallback Guarantees.- Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank.- Optimal Bounded-Collusion Secure Functional Encryption.- From FE Combiners to Secure MPC and Back.- (Pseudo) Random Quantum States with Binary Phase.- General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography.- Composable and Finite Computational Security of Quantum Message Transmission.- On Fully Secure MPC with Solitary Output.- Secure Computation with Preprocessing via Function Secret Sharing.- Efficient Private PEZ Protocols for Symmetric Functions.- TheFunction-Inversion Problem: Barriers and Opportunities.- On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations.- Characterizing Collision and Second-Preimage Resistance in Linicrypt.- Efficient Information-Theoretic Secure Multiparty Computation over Z/pkZ via Galois Rings.- Is Information-Theoretic Topology-Hiding Computation Possible.- Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.- On Perfectly Secure 2PC in the OT-Hybrid Model.