Dov Gordon
E-Mail: last name
at cs.umd.edu Address:
About Me
I am a PhD student studying cryptography with Jonathan Katz in the computer science department at the University of Maryland.I intend to graduate at the end of the current academic year (in 2010).
Please browse my CV.
Research Interests
My thesis will be on the subject of fairness in secure computation. I am also interested in practical applications of secure computation, and I have begun researching its potential uses in secure online social networks, as well as in other domains. I have recently done research in various other topics, including zero knowledge, byzantine agreement and (lattice-based) signature schemes.Publications
- "Complete Fairness in Secure Two-Party Computation," with Carmit Hazay, Jonathan Katz and Yehuda Lindell
ACM Symposium on Theory of Computing (STOC) 2008. An extended preliminary full version is available as well. - "Rational Secret Sharing, Revisited," with Jonathan Katz
Security and Cryptography for Networks 2006
(An extended abstract of this work was also accepted for presentation at NetEcon 2006) - "Complete Fairness in Multi-Party Computation without an Honest Majority," with Jonathan Katz
Theory of Cryptography Conference, 2009. - "Partial Fairness in Secure Two-Party Computation," with Jonathan Katz
In submission. - "Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure," with Jonathan Katz, Ranjit Kumaresan and Arkady Yerukhimovich
In submission. - "On Complete Primitives for Fairness," with Yuval Ishai, Tal Moran, Rafail Ostrovsky and Amit Sahai
To appear, TCC 2010. - "On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations" with Hoeteck Wee, David Xiao and Arkady Yerukhimovich
In submission.
Teaching
- MATH 199 Math, Game Theory and the Theory of Games