default search action
18th TCC 2020: Durham, NC, USA
- Rafael Pass, Krzysztof Pietrzak:
Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part I. Lecture Notes in Computer Science 12550, Springer 2020, ISBN 978-3-030-64374-4 - Zvika Brakerski, Nico Döttling:
Lossiness and Entropic Hardness for Ring-LWE. 1-27 - Prabhanjan Ananth, Abhishek Jain, Zhengzhong Jin, Giulio Malavolta
:
Multi-key Fully-Homomorphic Encryption in the Plain Model. 28-57 - Zvika Brakerski, Pedro Branco, Nico Döttling, Sanjam Garg, Giulio Malavolta
Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions. 58-87 - Sanjam Garg, Mohammad Hajiabadi, Rafail Ostrovsky:
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More. 88-116 - Shweta Agrawal, Shota Yamada:
CP-ABE for Circuits (and More) in the Symmetric Key Setting. 117-148 - Shweta Agrawal, Daniel Wichs, Shota Yamada:
Optimal Broadcast Encryption from LWE and Pairings in the Standard Model. 149-178 - Ryo Nishimaki:
Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark). 179-209 - Hoeteck Wee:
Functional Encryption for Quadratic Functions from k-Lin, Revisited. 210-228 - Rishab Goyal, Venkata Koppula, Satyanarayana Vusirikala, Brent Waters:
On Perfect Correctness in (Lockable) Obfuscation. 229-259 - Fabrice Benhamouda, Craig Gentry, Sergey Gorbunov, Shai Halevi, Hugo Krawczyk, Chengyu Lin
Can a Public Blockchain Keep a Secret? 260-290 - Juan A. Garay, Aggelos Kiayias, Giorgos Panagiotakos:
Blockchains from Non-idealized Hash Functions. 291-321 - Matthias Fitzi, Peter Gazi, Aggelos Kiayias, Alexander Russell
Ledger Combiners for Fast Settlement. 322-352 - Erica Blum
Asynchronous Byzantine Agreement with Subquadratic Communication. 353-380 - Jun Wan, Hanshen Xiao, Elaine Shi, Srinivas Devadas:
Expected Constant Round Byzantine Broadcast Under Dishonest Majority. 381-411 - Jun Wan, Hanshen Xiao, Srinivas Devadas, Elaine Shi:
Round-Efficient Byzantine Broadcast Under Strongly Adaptive and Majority Corruptions. 412-456 - David Cash, Andrew Drucker, Alexander Hoover:
A Lower Bound for One-Round Oblivious RAM. 457-485 - Kasper Green Larsen, Mark Simkin, Kevin Yeo:
Lower Bounds for Multi-server Oblivious RAMs. 486-503 - Matthew M. Hong
On Computational Shortcuts for Information-Theoretic PIR. 504-534 - Nir Bitansky
Characterizing Deterministic-Prover Zero Knowledge. 535-566 - Fuyuki Kitagawa, Takahiro Matsuda, Takashi Yamakawa:
NIZK from SNARG. 567-595 - Nir Bitansky, Noa Eizenstadt, Omer Paneth:
Weakly Extractable One-Way Functions. 596-626 - Benjamin Kuykendall, Mark Zhandry:
Towards Non-interactive Witness Hiding. 627-656 - Zvika Brakerski, Sanjam Garg, Rotem Tsabary:
FHE-Based Bootstrapping of Designated-Prover NIZK. 657-683 - Peter Dixon, Sutanu Gayen, Aduri Pavan
Perfect Zero Knowledge: New Upperbounds and Relativized Separations. 684-704
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 2024-11-22 19:31 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: