Skip to content

Theory of Cryptography Conference

TCC

B

CORE rank

CORE rank (raw)

B

Fields of research

Cybersecurity and Privacy · Theory of Computation

Papers indexed

1,061

2004–2025

Papers per year

200492 peak2025

TCC papers

1,061 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2011One-Time Computable Self-erasing Functions.Stefan Dziembowski, Tomasz Kazana, Daniel Wichs
2011Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token.Nico Dttling, Daniel Kraschewski, Jrn Mller-Quade
2011Perfectly Secure Oblivious RAM without Random Oracles.Ivan Damgrd, Sigurd Meldgaard, Jesper Buus Nielsen
2011On the Black-Box Complexity of Optimally-Fair Coin Tossing.Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin
2011Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators.Josh Bronson, Ali Juma, Periklis A. Papakonstantinou
2011Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions.Zvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich
2011Black-Box Circular-Secure Encryption beyond Affine Functions.Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai
2011Functional Encryption: Definitions and Challenges.Dan Boneh, Amit Sahai, Brent Waters
2011Input Locality and Hardness Amplification.Andrej Bogdanov, Alon Rosen
2011Identity-Based Encryption Secure against Selective Opening Attack.Mihir Bellare, Brent Waters, Scott Yilek
2010Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs.Yevgeniy Vahlis
2010Private Coins versus Public Coins in Zero-Knowledge Proof Systems.Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2010Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model.Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam
2010Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge.Rafail Ostrovsky, Omkant Pandey, Ivan Visconti
2010A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch.Ueli M. Maurer, Stefano Tessaro
2010Public-Key Cryptographic Primitives Provably as Secure as Subset Sum.Vadim Lyubashevsky, Adriana Palacio, Gil Segev
2010Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs.Benot Libert, Moti Yung
2010New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts.Allison B. Lewko, Brent Waters
2010Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens.Vladimir Kolesnikov
2010Almost Optimal Bounds for Direct Product Threshold Theorem.Charanjit S. Jutla
2010Secure Computation and Its Diverse Applications.Yuval Ishai
2010An Efficient Parallel Repetition Theorem.Johan Hstad, Rafael Pass, Douglas Wikstrm, Krzysztof Pietrzak
2010Rationality in the Full-Information Model.Ronen Gradwohl
2010Founding Cryptography on Tamper-Proof Hardware Tokens.Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, Akshay Wadia
2010On Complete Primitives for Fairness.S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostrovsky, Amit Sahai
826850 of 1,061← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.