default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st TCC 2023: Taipei, Taiwan - Part I
- Guy N. Rothblum
, Hoeteck Wee:
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part I. Lecture Notes in Computer Science 14369, Springer 2023, ISBN 978-3-031-48614-2
Proofs and Outsourcing
- Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs. 3-33 - Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs. 34-64 - Eden Aldema Tshuva, Elette Boyle, Ran Cohen, Tal Moran, Rotem Oshman:
Locally Verifiable Distributed SNARGs. 65-90 - Sourav Das, Rex Fernando, Ilan Komargodski, Elaine Shi, Pratik Soni:
Distributed-Prover Interactive Proofs. 91-120 - Gil Segev, Amit Sharabi, Eylon Yogev:
Rogue-Instance Security for Batch Knowledge Proofs. 121-157 - Amit Agarwal, Navid Alamati, Dakshita Khurana, Srinivasan Raghuraman, Peter Rindal:
On Black-Box Verifiable Outsourcing. 158-187
Theoretical Foundations
- Noam Mazor, Rafael Pass:
Counting Unpredictable Bits: A Simple PRG from One-Way Functions. 191-218 - Yanyi Liu, Rafael Pass:
On One-Way Functions and Sparse Languages. 219-237 - Liqing Yu, Yusai Wu, Yu Yu, Zhenfu Cao, Xiaolei Dong:
Security Proofs for Key-Alternating Ciphers with Non-Independent Round Permutations. 238-267 - Andrej Bogdanov, Pravesh K. Kothari, Alon Rosen:
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. 268-285 - Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan:
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. 286-315
Multi-party Computation I
- Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen:
Randomized Functions with High Round Complexity. 319-348 - Marshall Ball, Alexander Bienstock, Lisa Kohl, Pierre Meyer:
Towards Topology-Hiding Computation from Oblivious Transfer. 349-379 - Johannes Blömer, Jan Bobolz, Henrik Bröcher:
On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC. 380-410 - Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon:
Synchronizable Fair Exchange. 411-440 - Brett Hemenway, Daniel Noble, Rafail Ostrovsky, Matan Shtepel, Jacob Zhang:
DORAM Revisited: Maliciously Secure RAM-MPC with Logarithmic Overhead. 441-470 - Atsunori Ichikawa, Ilan Komargodski, Koki Hamada, Ryo Kikuchi, Dai Ikarashi:
3-Party Secure Computation for RAMs: Optimal and Concretely Efficient. 471-502
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-01-15 23:36 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:
