Advances in Cryptology - CRYPTO 2021: Lecture Notes in Computer Science
Editat de Tal Malkin, Chris Peikerten Limba Engleză Paperback – 8 aug 2021
Part I: Award Papers; Signatures; Quantum Cryptography; Succinct Arguments.
Part II: Multi-Party Computation; Lattice Cryptography; and Lattice Cryptanalysis.
Part III: Models; Applied Cryptography and Side Channels; Cryptanalysis; Codes and Extractors; Secret Sharing.
Part IV: Zero Knowledge; Encryption++; Foundations; Low-Complexity Cryptography; Protocols.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (4) | 699.50 lei 6-8 săpt. | |
| Springer – 8 aug 2021 | 699.50 lei 6-8 săpt. | |
| Springer – 8 aug 2021 | 703.36 lei 6-8 săpt. | |
| Springer – 8 aug 2021 | 758.27 lei 6-8 săpt. | |
| Springer – 10 aug 2021 | 758.91 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 400.77 lei - 20%
Preț: 754.11 lei - 20%
Preț: 324.19 lei - 20%
Preț: 373.80 lei - 20%
Preț: 342.61 lei - 20%
Preț: 403.00 lei - 20%
Preț: 573.45 lei -
Preț: 395.25 lei - 20%
Preț: 487.46 lei - 20%
Preț: 355.27 lei - 20%
Preț: 731.97 lei - 20%
Preț: 293.24 lei - 20%
Preț: 669.21 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 336.86 lei - 20%
Preț: 330.54 lei - 20%
Preț: 313.87 lei - 20%
Preț: 679.09 lei - 20%
Preț: 373.16 lei - 20%
Preț: 782.57 lei - 20%
Preț: 434.17 lei - 20%
Preț: 489.11 lei - 20%
Preț: 904.16 lei - 20%
Preț: 375.72 lei - 20%
Preț: 400.17 lei - 20%
Preț: 432.78 lei - 20%
Preț: 631.96 lei - 20%
Preț: 432.11 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 556.96 lei - 20%
Preț: 488.90 lei - 20%
Preț: 560.93 lei - 20%
Preț: 327.36 lei - 20%
Preț: 340.04 lei - 20%
Preț: 327.36 lei - 20%
Preț: 328.94 lei - 20%
Preț: 629.71 lei - 20%
Preț: 568.70 lei - 20%
Preț: 447.31 lei - 20%
Preț: 733.68 lei - 20%
Preț: 315.26 lei - 20%
Preț: 315.62 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 850.42 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 519.32 lei
Preț: 758.27 lei
Preț vechi: 947.84 lei
-20%
Puncte Express: 1137
Preț estimativ în valută:
134.05€ • 156.93$ • 117.06£
134.05€ • 156.93$ • 117.06£
Carte tipărită la comandă
Livrare economică 06-20 martie
Specificații
ISBN-13: 9783030842512
ISBN-10: 3030842517
Pagini: 828
Ilustrații: XV, 810 p. 133 illus., 68 illus. in color.
Dimensiuni: 155 x 235 x 45 mm
Greutate: 1.23 kg
Ediția:1st edition 2021
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3030842517
Pagini: 828
Ilustrații: XV, 810 p. 133 illus., 68 illus. in color.
Dimensiuni: 155 x 235 x 45 mm
Greutate: 1.23 kg
Ediția:1st edition 2021
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Models.- A Rational Protocol Treatment of 51% Attacks.- MoSS: Modular Security Specifications Framework.- Tight State-Restoration Soundness in the Algebraic Group Model.- Separating Adaptive Streaming from Oblivious Streaming using the Bounded Storage Model.- Applied Cryptography and Side Channels.- Provable Security Analysis of FIDO2-. SSE and SSD: Page-Efficient Searchable Symmetric Encryption.- Towards Tight Random Probing Security.- Secure Wire Shuffling in the Probing Model.- Cryptanalysis.- Differential-Linear Cryptanalysis from an Algebraic Perspective.- Meet-in-the-Middle Attacks Revisited: Key-recovery, Collision, and Preimage Attacks.- Revisiting the Security of DbHtS MACs: Beyond-Birthday-Bound in the Multi-User Setting.- Thinking Outside the Superbox.- Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques.- The Cost to Break SIKE: A Comparative Hardware-Based Analysis with AES and SHA-3.- Improved torsion-point attacks on SIDH variants.- Codes and Extractors.- Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness for LPN.- Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes.- Non-Malleable Codes for Bounded Parallel-Time Tampering.- Improved Computational Extractors and their Applications.- Adaptive Extractors and their Application to Leakage Resilient Secret Sharing.- Secret Sharing.- Upslices, Downslices, and Secret-Sharing with Complexity of 1.5n.- Asymptotically-Good Arithmetic Secret Sharing over ℤ/pℓℤ with Strong Multiplication and Its Applications to Efficient MPC.- Large Message Homomorphic Secret Sharing from DCR and Applications.- Traceable Secret Sharing and Applications.- Quadratic Secret Sharing and Conditional Disclosure of Secrets.- Constructing Locally Leakage-resilient Linear Secret-sharing Schemes.