CURRICULUM VITAE Rafail Ostrovsky

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, computer viruses, password security, cryptography. Bellcore, Morristown, New Jersey. (May – July 1992). Consulting: secure protocols, cryptography, computer 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, Amalfi, 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, Amalfi, 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, Amalfi, 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 Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith: In EUROCRYPT 2005: 147-163.

6 [10] Low distortion embeddings for edit distance. Rafail Ostrovsky, Yuval Rabani: In STOC-2005: 218-224.

[11] Suﬃcient Conditions for Collision-Resistant Hashing. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky: In Theory of Cryptography Conference TCC 2005: 445-456.

[12] Round-Optimal Secure Two-Party Computation. Jonathan Katz, Rafail Ostrovsky In CRYPTO 2004: 335-354

[13] Public Key Encryption with Keyword Search. Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano: In EUROCRYPT 2004: 506-522

[14] Eﬃcient Consistency Proofs for Generalized Queries on a Committed Database.

Rafail Ostrovsky, Charles Rackoﬀ, Adam Smith In ICALP 2004 1041-1053

[15] Identity-Based Zero Knowledge. Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin In SCN 2004: 180-192.

[16] Batch Codes and Their Applications Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai In STOC-2004.

[17] Public Key Encryption with Keyword Search Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano. In EUROCRYPT-2004.

[18] Amortizing Randomness in Private Multiparty Computations. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn: SIAM J. Discrete Math. 16(4): 533-544 (2003)

[19] Secure multi-party computation tolerating faulty majority Jonathan Katz, Rafail Ostrovsky, Adam Smith. In EUROCRYPT-2003. 578-595

[20] Dynamic Routing on Networks with Fixed-Sized Buﬀers William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosen In proceedings of 2003 Symposium on Discrete Algorithms (SODA-2003) 771-780

[21] Forward Security in Password-Only Key Exchange Protocols Jonathan Katz, Rafail Ostrovsky and Moti Yung, In Security in Communication Networks 2002 conference (SCN-2002).

7 [22] Universally composable two-party and multi-party secure computation. Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai In The ACM 2002 Symposium on Theory of Computing (STOC-2002) pp. 494-503.

[23] Robust Non-interactive Zero Knowledge. Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, Amit Sahai In CRYPTO 2001: 566-598.

[24] Minimal Complete Primitives for Secure Multi-party Computation. Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky Journal of Cryptology 18(1): 37-61 (2005) Preliminary version in CRYPTO 2001: 80-100

[25] Eﬃcient and Non-interactive Non-malleable Commitment. Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith In EUROCRYPT 2001: 40-59.

[26] Eﬃcient Password-Authenticated Key Exchange Using Human-Memorable Pass- words. Jonathan Katz, Rafail Ostrovsky, Moti Yung In EUROCRYPT 2001: 475-494.

[27] Cryptographic Counters and Applications to Electronic Voting Jonathan Katz, Steven Myers, Rafail Ostrovsky In EUROCRYPT 2001: 78-92.

[28] Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani Math. Oper. Res., to appear. Preliminary version in FOCS 2001: 348-356.

[29] Stability preserving transformations: packet routing networks with edge ca- pacities and speeds. Allan Borodin, Rafail Ostrovsky, Yuval Rabani Journal of Interconnection Networks 5(1): 1-12 (2004) Preliminary version in SODA 2001: 601-610.

[30] One-Way Trapdoor Permutations Are Suﬃcient for Non-trivial Single-Server Private Information Retrieval. Eyal Kushilevitz, Rafail Ostrovsky In EUROCRYPT 2000: 104-121.

[31] Single Database Private Information Retrieval Implies Oblivious Transfer Giovanni Di Crescenzo, Tal Malkin, Rafail Ostrovsky In EUROCRYPT 2000: 122-138.

8 [32] Polynomial Time Approximation Schemes for Geometric k-Clustering. Rafail Ostrovsky, Yuval Rabani Preliminary version in FOCS-2000, Journal version appeared in JACM 49(2): 139-156 (2002).

[33] On Concurrent Zero-Knowledge with Pre-processing Giovanni Di Crescenzo, Rafail Ostrovsky. In CRYPTO-1999: 485-502.

