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
2009Black-Box Constructions of Two-Party Protocols from One-Way Functions.Rafael Pass, Hoeteck Wee
2009Simulation-Based Concurrent Non-malleable Commitments and Decommitments.Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
2009Fairness with an Honest Minority and a Rational Majority.Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan
2009LEGO for Two-Party Secure Computation.Jesper Buus Nielsen, Claudio Orlandi
2009An Optimally Fair Coin Toss.Tal Moran, Moni Naor, Gil Segev
2009Purely Rational Secret Sharing (Extended Abstract).Silvio Micali, Abhi Shelat
2009Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation.Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek
2009Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer.Yehuda Lindell, Hila Zarosim
2009Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security.Robin Knzler, Jrn Mller-Quade, Dominik Raub
2009Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection.Stanislaw Jarecki, Xiaomin Liu
2009Secure Arithmetic Computation with No Honest Majority.Yuval Ishai, Manoj Prabhakaran, Amit Sahai
2009On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.Iftach Haitner, Alon Rosen, Ronen Shaltiel
2009On the (Im)Possibility of Key Dependent Encryption.Iftach Haitner, Thomas Holenstein
2009Complete Fairness in Multi-party Computation without an Honest Majority.S. Dov Gordon, Jonathan Katz
2009Hierarchical Identity Based Encryption with Polynomially Many Levels.Craig Gentry, Shai Halevi
2009Composing Quantum Protocols in a Classical Environment.Serge Fehr, Christian Schaffner
2009How Efficient Can Memory Checking Be?.Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan
2009The Differential Privacy Frontier (Extended Abstract).Cynthia Dwork
2009Proofs of Retrievability via Hardness Amplification.Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
2009Composability and On-Line Deniability of Authentication.Yevgeniy Dodis, Jonathan Katz, Adam D. Smith, Shabsi Walfish
2009Security Amplification for InteractiveCryptographic Primitives.Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets
2009Universally Composable Multiparty Computation with Partially Isolated Parties.Ivan Damgrd, Jesper Buus Nielsen, Daniel Wichs
2009Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms.James Cook, Omid Etesami, Rachel Miller, Luca Trevisan
2009Simple, Black-Box Constructions of Adaptively Secure Protocols.Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee
2009Non-malleable Obfuscation.Ran Canetti, Mayank Varia
876900 of 1,061← PreviousNext →

Comparable venues

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