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ț: 703.36 lei
Preț vechi: 879.21 lei
-20%
Puncte Express: 1055
Preț estimativ în valută:
124.34€ • 145.56$ • 108.58£
124.34€ • 145.56$ • 108.58£
Carte tipărită la comandă
Livrare economică 06-20 martie
Specificații
ISBN-13: 9783030842413
ISBN-10: 303084241X
Pagini: 824
Ilustrații: XV, 805 p. 58 illus., 1 illus. in color.
Dimensiuni: 155 x 235 x 44 mm
Greutate: 1.22 kg
Ediția:1st edition 2021
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 303084241X
Pagini: 824
Ilustrații: XV, 805 p. 58 illus., 1 illus. in color.
Dimensiuni: 155 x 235 x 44 mm
Greutate: 1.22 kg
Ediția:1st edition 2021
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Invited Talk.- Which e-voting problems do we need to solve?.- Award Papers.- On the Possibility of Basing Cryptography on EXP6 ≠ BPP.- Linear Cryptanalysis of FF3-1 and FEA.- Efficient Key Recovery for all HFE Signature Variants.- Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits.- Signatures.- Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions.- Two-Round Trip Schnorr Multi-Signatures via Delinearized Witnesses.- MuSig2: Simple Two-Round Schnorr Multi-Signatures.- Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols.- DualRing: Generic Construction of Ring Signatures with Efficient Instantiations.- Compact Ring Signatures from Learning With Errors.- Quantum Cryptography.- A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds.- On the Concurrent Composition of Quantum Zero-Knowledge.- Multi-theorem Designated-Verifier NIZK for QMA.- On the Round Complexity of Secure Quantum Computation.- Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort.- One-Way Functions Imply Secure Computation in a Quantum World.- Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits.- New Approaches for Quantum Copy-Protection.- Hidden Cosets and Applications to Unclonable Cryptography.- On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model.- Quantum Collision Attacks on Reduced SHA-256 and SHA-512.- Succinct Arguments.- Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments.- Proof-Carrying Data without Succinct Arguments.- Subquadratic SNARGs in the Random Oracle Model.- Sumcheck Arguments and their Applications.- An Algebraic Framework for Universal and Updatable SNARKs.