Advances in Cryptology – CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part I: Lecture Notes in Computer Science, cartea 11692
Editat de Alexandra Boldyreva, Daniele Micciancioen Limba Engleză Paperback – aug 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.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (3) | 798.72 lei 6-8 săpt. | |
Springer International Publishing – aug 2019 | 798.72 lei 6-8 săpt. | |
Springer International Publishing – aug 2019 | 910.60 lei 6-8 săpt. | |
Springer International Publishing – 3 aug 2019 | 910.77 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20% Preț: 1053.72 lei
- 20% Preț: 337.82 lei
- 20% Preț: 339.43 lei
- 20% Preț: 449.99 lei
- 20% Preț: 238.01 lei
- 20% Preț: 337.82 lei
- 20% Preț: 438.69 lei
- Preț: 446.28 lei
- 20% Preț: 341.10 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 640.52 lei
- 17% Preț: 427.22 lei
- 20% Preț: 650.20 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1067.33 lei
- 20% Preț: 587.17 lei
- Preț: 378.43 lei
- 20% Preț: 334.54 lei
- 15% Preț: 435.36 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1404.34 lei
- 20% Preț: 1016.88 lei
- 20% Preț: 575.04 lei
- 20% Preț: 575.48 lei
- 20% Preț: 579.12 lei
- 20% Preț: 757.61 lei
- 15% Preț: 576.20 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 350.92 lei
- 20% Preț: 581.57 lei
- Preț: 407.85 lei
- 20% Preț: 592.06 lei
- 20% Preț: 757.61 lei
- 20% Preț: 819.86 lei
- 20% Preț: 649.49 lei
- 20% Preț: 347.62 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 798.72 lei
Preț vechi: 974.05 lei
-18% Nou
Puncte Express: 1198
Preț estimativ în valută:
152.97€ • 157.60$ • 128.14£
152.97€ • 157.60$ • 128.14£
Carte tipărită la comandă
Livrare economică 24 februarie-10 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030269470
ISBN-10: 3030269477
Pagini: 2450
Ilustrații: XXIII, 771 p. 1614 illus., 51 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 1.09 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
ISBN-10: 3030269477
Pagini: 2450
Ilustrații: XXIII, 771 p. 1614 illus., 51 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 1.09 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
Award Papers.- Cryptanalysis of OCB2: Attacks on Authenticity and Confidentiality.- Quantum cryptanalysis in the RAM model: Claw-finding attacks on SIKE.- Fully Secure Attribute-Based Encryption for t-CNF from LWE.- Lattice-Based ZK.- Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors.- Lattice-Based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications.- Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications.- Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs.- Symmetric Cryptography.- Seedless Fruit is the Sweetest: Random Number Generation, Revisited.- Nonces are Noticed: AEAD Revisited.- How to Build Pseudorandom Functions From Public Random Permutations.- Mathematical Cryptanalysis.- New Results on Modular Inversion Hidden Number Problem and Inversive Congruential Generator.- On the Shortness of Vectors to be found bythe Ideal-SVP Quantum Algorithm.- Proofs of Storage.- Proofs of Replicated Storage Without Timing Assumptions.- Simple Proofs of Space-Time and Rational Proofs of Storage.- Non-Malleable Codes.- Non-Malleable Codes for Decision Trees.- Explicit Rate-1 Non-malleable Codes for Local Tampering.- Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space.- SNARKs and Blockchains.- Synchronous, with a Chance of Partition Tolerance.- Subvector Commitments with Application to Succinct Arguments.- Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains.- Homomorphic Cryptography.- On the Plausibility of Fully Homomorphic Encryption for RAMs.- Homomorphic Time-Lock Puzzles and Applications.- Symmetric Primitives with Structured Secrets.- Leakage Models and Key Reuse.- Unifying Leakage Models on a Rényi Day.- Leakage Certification Revisited: Bounding Model Errors in Side-Channel Security Evaluations.- Security inthe Presence of Key Reuse: Context-Separable Interfaces and their Applications.