Cantitate/Preț
Produs
Total produse
Vezi coșul
Advances in Cryptology - CRYPTO 2021 de Tal Malkin

Advances in Cryptology - CRYPTO 2021: Lecture Notes in Computer Science

Editat de Tal Malkin, Chris Peikert
en Limba Engleză Paperback – 10 aug 2021
The four-volume set, LNCS 12825, LNCS 12826, LNCS 12827, and LNCS 12828, constitutes the refereed proceedings of the 41st Annual International Cryptology Conference, CRYPTO 2021. Crypto has traditionally been held at UCSB every year, but due to the COVID-19 pandemic it was an online event in 2021. The 103 full papers presented in the proceedings were carefully reviewed and selected from a total of 426 submissions. The papers are organized in the following topical sections:
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (4) 69950 lei  6-8 săpt.
  Springer – 8 aug 2021 69950 lei  6-8 săpt.
  Springer – 8 aug 2021 70336 lei  6-8 săpt.
  Springer – 8 aug 2021 75827 lei  6-8 săpt.
  Springer – 10 aug 2021 75891 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 75891 lei

Preț vechi: 94863 lei
-20%

Puncte Express: 1138
Preț estimativ în valută:
13416€ • 15706$ • 11716£

Carte tipărită la comandă

Livrare economică 06-20 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

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

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.