Cantitate/Preț
Produs
Total produse
Vezi coșul
Advances in Cryptology – CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part II de Alexandra Boldyreva

Advances in Cryptology – CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part II: Lecture Notes in Computer Science, cartea 11693

Editat de Alexandra Boldyreva, Daniele Micciancio
en Limba Engleză Paperback – 3 aug 2019
The three-volume set, LNCS 11692, LNCS 11693, and LNCS 11694, constitutes the refereed proceedings of the 39th Annual International Cryptology Conference, CRYPTO 2019, held in Santa Barbara, CA, USA, in August 2019.
The 81 revised full papers presented were carefully reviewed and selected from 378 submissions. The papers are organized in the following topical sections:
Part I: Award papers; lattice-based ZK; symmetric cryptography; mathematical cryptanalysis; proofs of storage; non-malleable codes; SNARKs and blockchains; homomorphic cryptography; leakage models and key reuse.
Part II: MPC communication complexity; symmetric cryptanalysis; (post) quantum cryptography; leakage resilience; memory hard functions and privacy amplification; attribute based encryption; foundations.
Part III: Trapdoor functions; zero knowledge I; signatures and messaging; obfuscation; watermarking; secure computation; various topics; zero knowledge II; key exchange and broadcast encryption.

Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (3) 78836 lei  6-8 săpt.
  Springer International Publishing – aug 2019 78836 lei  6-8 săpt.
  Springer International Publishing – aug 2019 89878 lei  6-8 săpt.
  Springer International Publishing – 3 aug 2019 89895 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 89895 lei

Preț vechi: 109627 lei
-18% Nou

Puncte Express: 1348
Preț estimativ în valută:
17210€ • 17888$ • 14269£

Carte tipărită la comandă

Livrare economică 06-20 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030269500
ISBN-10: 3030269507
Pagini: 861
Ilustrații: XV, 861 p. 1632 illus., 100 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 1.21 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

MPC Communication Complexity.- The Communication Complexity of Threshold Private Set Intersection.- Adaptively Secure MPC with Sublinear Communication Complexity.- Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing.- Communication-Efficient Unconditional MPC with Guaranteed Output Delivery.- Symmetric Cryptanalysis.- Efficient Collision Attack Frameworks for RIPEMD-160.- Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning.- Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full MORUS.- Low Memory Attacks against Two-Round Even-Mansour using the 3-XOR Problem.- (Post) Quantum Cryptography.- How to Record Quantum Queries, and Applications to Quantum Indifferentiability.- Quantum security proofs using semi-classical oracles.- Quantum Indistinguishability of Random Sponges.- Revisiting Post-Quantum Fiat-Shamir.- Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model.-Leakage Resilience.- Unconditionally Secure Computation Against Low-Complexity Leakage.- Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System.- Non-Malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate.- Leakage Resilient Secret Sharing and Applications.- Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures.- Memory Hard Functions and Privacy Amplification.- Memory-Hard Functions from Cryptographic Primitives.- Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions.- Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge.- The Privacy Blanket of the Shuffle Model.- Attribute Based Encryption.- Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption.- Match Me if You Can: Matchmaking Encryption and its Applications.- ABE for DFA from k-Lin.- Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE.- Foundations.- The Distinction Between Fixed and Random Generators in Group-Based Assumptions.- Unifying computational entropies via Kullback–Leibler divergence.