Cantitate/Preț
Produs

Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part II: Lecture Notes in Computer Science, cartea 12551

Editat de Rafael Pass, Krzysztof Pietrzak
en Limba Engleză Paperback – 13 dec 2020
This three-volume set, LNCS 12550, 12551, and 12552, constitutes the refereed proceedings of the 18th International Conference on Theory of Cryptography, TCCC 2020, held in Durham, NC, USA, in November 2020.
The total of 71 full papers presented in this three-volume set was carefully reviewed and selected from 167 submissions. Amongst others they cover the following topics: study of known paradigms, approaches, and techniques, directed towards their better understanding and utilization; discovery of new paradigms, approaches and techniques that overcome limitations of the existing ones, formulation and treatment of new cryptographic problems; study of notions of security and relations among them; modeling and analysis of cryptographic algorithms; and study of the complexity assumptions used in cryptography.
Due to the Corona pandemic this event was held virtually.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (3) 39709 lei  6-8 săpt.
  Springer International Publishing – 15 dec 2020 39709 lei  6-8 săpt.
  Springer International Publishing – 13 dec 2020 39725 lei  6-8 săpt.
  Springer International Publishing – 13 dec 2020 63407 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 39725 lei

Nou

Puncte Express: 596

Preț estimativ în valută:
7031 8245$ 6164£

Carte tipărită la comandă

Livrare economică 26 ianuarie-09 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030643775
ISBN-10: 3030643778
Pagini: 715
Ilustrații: XII, 715 p. 139 illus., 25 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 1 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology

Locul publicării:Cham, Switzerland

Cuprins

Proof-Carrying Data from Accumulation Schemes.- Linear-Time Arguments with Sublinear Verification from Tensor Codes.- Barriers for Succinct Arguments in the Random Oracle Model.- Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction.- Batch Verification and Proofs of Proximity with Polylog Overhead.- Batch Verification for Statistical Zero Knowledge Proofs.- Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads.- On the Price of Concurrency in Group Ratcheting Protocols.- Stronger Security and Constructions of Multi-Designated Verifier Signatures.- Continuous Group Key Agreement with Active Security.- Round Optimal Secure Multiparty Computation from Minimal Assumptions.- Reusable Two-Round MPC from DDH.- Mr NISC: Multiparty Reusable Non-Interactive Secure Computation.- Secure Massively Parallel Computation for Dishonest Majority.- Towards Multiparty Computation Withstanding Coercion of All Parties.- SynchronousConstructive Cryptography.- Topology-Hiding Communication from Minimal Assumptions..- Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More.- On Statistical Security in Two-Party Computation.- The Resiliency of MPC with Low Interaction: The Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures.- On the Power of an Honest Majority in Three-Party Computation Without Broadcast.- A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity.- On the Round Complexity of the Shuffle Model.