Advances in Cryptology - CRYPTO 2021: Lecture Notes in Computer Science, cartea 12827
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.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 760.64 lei
Preț vechi: 950.79 lei
-20%
Puncte Express: 1141
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
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
Colecția Lecture Notes in Computer Science
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
Colecția Lecture Notes in Computer Science
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.