default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th 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 III. Lecture Notes in Computer Science 12552, Springer 2020, ISBN 978-3-030-64380-5 - Christian Badertscher
, Ran Canetti, Julia Hesse, Björn Tackmann, Vassilis Zikas:
Universal Composition with Global Subroutines: Capturing Global Setup Within Plain UC. 1-30 - Victor Shoup:
Security Analysis of itSPAKE2+. 31-60 - Mark Zhandry:
Schrödinger's Pirate: How to Trace a Quantum Decoder. 61-91 - Anne Broadbent, Rabib Islam:
Quantum Encryption with Certified Deletion. 92-122 - Prabhanjan Ananth, Rolando L. La Placa:
Secure Quantum Extraction Protocols. 123-152 - Gorjan Alagic, Andrew M. Childs, Alex B. Grilo, Shih-Han Hung:
Non-interactive Classical Verification of Quantum Computation. 153-180 - Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
Classical Verification of Quantum Computations with Efficient Verifier. 181-206 - David Lanzenberger, Ueli Maurer:
Coupling of Random Systems. 207-240 - Yevgeniy Dodis, Pooya Farshim, Sogol Mazaheri, Stefano Tessaro:
Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity. 241-273 - Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran:
Zero-Communication Reductions. 274-304 - Dror Chawin, Iftach Haitner, Noam Mazor:
Lower Bounds on the Time/Memory Tradeoff of Function Inversion. 305-334 - Wei Dai, Stefano Tessaro, Xihu Zhang:
Super-Linear Time-Memory Trade-Offs for Symmetric Encryption. 335-365 - Lior Rotem, Gil Segev:
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions. 366-389 - Jonathan Katz, Julian Loss, Jiayu Xu:
On the Security of Time-Lock Puzzles and Timed Commitments. 390-413 - Joseph Jaeger, Stefano Tessaro:
Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness. 414-443 - Ronald Cramer, Chaoping Xing, Chen Yuan:
On the Complexity of Arithmetic Secret Sharing. 444-469 - Serge Fehr, Chen Yuan:
Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries. 470-498 - Amos Beimel, Oriol Farràs:
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs. 499-529 - Ofer Grossman, Justin Holmgren, Eylon Yogev:
Transparent Error Correcting in a Computationally Bounded World. 530-549 - Rachit Garg, George Lu, Brent Waters:
New Techniques in Replica Encodings with Client Setup. 550-583 - Eshan Chattopadhyay, Xin Li:
Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering. 584-613 - Pavel Hubácek, Chethan Kamath, Karel Král, Veronika Slívová:
On Average-Case Hardness in TFNP from One-Way Functions. 614-638 - Thomas Agrikola, Geoffroy Couteau, Yuval Ishai, Stanislaw Jarecki, Amit Sahai:
On Pseudorandom Encodings. 639-669
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-09-19 23:52 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
