default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th TCC 2021: Raleigh, NC, USA - Part I
- Kobbi Nissim, Brent Waters:
Theory of Cryptography - 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part I. Lecture Notes in Computer Science 13042, Springer 2021, ISBN 978-3-030-90458-6 - James Bartusek
:
Secure Quantum Computation with Classical Communication. 1-30 - Fuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa:
Secure Software Leasing from Standard Assumptions. 31-61 - Nir Bitansky, Michael Kellner, Omri Shmueli:
Post-quantum Resettably-Sound Zero Knowledge. 62-89 - Anne Broadbent, Stacey Jeffery, Sébastien Lord, Supartha Podder, Aarthi Sundaram:
Secure Software Leasing Without Assumptions. 90-120 - Orestis Chardouvelis, Giulio Malavolta:
The Round Complexity of Quantum Zero-Knowledge. 121-148 - Orestis Chardouvelis, Nico Döttling, Giulio Malavolta:
Rate-1 Quantum Fully Homomorphic Encryption. 149-176 - Siyao Guo, Qian Li, Qipeng Liu, Jiapeng Zhang:
Unifying Presampling via Concentration Bounds. 177-208 - Joseph Jaeger, Fang Song, Stefano Tessaro:
Quantum Key-Length Extension. 209-239 - Tore Vincent Carstens, Ehsan Ebrahimi, Gelo Noel Tabia, Dominique Unruh:
Relationships Between Quantum IND-CPA Notions. 240-272 - Nir Bitansky, Zvika Brakerski:
Classical Binding for Quantum Commitments. 273-298 - Prabhanjan Ananth, Fatih Kaleoglu:
Unclonable Encryption, Revisited. 299-329 - Yael Tauman Kalai, Vinod Vaikuntanathan, Rachel Yun Zhang:
Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs. 330-368 - Susumu Kiyoshima:
Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness. 369-400 - Alessandro Chiesa, Eylon Yogev:
Tight Security Bounds for Micali's SNARGs. 401-434 - Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen:
Acyclicity Programming for Sigma-Protocols. 435-465 - Geoffroy Couteau, Shuichi Katsumata, Elahe Sadeghi, Bogdan Ursu:
Statistical ZAPs from Group-Based Assumptions. 466-498 - Christian Badertscher, Daniel Jost, Ueli Maurer:
Generalized Proofs of Knowledge with Fully Dynamic Setup. 499-528 - Alonso González, Alexandros Zacharakis:
Fully-Succinct Publicly Verifiable Delegation from Constant-Size Assumptions. 529-557 - Michael Klooß:
On Expected Polynomial Runtime in Cryptography. 558-590 - Ivan Damgård, Daniel Escudero, Divya Ravi:
Information-Theoretically Secure MPC Against Mixed Dynamic Adversaries. 591-622 - Giovanni Deligios, Martin Hirt, Chen-Da Liu-Zhang:
Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback. 623-653 - Amit Agarwal, James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta:
Two-Round Maliciously Secure Computation with Super-Polynomial Simulation. 654-685 - Martin Hirt, Chen-Da Liu-Zhang, Ueli Maurer:
Adaptive Security of Multi-party Protocols, Revisited. 686-716 - Benny Applebaum, Aarushi Goel:
On Actively-Secure Elementary MPC Reductions. 717-749 - Brandon Broadnax, Jeremias Mechler, Jörn Müller-Quade:
Environmentally Friendly Composable Multi-party Computation in the Plain Model from Standard (Timed) Assumptions. 750-781
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-03-03 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
