A Logical Characterization of Iterated
Admissibility. (TARK’09)
J. Halpern and R. Pass.
An Epistemic Characterization of Zero
Knowledge. (TARK’09)
J. Halpern, R. Pass and V. Raman.
Iterated
Regret Minimization: A New Solution Concept. (IJCAI’09)
J. Halpern and R. Pass. pdf
(Also presented at World Congress of Game Theory’08)
Non-malleability Amplification. (STOC’09)
H. Lin and R. Pass.
A Unified Framework for Concurrent
Security: Universal Composability from Stand-alone Non-malleability. (STOC’09)
H. Lin, R. Pass and M. Venkitasubramaniam.
Black-box Constructions of Two-party
Protocols from One-way Functions. (TCC’09)
R. Pass and H. Wee.
2008
Game Theory with Costly Computation.
J. Halpern and R. Pass. pdf
Manuscript.
Adaptive One-way Functions and
Applications. (Crypto’08)
O. Pandey, R. Pass and V. Vaikuntanathan. pdf
Precise Concurrent Zero Knowledge. (EuroCrypt’08)
O. Pandey, R. Pass, A. Sahai, W. Tseng and M. Venkitasubramaniam. pdf
Concurrent Non-malleable Commitments
from One-way Functions. (TCC’08)
H. Lin, R. Pass and M. Venkitasubramaniam. pdf
On Constant-Round Concurrent Zero
Knowledge. (TCC’08)
R. Pass and M. Venkitasubramaniam. pdf
2007
Precise Zero Knowledge. S. Micali and R. Pass. pdf
Manuscript, December 2007.
This version combines results from Local Zero Knowledge and Precise
Cryptography
Precise Cryptography.
S. Micali and R. Pass. pdf
Manuscript, September 2007. See Precise Zero Knowledge.
Relations Among Notions of
Non-malleability for Encryption. (AsiaCrypt’07)
R. Pass, V. Vaikuntanathan and A. Shelat. pdf
Bounded-CCA Secure Encryption. (AsiaCrypt’07) R. Cramer, G. Hanaoka, D. Hofheinz, H. Imai, E. Kiltz, R. Pass,
A. Shelat and V. Vaikuntanathan. pdf
Cryptography from Sunspots: How to Use
an Imperfect Reference String. (FOCS’07) R. Canetti, R. Pass and A. Shelat. pdf
An Efficient Parallel Repetition Theorem
for Arthur-Merlin Games. (STOC’07)
R. Pass and M. Venkitasubramaniam. pdf
Universally Composable Protocols with
Global Set-up. (TCC’07)
R. Canetti, Y. Dodis, R. Pass and S. Walfish. pdf
2006
A Precise Computational Approach to
Knowledge.
R. Pass. pdf Ph.D Thesis. Massachusetts Institute of Technology, July 2006.
Input-Indistinguishable Computation. (FOCS’06)
S. Micali, R. Pass, A. Rosen. pdf
Construction of a
Non-Malleable Encryption Scheme From Any Semantically Secure One. (Crypto’06)
R. Pass, A. Shelat and V. Vaikuntanathan. pdf
On Arthur-Merlin Games and
the Possibility of Basing Cryptography on NP-Hardness. (Complexity'06)
R. Pass.pdf
Invited to Computational Complexity, special issue on Conference of
Computational Complexity 2006.
Local Zero Knowledge. (STOC'06)
S. Micali and R. Pass.
See A Precise Computational
Approach to Knowledge for a longer version.
2005
Concurrent Non-Malleable
Commitments. (FOCS'05, SICOMP’08)
R. Pass and A. Rosen. pdf
SIAM Journal of Computing, special issue for selected papers of FOCS
2005.
Unconditional
Characterizations of Non-Interactive Zero-Knowledge. (CRYPTO'05)
R. Pass and A. Shelat. ps , pdf
Secure Computation Without
Authentication. (CRYPTO'05)
B. Barak, R. Canetti, Y. Lindell, R. Pass and T. Rabin. ps , pdf
New and Improved
Constructions of Non-Malleable Cryptographic Protocols. (STOC'05, SICOMP’08)
R. Pass and A. Rosen. pdf
SIAM Journal of Computing, special issue for selected papers of STOC
2005.
2004
Universally Composable
Protocols with Relaxed Set-up Assumptions.(FOCS'04)
B. Barak, R. Canetti, J. Nielsen and R. Pass. ps
, pdf
Bounded-Concurrent Secure
Multi-Party Computation with a Dishonest Majority. (STOC'04)
R. Pass. ps , pdf
On the Possibility of
One-Message Weak Zero-Knowledge. (TCC'04)
B. Barak and R. Pass. ps , pdf
Alternative Variants of
Zero-Knowledge Proofs.
R. Pass. ps , pdf
Licentiate (Master's) Thesis. ISBN 91-7283-933-3, 2004.
2003
Bounded-Concurrent Secure
Two-Party Computation in a Constant Number of Rounds. (FOCS'03)
R. Pass and A. Rosen. ps , pdf
On Deniabililty in the Common
Reference String and Random Oracle Models. (CRYPTO'03)
R. Pass.
See Part II in Alternative Variants of Zero-Knowledge Proofs for
a longer version.
Simulation in Quasi-Polynomial Time and
Its Application to Protocol Composition. (EUROCRYPT'03)
R. Pass.
See Part I in Alternative Variants of Zero-Knowledge Proofs for a
longer version.
This material is based upon
work supported by the National Science Foundation, AFOSR, U.S.
Department of Homeland Security and BSF.
Any opinions, findings, and
conclusions or recommendations expressed in this publications are those of
the author(s) and do not necessarily reflect the views of the NSF, AFOSR, DHS
or BSF.
