The SCEAS System
| |||||||

## Search the dblp DataBase
Rafael Pass:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Rafael Pass
**Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2006, pp:96-110 [Conf] - Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin
**Secure Computation Without Authentication.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2005, pp:361-377 [Conf] - Rafael Pass
**On Deniability in the Common Reference String and Random Oracle Model.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2003, pp:316-337 [Conf] - Rafael Pass, Abhi Shelat
**Unconditional Characterizations of Non-interactive Zero-Knowledge.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2005, pp:118-134 [Conf] - Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan
**Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2006, pp:271-289 [Conf] - Rafael Pass
**Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2003, pp:160-176 [Conf] - Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass
**Universally Composable Protocols with Relaxed Set-Up Assumptions.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:186-195 [Conf] - Rafael Pass, Alon Rosen
**Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:404-0 [Conf] - Rafael Pass, Alon Rosen
**Concurrent Non-Malleable Commitments.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:563-572 [Conf] - Silvio Micali, Rafael Pass, Alon Rosen
**Input-Indistinguishable Computation.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:367-378 [Conf] - Silvio Micali, Rafael Pass
**Local zero knowledge.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:306-315 [Conf] - Rafael Pass, Alon Rosen
**New and improved constructions of non-malleable cryptographic protocols.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:533-542 [Conf] - Rafael Pass
**Bounded-concurrent secure multi-party computation with a dishonest majority.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:232-241 [Conf] - Boaz Barak, Rafael Pass
**On the Possibility of One-Message Weak Zero-Knowledge.**[Citation Graph (0, 0)][DBLP] TCC, 2004, pp:121-132 [Conf] - Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish
**Universally Composable Security with Global Setup.**[Citation Graph (0, 0)][DBLP] TCC, 2007, pp:61-85 [Conf] - Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan
**Relations Among Notions of Non-malleability for Encryption.**[Citation Graph (0, 0)][DBLP] ASIACRYPT, 2007, pp:519-535 [Conf] - Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan
**Bounded CCA2-Secure Encryption.**[Citation Graph (0, 0)][DBLP] ASIACRYPT, 2007, pp:502-518 [Conf] - Rafael Pass, Muthuramakrishnan Venkitasubramaniam
**An efficient parallel repetition theorem for Arthur-Merlin games.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:420-429 [Conf] **Adaptive One-Way Functions and Applications.**[Citation Graph (, )][DBLP]**On the Composition of Public-Coin Zero-Knowledge Protocols.**[Citation Graph (, )][DBLP]**Concurrent Non-Malleable Zero Knowledge Proofs.**[Citation Graph (, )][DBLP]**Precise Concurrent Zero Knowledge.**[Citation Graph (, )][DBLP]**Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions.**[Citation Graph (, )][DBLP]**Cryptography from Sunspots: How to Use an Imperfect Reference String.**[Citation Graph (, )][DBLP]**Iterated Regret Minimization: A New Solution Concept.**[Citation Graph (, )][DBLP]**A unified framework for concurrent security: universal composability from stand-alone non-malleability.**[Citation Graph (, )][DBLP]**Non-malleability amplification.**[Citation Graph (, )][DBLP]**An epistemic characterization of zero knowledge.**[Citation Graph (, )][DBLP]**A logical characterization of iterated admissibility.**[Citation Graph (, )][DBLP]**Concurrent Non-malleable Commitments from Any One-Way Function.**[Citation Graph (, )][DBLP]**On Constant-Round Concurrent Zero-Knowledge.**[Citation Graph (, )][DBLP]**Black-Box Constructions of Two-Party Protocols from One-Way Functions.**[Citation Graph (, )][DBLP]**Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model.**[Citation Graph (, )][DBLP]**Private Coins versus Public Coins in Zero-Knowledge Proof Systems.**[Citation Graph (, )][DBLP]**An Efficient Parallel Repetition Theorem.**[Citation Graph (, )][DBLP]**Game Theory with Costly Computation: Formulation and Application to Protocol Security.**[Citation Graph (, )][DBLP]**Game Theory with Costly Computation**[Citation Graph (, )][DBLP]**Iterated Regret Minimization: A More Realistic Solution Concept**[Citation Graph (, )][DBLP]**A Logical Characterization of Iterated Admissibility**[Citation Graph (, )][DBLP]
Search in 0.052secs, Finished in 0.054secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |