Rafael Pass
Affiliations: | Cornell University, Ithaca, NY, United States |
Area:
Computer ScienceGoogle:
"Rafael Pass"Parents
Sign in to add mentorSilvio Micali | grad student | 2006 | MIT | |
(A Precise Computational Approach to Knowledge) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Lin H, Pass R, Soni P. (2020) Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles Siam Journal On Computing. 49 |
Halpern JY, Pass R. (2019) A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator Arxiv: Computer Science and Game Theory. 297: 221-232 |
Halpern JY, Pass R. (2017) A Knowledge-Based Analysis of the Blockchain Protocol Electronic Proceedings in Theoretical Computer Science. 251: 324-335 |
Austrin P, Chung K, Mahmoody M, et al. (2017) On the Impossibility of Cryptography with Tamperable Randomness Algorithmica. 79: 1052-1101 |
Chung KM, Pass R, Seth K. (2016) Non-black-box simulation from one-way functions and applications to resettable security Siam Journal On Computing. 45: 415-458 |
Canetti R, Lin H, Pass R. (2016) Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions Siam Journal On Computing. 45: 1793-1834 |
Marcedone A, Pass R, Shelat A. (2016) Bounded KDM security from iO and OWF Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9841: 571-586 |
Chen J, Micali S, Pass R. (2015) Tight Revenue Bounds With Possibilistic Beliefs and Level-k Rationality Econometrica. 83: 1619-1639 |
Lin H, Pass R. (2015) Constant-round nonmalleable commitments from any one-way function Journal of the Acm. 62: 5 |
Halpern JY, Pass R. (2015) Algorithmic rationality: Game theory with costly computation Journal of Economic Theory. 156: 246-268 |