The Round Complexity of Quantum Zero-Knowledge

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theory of Cryptography Conference (19. : 2021 : Raleigh, NC) Theory of cryptography ; Part 1
1. Verfasser:	Chardouvelis, Orestis (VerfasserIn)
Weitere Verfasser:	Malavolta, Giulio (VerfasserIn)
Pages:	1
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2021
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
The Round Complexity of Quantum Zero-Knowledge	2021	Chardouvelis, Orestis
Rate-1 Quantum Fully Homomorphic Encryption	2021	Chardouvelis, Orestis
Quantum Key-Length Extension	2021	Jaeger, Joseph
Fully-Succinet Publicly Verifiable Delegation from Constant-Size Assumptions	2021	Gonzdález, Alonso
Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback	2021	Deligios, Giovanni
Adaptive Security of Multi-party Protocols, Revisited	2021	Hirt, Martin
Secure Software Leasing Without Assumptions	2021	Broadbent, Anne
Post-quantum Resettably-Sound Zero Knowledge	2021	Bitansky, Nir
Unifying Presampling via Concentration Bounds	2021	Guo, Siyao
Classical Binding for Quantum Commitments	2021	Bitansky, Nir
Relationships Between Quantum IND-CPA Notions	2021	Carstens, Tore Vincent
Unclonable Encryption, Revisited	2021	Ananth, Prabhanjan
Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs	2021	Kalai, Yael Tauman
Tight Security Bounds for Micali’s SNARGs	2021	Chiesa, Alessandro
Generalized Proofs of Knowledge with Fully Dynamic Setup	2021	Badertscher, Christian
On Expected Polynomial Runtime in Cryptography	2021	Klooß, Michael
Secure Software Leasing from Standard Assumptions	2021	Kitagawa, Fuyuki
Acyclicity Programming for Sigma-Protocols	2021	Abe, Masayuki
Statistical ZAPs from Group-Based Assumptions	2021	Couteau, Geoffroy
Information-Theoretically Secure MPC Against Mixed Dynamic Adversaties	2021	Damgárd, Ivan