Steve Lu
E-mail: stevelu8 at gmail dot com
I have graduated in 2009 under the guidance of my fantastic advisor Rafail Ostrovsky.
My Education
2002-2009, UCLA
Ph.D. in Mathematics.
2001-2002, Stanford University
M.S. in Computer Science with a specialization in Artificial Intelligence
1996-2000, California State University Dominguez Hills
B.S. in Mathematics and B.S. in Computer Science, Summa Cum Laude
Research
My research interests include pairing-based and lattice based cryptography (including Fully Homomorphic Encryption), identity-based encryption (and variants, such as attribute-based encryption and functional encryption), zero-knowledge protocols, secure multi-party computation, and digital signatures.
Research-related endeavors:
- Spring 2007 Invited Presentation at Xerox: Visual Cryptography
- Fall 2006 IPAM Fellow: Securing Cyberspace
- Summer 2006 VIGRE Summer Research Internship (*Funded by the NSF VIGRE grant DMS-0502315)
- Spring 2005 Crypto Seminar: I organized an interdisciplinary seminar for Math and CS students interested in cryptography. The topic of this seminar is Identity Based Encryption. More information can be found here.
- Summer 2005 VIGRE Summer Research Internship (*Funded by the NSF VIGRE grant DMS-0502315): Transitive signatures have been introduced by Micali and Rivest as a means for a signer to authenticate a transitive graph without explicitly having to publish each edge. Their paper presents a solution in the case of undirected graphs. Over the summer I have been researching how the case of directed graphs can be achieved.
- Winter 2006 Crypto Seminar: I organized an interdisciplinary seminar for more advanced Math and CS students currently pursuing research in cryptography. The idea of this seminar is to have students present some techniques used in modern cryptography as well as some of their own work.
Publications (DBLP)
- Steve Lu, Rafail Ostrovsky. “How to Garble RAM Programs. To appear in Eurocrypt 2013.
- Steve Lu, Rafail Ostrovsky, Amit Sahai, Hovav Shacham, Brent Waters. “Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles.”
In Journal of Cryptology, Vol. 26(2). April 2013.
- Steve Lu, Rafail Ostrovsky. “Distributed Oblivious RAM for Secure Two-Party Computation.” In Proccedings of TCC 2013.
- Brett Hemenway, Steve Lu, Rafail Ostrovsky. “Correlated Product Security from Any One-Way Function.” In Proceedings of PKC 2012.
- Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky. “On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme.” In Proceedings of SODA 2012.
- Steve Lu, Daniel Manchala, Rafail Ostrovsky. “Visual cryptography on Graphs.” In Journal of Combinatorial Optimization, Vol. 21(1). January 2011.
- Vipul Goyal, Steve Lu, Amit Sahai, Brent Waters. “Black-Box Accountable Authority Identity-Based Encryption. ” In Proceedings of CCS 2008.
- Steve Lu, Daniel Manchala, Rafail Ostrovsky. “Visual Cryptography on Graphs. ” (Best Paper Award) In Proceedings of COCOON 2008.
- Jens Groth, Steve Lu. “A Non-interactive Shuffle with Pairing Based Verifiability.” In Proceedings of ASIACRYPT 2007.
- Jens Groth, Steve Lu. “Verifiable Shuffle of Large Size Ciphertexts.” In Proceedings of PKC 2007.
- Steve Lu, Rafail Ostrovsky, Amit Sahai, Hovav Shacham, Brent Waters. “Sequential Aggregate
Signatures and Multisignatures without Random Oracles.”
In Proceedings of Eurocrypt 2006.
Useful Links