Theory of Cryptography : 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020 : proceedings. Part II / Rafael Pass, Krzysztof Pietrzak (eds.).Material type: TextSeries: Serienbezeichnung | Lecture notes in computer science ; 12551. | LNCS sublibrary. SL 4, Security and cryptology.Publisher: Cham : Springer, Description: 1 online resource (xii, 715 pages) : illustrations (some color)Content type: text Media type: computer Carrier type: online resourceISBN: 9783030643782; 3030643786Other title: TCC 2020Subject(s): Data encryption (Computer science) -- Congresses | Software engineering | Data structures (Computer science) | Computer networks -- Security measures | Computer security | Computer networks | Computer Security | Computer Communication Networks | Chiffrement (Informatique) -- Congrès | Génie logiciel | Structures de données (Informatique) | Réseaux d'ordinateurs -- Sécurité -- Mesures | Sécurité informatique | Réseaux d'ordinateurs | Computer networks | Computer networks -- Security measures | Computer security | Data encryption (Computer science) | Data structures (Computer science) | Software engineeringGenre/Form: Congress | Electronic books. | Conference papers and proceedings. | Conference papers and proceedings. | Actes de congrès. Additional physical formats: Print version:: No titleDDC classification: 005.8/24 LOC classification: QA76.9.A25Online resources: Click here to access online
|Item type||Current library||Collection||Call number||Status||Date due||Barcode||Item holds|
International conference proceedings.
"The 18th Theory of Cryptography Conference (TCC 2020) was held virtually during November 16-19, 2020"--Preface
Includes author index.
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.
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 -- Synchronous Constructive 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.
Online resource; title from PDF title page (SpringerLink, viewed February 12, 2021).