☰

Rafael Pass - Publications

Affiliations: 
Cornell University, Ithaca, NY, United States 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

51 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Lin H, Pass R, Soni P. Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles Siam Journal On Computing. 49. DOI: 10.1137/17M1163177  0.324
2019 Halpern JY, Pass R. A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator Arxiv: Computer Science and Game Theory. 297: 221-232. DOI: 10.4204/Eptcs.297.15  0.3
2017 Halpern JY, Pass R. A Knowledge-Based Analysis of the Blockchain Protocol Electronic Proceedings in Theoretical Computer Science. 251: 324-335. DOI: 10.4204/EPTCS.251.22  0.314
2017 Austrin P, Chung K, Mahmoody M, Pass R, Seth K. On the Impossibility of Cryptography with Tamperable Randomness Algorithmica. 79: 1052-1101. DOI: 10.1007/S00453-016-0219-7  0.41
2016 Chung KM, Pass R, Seth K. Non-black-box simulation from one-way functions and applications to resettable security Siam Journal On Computing. 45: 415-458. DOI: 10.1137/130946083  0.463
2016 Canetti R, Lin H, Pass R. Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions Siam Journal On Computing. 45: 1793-1834. DOI: 10.1137/110847196  0.421
2016 Marcedone A, Pass R, Shelat A. 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. DOI: 10.1007/978-3-319-44618-9_30  0.332
2015 Chen J, Micali S, Pass R. Tight Revenue Bounds With Possibilistic Beliefs and Level-k Rationality Econometrica. 83: 1619-1639. DOI: 10.3982/Ecta12563  0.317
2015 Lin H, Pass R. Constant-round nonmalleable commitments from any one-way function Journal of the Acm. 62: 5. DOI: 10.1145/2699446  0.468
2015 Halpern JY, Pass R. Algorithmic rationality: Game theory with costly computation Journal of Economic Theory. 156: 246-268. DOI: 10.1016/J.Jet.2014.04.007  0.314
2015 Chung KM, Lin H, Pass R. Constant-round concurrent zero-knowledge from indistinguishability obfuscation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9215: 287-307. DOI: 10.1007/978-3-662-47989-6_14  0.398
2015 Chung KM, Lui E, Pass R. From weak to Strong Zero-knowledge and applications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9014: 66-92.  0.384
2015 Goyal V, Lin H, Pandey O, Pass R, Sahai A. Round-efficient concurrently composable secure computation via a robust extraction lemma Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9014: 260-289.  0.346
2014 Halpern JY, Pass R, Seeman L. The truth behind the myth of the folk theorem Itcs 2014 - Proceedings of the 2014 Conference On Innovations in Theoretical Computer Science. 543-552. DOI: 10.1016/J.Geb.2019.04.008  0.327
2014 Pass R, Dustin Tseng WL, Venkitasubramaniam M. Concurrent zero knowledge, revisited Journal of Cryptology. 27: 45-66. DOI: 10.1007/S00145-012-9137-2  0.716
2014 Chung KM, Ostrovsky R, Pass R, Venkitasubramaniam M, Visconti I. 4-round resettably-sound zero knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8349: 192-216. DOI: 10.1007/978-3-642-54242-8_9  0.764
2013 Chung KM, Ostrovsky R, Pass R, Visconti I. Simultaneous resettability from one-way functions Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 60-69. DOI: 10.1109/FOCS.2013.15  0.521
2013 Halpern JY, Pass R. Conservative belief and rationality Games and Economic Behavior. 80: 186-192. DOI: 10.1016/J.Geb.2013.03.004  0.304
2013 Pass R, Rosen A, Tseng WLD. Public-coin parallel zero-knowledge for NP Journal of Cryptology. 26: 1-10. DOI: 10.1007/S00145-011-9110-5  0.483
2013 Pass R. Unprovable security of perfect NIZK and non-interactive non-malleable commitments Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7785: 334-354. DOI: 10.1007/S00037-016-0122-2  0.426
2012 Pass R, Venkitasubramaniam M. A parallel repetition theorem for constant-round Arthur-Merlin Proofs Acm Transactions On Computation Theory. 4. DOI: 10.1145/2382559.2382561  0.732
2012 Roeder T, Pass R, Schneider FB. Multi-verifier signatures Journal of Cryptology. 25: 310-348. DOI: 10.1007/S00145-010-9096-4  0.409
2012 Pass R, Lin H, Venkitasubramaniam M. A unified framework for UC from only OT Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7658: 699-717. DOI: 10.1007/978-3-642-34961-4_42  0.728
2012 Chung KM, Pass R, Tseng WLD. The knowledge tightness of parallel zero-knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7194: 512-529. DOI: 10.1007/978-3-642-28914-9_29  0.425
2011 Lin H, Pass R. Constant-round non-malleable commitments from any one-way function Proceedings of the Annual Acm Symposium On Theory of Computing. 705-714. DOI: 10.1145/1993636.1993730  0.391
2011 Pass R. Limits of provable security from standard assumptions Proceedings of the Annual Acm Symposium On Theory of Computing. 109-118. DOI: 10.1145/1993636.1993652  0.332
2011 Barak B, Canetti R, Lindell Y, Pass R, Rabin T. Secure Computation Without Authentication Journal of Cryptology. 24: 720-760. DOI: 10.1007/S00145-010-9075-9  0.411
2011 Pass R, Tseng WLD, Venkitasubramaniam M. Towards non-black-box lower bounds in cryptography Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6597: 579-596. DOI: 10.1007/978-3-642-19571-6_35  0.731
2011 Lin H, Pass R. Concurrent non-malleable zero knowledge with adaptive inputs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6597: 274-292. DOI: 10.1007/978-3-642-19571-6_17  0.389
2011 Pass R. Concurrent security and non-malleability Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6597: 540.  0.316
2010 Lin H, Pass R, Tseng WLD, Venkitasubramaniam M. Concurrent non-malleable zero knowledge proofs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6223: 429-446. DOI: 10.1007/978-3-642-14623-7_23  0.748
2010 Pass R, Wee H. Constant-round non-malleable commitments from sub-exponential one-way functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6110: 638-655. DOI: 10.1007/978-3-642-13190-5_32  0.395
2010 Pass R, Venkitasubramaniam M. Private coins versus public coins in zero-knowledge proof systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5978: 588-605. DOI: 10.1007/978-3-642-11799-2_35  0.706
2010 Pass R, Tseng WLD, Venkitasubramaniam M. Eye for an eye: Efficient concurrent zero-knowledge in the timing model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5978: 518-534. DOI: 10.1007/978-3-642-11799-2_31  0.712
2009 Halpern JY, Pass R, Raman V. An epistemic characterization of zero knowledge Proceedings of the 12th Conference On Theoretical Aspects of Rationality and Knowledge, Tark '09. 156-165. DOI: 10.1145/1562814.1562837  0.333
2009 Lin H, Pass R, Venkitasubramaniam M. A unified framework for concurrent security: Universal composability from stand-alone non-malleability Proceedings of the Annual Acm Symposium On Theory of Computing. 179-188. DOI: 10.1145/1536414.1536441  0.714
2009 Pass R, Tseng WLD, Wikström D. On the composition of public-coin zero-knowledge protocols Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5677: 160-176. DOI: 10.1137/100811465  0.5
2009 Pass R, Wee H. Black-box constructions of two-party protocols from one-way functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5444: 403-418. DOI: 10.1007/978-3-642-00457-5_24  0.438
2008 Pass R, Rosen A. New and improved constructions of nonmalleable cryptographic protocols Siam Journal On Computing. 38: 702-752. DOI: 10.1137/060671553  0.339
2008 Pandey O, Pass R, Sahai A, Tseng WLD, Venkitasubramaniam M. Precise concurrent zero knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4965: 397-414. DOI: 10.1007/978-3-540-78967-3_23  0.748
2008 Lin H, Pass R, Venkitasubramaniam M. Concurrent non-malleable commitments from any one-way function Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4948: 571-588. DOI: 10.1007/978-3-540-78524-8_31  0.738
2008 Pass R, Venkitasubramaniam M. On constant-round concurrent zero-knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4948: 553-570. DOI: 10.1007/978-3-540-78524-8_30  0.728
2007 Pass R, Venkitasubramaniam M. An efficient parallel repetition theorem for Arthur-Merlin games Proceedings of the Annual Acm Symposium On Theory of Computing. 420-429. DOI: 10.1145/1250790.1250853  0.717
2007 Canetti R, Dodis Y, Pass R, Walfish S. Universally composable security with global setup Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4392: 61-85.  0.328
2006 Micali S, Pass R. Local zero knowledge Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 306-315.  0.32
2005 Pass R, Rosen A. New and improved constructions of non-malleable cryptographic protocols Proceedings of the Annual Acm Symposium On Theory of Computing. 533-542. DOI: 10.1137/060671553  0.487
2005 Pass R, Rosen A. Concurrent non-malleable commitments Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2005: 563-572. DOI: 10.1137/060661880  0.428
2004 Barak B, Pass R. On the possibility of one-message weak zero-knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2951: 121-132.  0.356
2004 Pass R. Bounded-concurrent secure multi-party computation with a dishonest majority Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 232-241.  0.362
2003 Pass R, Rosen A. Bounded-concurrent secure two-party computation in a constant number of rounds Annual Symposium On Foundations of Computer Science - Proceedings. 404-413. DOI: 10.1109/SFCS.2003.1238214  0.359
2003 Pass R. Simulation in quasi-polynomial time, and its application to protocol composition Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2656: 160-176.  0.341
Show low-probability matches.