default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th TCC 2019: Nuremberg, Germany
- Dennis Hofheinz, Alon Rosen:
Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II. Lecture Notes in Computer Science 11892, Springer 2019, ISBN 978-3-030-36032-0 - Alessandro Chiesa, Peter Manohar, Nicholas Spooner:
Succinct Arguments in the Quantum Random Oracle Model. 1-29 - Jiayu Zhang:
Delegating Quantum Computation in the Quantum Random Oracle Model. 30-60 - Nina Bindel
, Mike Hamburg, Kathrin Hövelmanns, Andreas Hülsing, Edoardo Persichetti:
Tighter Proofs of CCA Security in the Quantum Random Oracle Model. 61-90 - Shweta Agrawal, Monosij Maitra, Shota Yamada:
Attribute Based Encryption for Deterministic Finite Automata from \mathsfDLIN. 91-117 - Fuyuki Kitagawa, Takahiro Matsuda:
CPA-to-CCA Transformation for KDM Security. 118-148 - Rishab Goyal, Venkata Koppula, Brent Waters:
New Approaches to Traitor Tracing with Embedded Identities. 149-179 - Daniel Jost, Ueli Maurer, Marta Mularczyk:
A Unified and Composable Take on Ratcheting. 180-210 - Gianluca Brian, Antonio Faonio, Daniele Venturi:
Continuously Non-malleable Secret Sharing for General Access Structures. 211-232 - Nils Fleischhacker, Vipul Goyal, Abhishek Jain, Anat Paskin-Cherniavsky, Slava Radune:
Interactive Non-malleable Codes. 233-263 - Pavel Hubácek, Michal Koucký, Karel Král, Veronika Slívová:
Stronger Lower Bounds for Online ORAM. 264-284 - Kai-Min Chung, Luowen Qian:
Adaptively Secure Garbling Schemes for Parallel Computations. 285-310 - Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Statistical Difference Beyond the Polarizing Regime. 311-332 - Hamidreza Amini Khorasgani, Hemanta K. Maji, Tamalika Mukherjee:
Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness. 333-355 - Prabhanjan Ananth, Apoorvaa Deshpande, Yael Tauman Kalai, Anna Lysyanskaya:
Fully Homomorphic NIZK and NIWI Proofs. 356-385 - Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, Damien Vergnaud:
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. 386-406 - Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta:
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles. 407-437 - Craig Gentry, Shai Halevi:
Compressible FHE with Applications to PIR. 438-464 - Elette Boyle, Justin Holmgren, Mor Weiss:
Permuted Puzzles and Cryptographic Hardness. 465-493 - Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner:
Linear-Size Constant-Query IOPs for Delegating Computation. 494-521 - James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, Ron D. Rothblum:
On the (In)security of Kilian-Based SNARGs. 522-551 - Moni Naor, Omer Paneth, Guy N. Rothblum:
Incrementally Verifiable Computation via Incremental PCPs. 552-576
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-07-28 23:26 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
