Overview

The three-volume set LNCS 13042, LNCS 13043 and LNCS 13044 constitutes the refereed proceedings of the 19th International Conference on Theory of Cryptography, TCC 2021, held in Raleigh, NC, USA, in November 2021.  The total of 66 full papers presented in this three-volume set was carefully reviewed and selected from 161 submissions. They cover topics on proof systems, attribute-based and functional encryption, obfuscation, key management and secure communication.

Full Product Details

Author:   Kobbi Nissim ,  Brent Waters
Publisher:   Springer Nature Switzerland AG
Imprint:   Springer Nature Switzerland AG
Edition:   1st ed. 2021
Volume:   13042
Weight:   1.211kg
ISBN:  

9783030904586

ISBN 10:   303090458
Pages:   785
Publication Date:   07 November 2021
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand  
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Secure Quantum Computation with Classical Communication.- Secure Software Leasing from Standard Assumptions.- Post-quantum Resettably-Sound Zero Knowledge.- Secure Software Leasing Without Assumptions.- The Round Complexity of Quantum Zero-Knowledge.- Rate-1 Quantum Fully Homomorphic Encryption.- Unifying Presampling via Concentration Bounds.- Quantum Key-length Extension.- Relationships between quantum IND-CPA notions.- Classical Binding for Quantum Commitments.- Unclonable Encryption, Revisited.- Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs.- Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness.- Tight Security Bounds for Micali's SNARGs.- Acyclicity Programming for Sigma-Protocols.-Statistical ZAPs from Group-Based Assumptions.- Generalized Proofs of Knowledge with Fully Dynamic Setup.- Fully-succinct Publicly Verifiable Delegation from Constant-Size Assumptions.- On expected polynomial runtime in cryptography.-Information-Theoretically Secure MPC against Mixed Dynamic Adversaries.- Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback.- Two-Round Maliciously Secure Computation with Super-Polynomial Simulation.- Adaptive Security of Multi-Party Protocols, Revisited.-On Actively-Secure Elementary MPC Reductions.- Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (Timed) Assumptions.-

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions