Shabsi Walfish, Ph.D. - Publications
Affiliations: | 2008 | Computer Science | New York University, New York, NY, United States |
Area:
Computer ScienceYear | Citation | Score | |||
---|---|---|---|---|---|
2010 | Alwen J, Dodis Y, Naor M, Segev G, Walfish S, Wichs D. Public-key encryption in the bounded-retrieval model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6110: 113-134. DOI: 10.1007/978-3-642-13190-5_6 | 0.458 | |||
2009 | Dodis Y, Katz J, Smith A, Walfish S. Composability and on-line deniability of authentication Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5444: 146-162. DOI: 10.1007/978-3-642-00457-5_10 | 0.607 | |||
2008 | Dodis Y, Shoup V, Walfish S. Efficient constructions of composable commitments and zero-knowledge proofs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5157: 515-535. DOI: 10.1007/978-3-540-85174-5_29 | 0.486 | |||
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.613 | |||
2007 | Cash D, Ding YZ, Dodis Y, Lee W, Lipton R, Walfish S. Intrusion-resilient key exchange in the bounded retrieval model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4392: 479-498. | 0.66 | |||
2006 | Di Crescenzo G, Lipton R, Walfish S. Perfectly secure password protocols in the bounded retrieval model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3876: 225-244. | 0.515 | |||
2004 | Dodis Y, Jarecki S, Freedman MJ, Walfish S. Versatile padding schemes for joint signature and encryption Proceedings of the Acm Conference On Computer and Communications Security. 344-353. | 0.527 | |||
Show low-probability matches. |