[34] Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems Allan Borodin, Rafail Ostrovsky and Yuval Rabani BOOK CHAPTER: In Discrete and Computational Geometry - The Goodman-Pollack Festschrift. Algorithms and Combinatorics Series 3143, Springer Verlag, Berlin, August 2003, pages 255-276.. Preliminary version in Proceedings of The 31’st ACM Symposium on Theory of Computing (STOC-99)

[35] Secure Computation with Honest-Looking Parties: What if Nobody is Truly Honest? Ran Canetti and Rafail Ostrovsky In Proceedings of The 31’st ACM Symposium on Theory of Computing (STOC-99)

[36] Subquadratic Approximation Algorithms For Clustering Problems in High Di- mensional Spaces Allan Borodin, Rafail Ostrovsky and Yuval Rabani Journal of Machine Learning 56(1-3): 153-167 (2004). Preliminary version in Proceedings of The 31’st ACM Symposium on Theory of Computing (STOC-99)

[37] Eﬃcient Timed-release Public-key Encryption Giovanni Di Crescenzo, Rafail Ostrovsky and S Rajagopalan In Proceedings of (EUROCRYPT-99) Springer Verlag.

[38] Optimal and Eﬃcient Clock Synchronization Under Drifting Clocks Rafail Ostrovsky and Boaz Patt-Shamir In Proceedings of Eeighteenth Annual ACM Symposium on Principles of Distributed Com- puting (PODC-99)

[39] Fast Digital Identity Revocation William Aiello, Sachin Lodha and Rafail Ostrovsky In Proceedings of advances in cryptology, (CRYPTO-98) Springer-Verlag Lecture Notes in Computer Science.

[40] Universal Service-Providers for Database Private Information Retrieval Giovanni De-Crescenzo, Yuval Ishai and Rafail Ostrovsky Journal of Cryptology 14(1): 37-74 (2001). In Proceedings of Seventeenth Annual ACM Symposium on Principles of Distributed Computing (PODC-98)

9 [41] Amortizing Randomness in Private Multiparty Computations Eyal Kushilevitz, Rafail Ostrovsky and Adi Ros´en In Proceedings of Seventeenth Annual ACM Symposium on Principles of Distributed Com- puting (PODC-98)

[42] Non-Interactive and Non-Malleable Commitment Giovanni Di Crescenzo, Yuval Ishai, and Rafail Ostrovsky Appeared in Proceedings of The 30’s ACM Symposium on Theory of Computing (STOC- 98)

[43] Eﬃcient Search for Approximate Nearest Neighbor in High Dimensional Spaces Eyal Kushilevitz, Rafail Ostrovsky and Yuval Rabani Journal version in: SIAM J. Comput. 30(2): 457-474 (2000) Preliminary version in Pro- ceedings of The 30’s ACM Symposium on Theory of Computing (STOC-98)

[44] Adaptive Packet Routing for Bursty Adversarial Traﬃc William Aiello, Eyal Kushilevitz, Rafail Ostrovsky and Adi Ros´en J. Comput. Syst. Sci. 60(3): 482-509 (2000) Preliminary version in Proceedings of The 30’s ACM Symposium on Theory of Computing (STOC-98)

[45] Replication Is Not Needed: Single Database, Computationally-Private Information Retrieval Eyal Kushilevitz and Rafail Ostrovsky In Proceedings of Thirty-eigth Annual IEEE Symposium on the Foundations of Computer Science (FOCS-97)

[46] Micro-Payments via Eﬃcient Coin-Flipping Richard J. Lipton and Rafail Ostrovsky In Proceedings of Second Financial Cryptography Conference, (FINANCIAL CRYPTO- 98) February 1998. Lecture Notes in Computer Science LNCS volume 1465

[47] Randomness vs. Fault-Tolerance Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky and Adi Ros´en In Proceedings of Sixteenth Annual ACM Symposium on Principles of Distributed Com- puting (PODC-97)

[48] Eﬃcient Anonymous Multicast and Reception Shlomi Dolev and Rafail Ostrovsky Journal Version in ACM transaction on Information and System Security vol 3., no. 2, pp. 63-84, 2000. Preliminary version in Proceedings of advances in cryptology, (CRYPTO- 97) Springer-Verlag Lecture Notes in Computer Science.

