Rafael Pass

Wei-Lung Dustin Tseng

Proceedings of the Advances in Cryptology, 2010

2009

Black-Box Constructions of Two-Party Protocols from One-Way Functions.

[BibT_eX]

[DOI]

Hoeteck Wee

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

An epistemic characterization of zero knowledge.

[BibT_eX]

[DOI]

Vasumathi Raman

Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), 2009

A logical characterization of iterated admissibility.

[BibT_eX]

[DOI]

Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), 2009

A unified framework for concurrent security: universal composability from stand-alone non-malleability.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Non-malleability amplification.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

New and Improved Constructions of Nonmalleable Cryptographic Protocols.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Concurrent Nonmalleable Commitments.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Iterated Regret Minimization: A More Realistic Solution Concept

[BibT_eX]

[DOI]

CoRR, 2008

Game Theory with Costly Computation

[BibT_eX]

[DOI]

CoRR, 2008

On Constant-Round Concurrent Zero-Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Concurrent Non-malleable Commitments from Any One-Way Function.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Adaptive One-Way Functions and Applications.

[BibT_eX]

[DOI]

Omkant Pandey

Vinod Vaikuntanathan

Proceedings of the Advances in Cryptology, 2008

2007

Precise Concurrent Zero Knowledge.

[BibT_eX]

[DOI]

Omkant Pandey

Amit Sahai

Wei-Lung Dustin Tseng

IACR Cryptol. ePrint Arch., 2007

An efficient parallel repetition theorem for Arthur-Merlin games.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Cryptography from Sunspots: How to Use an Imperfect Reference String.

[BibT_eX]

[DOI]

Ran Canetti

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Relations Among Notions of Non-malleability for Encryption.

[BibT_eX]

[DOI]

Vinod Vaikuntanathan

Proceedings of the Advances in Cryptology, 2007

Bounded CCA2-Secure Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

A precise computational approach to knowledge.

[BibT_eX]

[DOI]

PhD thesis, 2006

Universally Composable Security with Global Setup.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

Local zero knowledge.

[BibT_eX]

[DOI]

Silvio Micali

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Input-Indistinguishable Computation.

[BibT_eX]

[DOI]

Silvio Micali

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.

[BibT_eX]

[DOI]

Vinod Vaikuntanathan

Proceedings of the Advances in Cryptology, 2006

Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006

2005

New and improved constructions of non-malleable cryptographic protocols.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Concurrent Non-Malleable Commitments.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Unconditional Characterizations of Non-interactive Zero-Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

On the Possibility of One-Message Weak Zero-Knowledge.

[BibT_eX]

[DOI]

Boaz Barak

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Bounded-concurrent secure multi-party computation with a dishonest majority.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Universally Composable Protocols with Relaxed Set-Up Assumptions.

[BibT_eX]

[DOI]

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

On Deniability in the Common Reference String and Random Oracle Model.

[BibT_eX]

[DOI]