January 2007 CURRICULUM VITAE Rafail Ostrovsky http://www.cs.ucla.edu/»rafail/ mailing address: Contact information: UCLA Computer Science Department Phone: (310) 206-5283 Box 951596, 3732D Boelter Hall, Cell: (201) 286-0108 Los Angeles, CA, 90095-1596 E-mail: [email protected] Research ² Cryptography and Computer Security; Interests ² Routing and Network Algorithms; ² Clustering, Metric Embeddings, and Search Problems on High-Dimensional Data. Education NSF Mathematical Sciences Postdoctoral Research Fellow Conducted at U.C. Berkeley 1992-95. Ph.D. in Computer Science, Massachusetts Institute of Technology, 1989-92. ² Thesis titled: \Software Protection and Simulation on Oblivious RAMs". Final version appeared in JACM, 1996. Practical applications of thesis work also appear in U.S. Patent No.5,123,045 ² Minor: \Management and Technology", M.I.T. Sloan School of Management. M.S. in Computer Science, Boston University, 1985-87. B.A. Magna Cum Laude in Mathematics, State University of New York at Bu®alo, 1980-84. Department of Mathemat- ics Graduation Honors: With highest distinction. Appointments UCLA Computer Science Department (2003 { present): Full Professor of Computer Science with Tenure. UCLA School of Engineering (2003 { present): Director, Center for Information and Computation Security. See: http://www.cs.ucla.edu/security/ UCLA Department of Mathematics (2006 { present): Full Professor of Mathematics (by courtesy). 1 Appointments Consultant (cont.) (2003 { present): Consulting for Telcordia Technologies, Lucent. Telcordia Technologies (formerly Bellcore: Bell Communications Research) (1999 { 2003): Senior Research Scientist, Mathematics and Cryptogra- phy Research Group, Applied Research. Bellcore (Bell Communications Research) (1995 { 1999): Research Scientist, Mathematics and Cryptography Re- search Group, Applied Research. NSF Mathematical Sciences Postdoctoral Research Fellow, Berkeley. (Fall 1992 { August 1995). Fellowship conducted at the University of California at Berkeley and International Computer Science Institute at Berkeley. IBM T.J. Watson Research Center, Hawthorne, New York. (July { August 1992); (June { September 1991); (July { September 1990). Summer research positions: distributed network algorithms, com- puter viruses, password security, cryptography. Bellcore, Morristown, New Jersey. (May { July 1992). Consulting: secure protocols, cryptography, com- puter security. AT&T Bell Laboratories, Murray Hill, New Jersey. (May { July 1990). Math Research Center. Summer research position: cryptography, distributed and parallel algorithms. Index Technology Corporation, Cambridge, Massachusetts. (1987 { 1989). Full-time Research Engineer, Product Planning, Archi- tecture and Research Group: design and programming of algorithms and applications protocols and algorithms for various software analysis tools. Digital Equipment Corporation, Hudson, Massachusetts. (June { August 1985); (June { August 1986). Summer research intern- ship: design and programming of several graph and pattern-matching algorithms for natural language processing project. Honors and ² Plenary Invited Speaker { Public Key Cryptography international confer- Awards ence, 2007. ² IBM Faculty Award, 2006. ² 2006 and 2005 Xerox Corporate Innovation Faculty Award. ² 2006 Xerox Corporation Distinguished Lecture Series invited speaker. ² 2005 Distinguished Cryptographer of the Year Lecture Series NTT Labs, Kanagawa, Japan. ² OKAWA 2004 Research Award. 2 Honors and ² NSF CyberTrust Research Award. Awards ² SAIC 2002 Publication Prize for Best SAIC-employee Publication in Mathe- (cont.) matics and Computer Science (SAIC is Telcordia Parent company with over 40,000 engineers and scientists). ² SAIC 2001 Publication Prize for Best SAIC-employee Publication in Math- ematics and Computer Science. ² SAIC 1999 Publication Prize for Best SAIC-employee Publication in Infor- mation and Communications Technology. ² Bellcore prize for excellence in research, 1996. ² Henry H. Taub Prize for the paper \One-Way Functions are Essential for Non-Trivial Zero-Knowledge" 1993. ² NSF Mathematical Sciences Postdoctoral Research Fellowship, 1992-1995. ² IBM Graduate Fellowship, 1990-92. Professional ² Chair, IPAM (International Institute of Pure and Applied Mathematics) Activities three month program on Cybersecurity. September - December, 2006 with 100's of participants invited to spend an entire semester in residence at UCLA, funded by NSF. ² Editorial Board member Journal of Cryptology 2006{present. ² Editorial Board member Algorithmica International Journal 2005{present. ² Steering Committee member Conference on Security and Cryptography for Networks 2005{present. ² Editorial and Advisory Board member International Journal of Information and Computer Security. 2004{present. ² Co-chair, Dagshtul Workshop Anonymous Communication and its Applica- tions October 9-14, 2005. ² Co-organizer, IPAM Workshop Multiscale Geometry and Analysis in High Dimensions October 19-23, 2004. ² Co-organizer, DIMACS Workshop Cryptographic Protocols in Complex En- vironments May 15-17, 2002. Program ² ACISP-2007: Australian Conference on Information Security and Privacy Committees July 2-6, 2007, Townsville, Queensland, Australia. ² PKC-2007: International Workshop on Practice and Theory in Public Key Cryptography, April 17-19, China 2007 3 Program ² ICALP-2006: 33rd International Colloquium on Automata, Languages and Committees Programming, July 9-16, 2006, Venice, Italy. (cont.) ² STOC-2006: Annual ACM Symposium on Theory of Computing, May 2006. ² PKC-2006: International Workshop on Practice and Theory in Public Key Cryptography, April 24-26, New York City, USA. ² INDOCRYPT-2005 December 10-12, 2005 Indian Institute of Science Ban- galore, India, 2005. ² Eurocrypt-2005, Aarhus, May 22-26, 2005. ² TCC-2005: Second Theory of Cryptography Conference, Feb 2005. ² SCN-2004: Security in Communication Networks 2004 (SCN'04) September 8-10, Amal¯, Italy. ² PODC-2004: 23rd Annual ACM Symposium on Principles of Distributed Computing, July 2004. ² CRYPTO-2004: 24nd Annual IACR/IEEE Conference on Cryptologic Re- search, ² CRYPTO-2003: 23rd Annual IACR/IEEE Conference on Cryptologic Re- search, ² STOC-2003: Annual ACM Symposium on Theory of Computing May of 2003. ² CRYPTO-2002: 22nd Annual IACR/IEEE Conference on Cryptologic Re- search. ² RANDOM-2002: The 6th International Workshop on Randomization and Approximation Techniques in Computer Science, September 13-15, 2002. ² Co-organizer of DIMACS Workshop on Cryptographic Protocols in Complex Environments, May 15-17, 2002. ² SCN-2002: Third Workshop on Security in Communication Networks, September 2002, Amal¯, Italy ² STOC-2000:Annual ACM Symposium on Theory of Computing, 2000. ² SODA-2000: Eleventh Annual ACM-SIAM Symposium on Discrete Algo- rithms, January 1-9, 2000, San Francisco. ² SCN-99: Second Workshop on Security in Communication Networks, September 1999, Amal¯, Italy ² CRYPTO-98: 18th Annual IACR/IEEE Conference on Cryptologic Re- search 1998. ² ISTCS-97: 5th ISRAEL Symposium on Theory of Computing and Systems, 1997. 4 Patents 1. Oded GOLDREICH and Rafail OSTROVSKY \COMPREHENSIVE SOFTWARE PROTECTION SYSTEM" U.S. Patent No.5,123,045. 2. Rafail OSTROVSKY, Giovanni DI CRESCENZO, And Yuval ISHAI, \METHOD AND SYSTEM FOR NON-MALLEABLE AND NON- INTERACTIVE CRYPTOGRAPHIC COMMITMENT IN A NETWORK" U.S. Patent 6,301,664. 3. William AIELLO, Rafail OSTROVSKY, And Sachin LODHA \A METHOD FOR EFFICIENTLY REVOKING DIGITAL IDENTITIES" U.S. Patent 6,397,329. 4. Rafail OSTROVSKY, Yuval ISHAI, AND Giovanni DI-CRESCENZO, \METHOD AND SYSTEM FOR PRIVATE INFORMATION RE- TRIEVAL USING COMMODITIES" U.S. Patent 6,216,128. 5. Rafail OSTROVSKY and Eyal KUSHILEVITZ, \METHOD AND APPA- RATUS FOR PRIVATE INFORMATION RETRIEVAL FROM A SINGLE ELECTRONIC STORAGE DEVICE" U.S. Patent 6,167,392. 6. Rafail OSTROVSKY And Yuval RABANI, "METHOD AND SYSTEM FOR DETERMINING APPROXIMATE HAMMING DISTANCE AND APPROXIMATE NEAREST NEIGHBORS IN AN ELECTRONIC STOR- AGE DEVICE" U.S. Patent 6,226,640. 7. Rafail OSTROVSKY, Yuval ISHAI, AND Giovanni DI-CRESCENZO, \SYSTEM AND METHOD FOR PRIVATE INFORMATION RE- TRIEVAL USING VERIFIABLE COMMODITIES" U.S. Patent 6,438,554. 5 Rafail Ostrovsky List of Publications [1] Searchable symmetric encryption: improved de¯nitions and e±cient construc- tions. Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail Ostrovsky In CCS-06 Proc. ACM Conference on Computer and Communications Security 2006: 79-88 [2] Non-interactive Zaps and New Techniques for NIZK. Jens Groth, Rafail Ostrovsky, Amit Sahai In CRYPTO-06: 97-111 [3] Perfect Non-interactive Zero Knowledge for NP. Jens Groth, Rafail Ostrovsky, Amit Sahai In EUROCRYPT-06: 339-358. [4] Sequential Aggregate Signatures and Multisignatures Without Random Ora- cles. Steve Lu, Rafail Ostrovsky, Amit Sahai, Hovav Shacham, Brent Waters In EUROCRYPT-06: 465-485 96 [5] The E®ectiveness of Lloyd-Type Methods for the k-Means Problem. Rafail Ostrovsky, Yuval Rabani, Leonard Schulman, Chaitanya Swamy In Proc. 47th FOCS, 2006. [6] Cryptography from Anonymity. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: In Proc. 47th FOCS, 2006. [7] Error-Correcting Codes for Automatic Control Rafail Ostrovsky, Leonard Schulman, Yuval Rabani In Proc. 46th FOCS, 2005. [8] Private Searching on Streaming Data Rafail Ostrovsky, William Skeith. Preliminary version in Proceedings of Advances in Cryptology, CRYPTO-2005 Springer- Verlag/IACR Lecture Notes in Computer Science. [9] Secure Remote Authentication Using Biometric Data. Xavier