[49] Security of Blind Digital Signatures Ari Juels, Michael Luby and Rafail Ostrovsky In Proceedings of advances in cryptology, (CRYPTO-97) Springer-Verlag Lecture Notes in Computer Science.

10 [50] Deniable Encryption. Ran Canetti, Cynthia Dwork, Moni Naor and Rafail Ostrovsky In Proceedings of advances in cryptology, (CRYPTO-97) Springer-Verlag Lecture Notes in Computer Science.

[51] Private Information Storage Rafail Ostrovsky and Victor Shoup In Proceedings of The Twenty-Ninth ACM Symposium on Theory of Computing (STOC- 97)

[52] Universal O(congestion+dilation+ log1+² N) Local Control Packet Switching Algorithm Rafail Ostrovsky and Yuval Rabani Preliminary version in Proceedings of The Twenty-Ninth ACM Symposium on Theory of Computing (STOC-97)

[53] The Linear-Array Conjecture in Communication Complexity is False. Eyal Kushilevitz, Nati Linial and Rafail Ostrovsky Combinatorica 19(2): 241-254 (1999) Preliminary version in Proceedings of The Twenty- Eighth ACM Symposium on Theory of Computing (STOC-96)

[54] Characterizing Linear Size Circuits in Terms of Privacy. Eyal Kushilevitz, Rafail Ostrovsky and Adi Ros´en Invited paper to the Journal of Computer and System Sciences special issue for STOC 96. Appeared in Vol 58, December 1998, JCSS 58(1): 129-136 (1999). Preliminary version appeared in the Proceedings of The Twenty-Eighth ACM Symposium on Theory of Computing (STOC-96)

[55] Self-Stabilizing Algorithms for Synchronous Unidirectional Rings. Alain Mayer, Rafail Ostrovsky and Moti Yung In Proceedings of Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA- 96)

[56] Faster Computation On Directed Networks of Automata Rafail Ostrovsky and Daniel Wilkerson In the Proceedings of Fourteenth Annual ACM Symposium on Principles of Distributed Computing (PODC-95) Journal version accepted to Journal of Algorithms, to appear.

[57] LOG-Space Polynomial End-to-End Communication Eyal Kushilevitz, Rafail Ostrovsky and Adi Ros´en Preliminary version appeared in the Proceedings of Twenty-seventh ACM Symposium on Theory of Computing (STOC-95) Journal version in SIAM J. Comput. 27(6): 1531-1549 (1998)

[58] Reducibility and Completeness In Multi-Party Private Computations. Eyal Kushilevitz, Silvio Micali and Rafail Ostrovsky

11 In Proceedings of Thirty-ﬁfth Annual IEEE Symposium on the Foundations of Computer Science (FOCS-94) FULL VERSION (jointly with J. Kilian) accepted to SICOMP, appeared in SIAM J. Comput. 29(4): 1189-1208 (2000).

[59] Memory-Eﬃcient and Self-Stabilizing Network RESET. Baruch Awerbuch and Rafail Ostrovsky In Proceedings of Thirteens Annual ACM Symposium on Principles of Distributed Com- puting (PODC-94)

[60] Simple and Eﬃcient Leader Election In The Full Information Model. Rafail Ostrovsky, Sridhar Rajagopalan and Umesh Vazirani In Proceedings of Twenty-sixth ACM Symposium on Theory of Computing (STOC-94) Montreal, Quebec, Canada, May 23-25, 1994.

[61] Computational Complexity and Knowledge Complexity. Oded Goldreich, Rafail Ostrovsky and Erez Petrank Preliminary version appeared in the Twenty-sixth ACM Symposium on Theory of Com- puting (STOC-94) Full version in SIAM Journal on Computing, 27(4):1116-1141, August 1998.

[62] Matching Nuts and Bolts. Noga Alon, Manuel Blum, Amos Fiat, Sampath K. Kannan, Moni Naor, and Rafail Os- trovsky In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA- 94)

[63] Interactive Hashing Simpliﬁes Zero-Knowledge Protocol Design. Rafail Ostrovsky, Ramarathnam Venkatesan and Moti Yung In Proceedings of (EUROCRYPT-93) Springer Verlag.

[64] The Las-Vegas Processor Identity Problem. Shay Kutten, Rafail Ostrovsky and Boaz Patt-Shamir. In Proceedings of the Second In J. Algorithms 37(2): 468-494 (2000). Preliminary version in Israel Symposium on Theory of Computing and Systems (ISTCS-93)

[65] One-Way Functions are Essential for Non-Trivial Zero-Knowledge. Rafail Ostrovsky and Avi Wigderson In Proceedings of the second Israel Symposium on Theory of Computing and Systems (ISTCS-93) Received Henry H. Taub Prize and $1, 000 Award.

[66] Secure Commitment Against Powerful Adversary: A Security Primitive based on Average Intractability. Rafail Ostrovsky, Ramarathnam Venkatesan and Moti Yung. In Proceedings of 9th Symposium on Theoretical Aspects of Computer Science (STACS- 92) (LNCS 577 Springer Verlag Ed. A. Finkel and M. Jantzen) pp. 439-448

12 [67] Self-Stabilizing Symmetry Breaking in Constant-Space. Alain Mayer, Yoram Ofek, Rafail Ostrovsky, and Moti Yung In SIAM J. Comput. 31(5): 1571-1595 (2002). Preliminary version in Proceedings of 24th annual ACM Symposium on Theory of Computing (STOC-92)

[68] Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equiva- lent. Shaﬁ Goldwasser and Rafail Ostrovsky In Proceedings of Advances in Cryptology, (CRYPTO-92) Springer-Verlag Lecture Notes in Computer Science.

[69] Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions. Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan and Moti Yung. In Proceedings of advances in cryptology, (CRYPTO-92) Springer-Verlag Lecture Notes in Computer Science. Journal version Appeared in J. of Cryptology, 1988.

[70] Software Protection and Simulation on Oblivious RAMs. Rafail Ostrovsky M.I.T. Ph.D. Thesis, 1992. Preliminary version appeared in Proceedings of 22nd annual ACM Symposium on Theory of Computing (STOC-90) pp. 514-523. Journal version appeared in the Journal of the JACM, Vol. 43, No. 3, May 1996, pp.431-473. written jointly with Oded Goldreich.

[71] A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems. Joan Feigenbaum and Rafail Ostrovsky In Proceedings of the ﬁrst international symposium in cryptology in Asia (ASIACRYPT’91) Journal version, entitled “Instance-Hiding Proof Systems” co-authored with Beaver, Feigen- baum and Shoup submitted to J. of Cryptology.

[72] Fair Games Against an All-Powerful Adversary. Rafail Ostrovsky, Ramarathnam Venkatesan and Moti Yung. Extended abstract in the proceedings of Sequences ’91, Positano, Italy. Journal version in AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol 13. (Jin-Yi Cai ed.) 1993

[73] One-way Functions, Hard on Average Problems and Statistical Zero-knowledge Proofs. Rafail Ostrovsky In Proceedings of 6 Annual Structure in Complexity Theory Conference (STRUCTURES- 91) pp. 51-59.

[74] How to Withstand Mobile Virus Attacks. Rafail Ostrovsky and Moti Yung. In Proceedings of 10th annual ACM Symposium on Principles of Distributed Computing (PODC-91)

13 [75] On Necessary Conditions for Secure Distributed Computation. Rafail Ostrovsky and Moti Yung. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 2. 1990.

[76] Perfect Zero-Knowledge in Constant Rounds. Mihir Bellare, Silvio Micali, Rafail Ostrovsky. In Proceedings of 22nd annual ACM Symposium on Theory of Computing (STOC-90)

[77] The (True) Complexity of Statistical Zero Knowledge. Mihir Bellare, Silvio Micali, and Rafail Ostrovsky In Proceedings of 22nd annual ACM Symposium on Theory of Computing (STOC-90)

[78] Minimum Resource Zero-Knowledge Proofs. Joe Kilian, Silvio Micali, Rafail Ostrovsky In Proceedings of 30th annual IEEE Symposium on the Foundations of Computer Science (FOCS-89)

For a more up-to-date list see: http://www.informatik.uni-trier.de/˜ ley/db/indices/a-tree/o/Ostrovsky:Rafail.html