Theory of Cryptography

19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part I

AvKobbi Nissim,Brent Waters

Häftad, Engelska, 2021

Del 13042 i serien Lecture Notes in Computer Science

1 202 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2021-11-07
Mått:155 x 235 x 43 mm
Vikt:1 194 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:785
Förlag:Springer Nature Switzerland AG
ISBN:9783030904586

Utforska kategorier

Referensverk och tvärvetenskap inom Samhälle och politik
Nätverk och kommunikation inom Data och IT
Hårdvara inom Data och IT

Innehållsförteckning

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.-