Advances in Cryptology - ASIACRYPT 2021: Security and Cryptology
Editat de Mehdi Tibouchi, Huaxiong Wangen Limba Engleză Paperback – 2 dec 2021
The total of 95 full papers presented in these proceedings was carefully reviewed and selected from 341 submissions. The papers were organized in topical sections as follows:
Part I: Best paper awards; public-key cryptanalysis; symmetric key cryptanalysis; quantum security;
Part II: physical attacks, leakage and countermeasures; multiparty computation; enhanced public-key encryption and time-lock puzzles; real-world protocols;
Part III: NIZK and SNARKs; theory; symmetric-key constructions; homomorphic encryption and encrypted search;
Part IV: Lattice cryptanalysis; post-quantum cryptography; advanced encryption and signatures; zero-knowledge proofs, threshold and multi-signatures; authenticated key exchange.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (4) | 643.58 lei 43-57 zile | |
| Springer – 2 dec 2021 | 643.58 lei 43-57 zile | |
| Springer – 2 dec 2021 | 698.09 lei 43-57 zile | |
| Springer – 2 dec 2021 | 701.76 lei 43-57 zile | |
| Springer – 2 dec 2021 | 754.19 lei 43-57 zile |
Din seria Security and Cryptology
- 20%
Preț: 327.36 lei - 20%
Preț: 325.30 lei - 20%
Preț: 330.54 lei -
Preț: 373.40 lei - 20%
Preț: 329.74 lei -
Preț: 372.15 lei -
Preț: 395.25 lei -
Preț: 383.23 lei -
Preț: 376.75 lei - 20%
Preț: 323.41 lei -
Preț: 383.23 lei - 15%
Preț: 672.87 lei -
Preț: 383.23 lei -
Preț: 380.46 lei -
Preț: 381.55 lei -
Preț: 377.68 lei -
Preț: 371.00 lei - 20%
Preț: 321.03 lei - 20%
Preț: 317.85 lei -
Preț: 379.15 lei -
Preț: 374.34 lei - 20%
Preț: 326.55 lei - 20%
Preț: 321.81 lei -
Preț: 368.43 lei - 20%
Preț: 319.42 lei -
Preț: 385.06 lei - 20%
Preț: 321.81 lei - 20%
Preț: 402.28 lei -
Preț: 376.75 lei - 20%
Preț: 320.24 lei -
Preț: 376.75 lei -
Preț: 379.51 lei -
Preț: 385.06 lei - 20%
Preț: 398.31 lei - 20%
Preț: 317.85 lei - 20%
Preț: 524.32 lei - 20%
Preț: 327.36 lei - 20%
Preț: 319.75 lei - 20%
Preț: 323.41 lei - 20%
Preț: 329.74 lei - 20%
Preț: 320.55 lei - 20%
Preț: 333.68 lei - 20%
Preț: 647.15 lei -
Preț: 432.39 lei - 20%
Preț: 327.54 lei - 20%
Preț: 401.78 lei - 20%
Preț: 329.60 lei - 20%
Preț: 642.40 lei -
Preț: 374.91 lei -
Preț: 376.75 lei
Preț: 698.09 lei
Preț vechi: 872.62 lei
-20%
Puncte Express: 1047
Preț estimativ în valută:
123.45€ • 144.87$ • 107.08£
123.45€ • 144.87$ • 107.08£
Carte tipărită la comandă
Livrare economică 09-23 martie
Specificații
ISBN-13: 9783030920777
ISBN-10: 3030920771
Pagini: 720
Ilustrații: XVII, 702 p. 110 illus., 18 illus. in color.
Dimensiuni: 155 x 235 x 39 mm
Greutate: 1.07 kg
Ediția:1st edition 2021
Editura: Springer
Seria Security and Cryptology
Locul publicării:Cham, Switzerland
ISBN-10: 3030920771
Pagini: 720
Ilustrații: XVII, 702 p. 110 illus., 18 illus. in color.
Dimensiuni: 155 x 235 x 39 mm
Greutate: 1.07 kg
Ediția:1st edition 2021
Editura: Springer
Seria Security and Cryptology
Locul publicării:Cham, Switzerland
Cuprins
Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions.- Gentry-Wichs Is Tight: A Falsifiable Non-Adaptively Sound SNARG.- Proofs for Inner Pairing Products and Applications.- Snarky Ceremonies.- Efficient NIZKs for Algebraic Sets.- Bit Security as Computational Cost for Winning Games with High Probability.- Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework).- How to Build a Trapdoor Function from an Encryption Scheme.- Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions.- Batching Base Oblivious Transfers.- Algebraic Adversaries in the Universal Composability Framework.- Luby-Rackoff Backwards with More Users and More Security.- Double-Block-Length Hash Function for Minimum Memory Size.- Toward a Fully Secure Authenticated Encryption Scheme From a Pseudorandom Permutation.- Tight Security for Key-Alternating Ciphers with Correlated Sub-Keys.- FAST: Secure and HighPerformance Format-Preserving Encryption and Tokenization.- Fine-tuning the ISO/IEC Standard LightMAC.- Categorization of Faulty Nonce Misuse Resistant Message Authentication.- Balanced Non-Adjacent Forms.- Efficient Boolean Search over Encrypted Data with Reduced Leakage.- Revisiting Homomorphic Encryption Schemes for Finite Fields.- Transciphering Framework for Approximate Homomorphic Encryption.- Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE.