Advances in Cryptology - CRYPTO 2021: Lecture Notes in Computer Science
Editat de Tal Malkin, Chris Peikerten Limba Engleză Paperback – 10 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ț: 323.37 lei - 20%
Preț: 461.65 lei - 20%
Preț: 461.32 lei - 20%
Preț: 390.69 lei - 20%
Preț: 527.36 lei - 15%
Preț: 388.50 lei - 20%
Preț: 461.52 lei - 20%
Preț: 390.35 lei - 20%
Preț: 496.64 lei - 20%
Preț: 461.52 lei - 20%
Preț: 389.72 lei - 15%
Preț: 461.85 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 252.15 lei - 20%
Preț: 391.14 lei - 20%
Preț: 532.54 lei - 20%
Preț: 461.83 lei - 20%
Preț: 255.91 lei - 20%
Preț: 498.46 lei - 20%
Preț: 497.55 lei - 20%
Preț: 499.36 lei - 20%
Preț: 390.12 lei - 20%
Preț: 391.20 lei - 20%
Preț: 532.41 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 390.94 lei - 20%
Preț: 391.86 lei - 20%
Preț: 389.85 lei - 20%
Preț: 498.32 lei - 20%
Preț: 462.67 lei - 20%
Preț: 460.98 lei - 20%
Preț: 424.26 lei - 20%
Preț: 639.72 lei - 15%
Preț: 535.92 lei - 20%
Preț: 532.28 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 461.57 lei - 20%
Preț: 498.50 lei - 20%
Preț: 461.83 lei - 20%
Preț: 249.95 lei
Preț: 758.91 lei
Preț vechi: 948.63 lei
-20% Nou
Puncte Express: 1138
Preț estimativ în valută:
134.29€ • 157.47$ • 117.94£
134.29€ • 157.47$ • 117.94£
Carte tipărită la comandă
Livrare economică 12-26 februarie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030842444
ISBN-10: 3030842444
Pagini: 840
Ilustrații: XV, 822 p. 104 illus., 40 illus. in color.
Dimensiuni: 155 x 235 x 45 mm
Greutate: 1.25 kg
Ediția:1st edition 2021
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3030842444
Pagini: 840
Ilustrații: XV, 822 p. 104 illus., 40 illus. in color.
Dimensiuni: 155 x 235 x 45 mm
Greutate: 1.25 kg
Ediția:1st edition 2021
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Multi-Party Computation.- Game-Theoretic Fairness Meets Multi-Party Protocols: The Case of Leader Election.- Computational Hardness of Optimal Fair Computation: Beyond Minicrypt.- You Only Speak Once: Secure MPC with Stateless Ephemeral Roles.- Fluid MPC: Secure Multiparty Computation with Dynamic Participants.- Secure Computation from One-Way Noisy Communication, or: Anti-Correlation via Anti-Concentration.- Broadcast-Optimal Two Round MPC with an Honest Majority.- Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer.- On the Round Complexity of Black-Box Secure MPC.- ATLAS: Efficient and Scalable MPC in the Honest Majority Setting.- Unconditional Communication-Efficient MPC via Hall's Marriage Theorem.- Non-Interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions.- Efficient Information-Theoretic Multi-Party Computation over Non-Commutative Rings.- Pushing the Limits of Valiant'sUniversal Circuits: Simpler, Tighter and More Compact.- Oblivious Key-Value Stores and Amplification for Private Set Intersection.- MHz2k: MPC from HE over ℤ2k with New Packing, Simpler Reshare, and Better ZKP.- Sublinear GMW-Style Compiler for MPC with Preprocessing.- Limits on the Adaptive Security of Yao's Garbling.- Lattice Cryptography.- Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices.- A Compressed Sigma-Protocol Theory for Lattices.- A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs.- SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions.- Deniable Fully Homomorphic Encryption from Learning With Errors.- Lattice Cryptanalysis.- Counterexamples to New Circular Security Assumptions Underlying iO.- How to Meet Ternary LWE Keys.- Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete Performance.- Towards faster polynomial-time lattice reduction.- Lower bounds on lattice sieving and information set decoding.