Rafail Ostrovsky - Publications

Affiliations: 
Computer Science University of California, Los Angeles, Los Angeles, CA 
Area:
theory of computation; cryptography and security; distributed algorithms; high-dimensional search; routing and flow control in communication networks

104 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2016 Khamsemanan N, Ostrovsky R, Skeith WE. On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols Siam Journal On Discrete Mathematics. 30: 266-295. DOI: 10.1137/110858835  1
2016 Hemenway B, Jafargholi Z, Ostrovsky R, Scafuro A, Wichs D. Adaptively secure garbled circuits from one-way functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9816: 149-178. DOI: 10.1007/978-3-662-53015-3_6  1
2016 Damgård I, Nielsen JB, Ostrovsky R, Rosén A. Unconditionally secure computation with reduced interaction Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9666: 420-447. DOI: 10.1007/978-3-662-49896-5_15  1
2016 Hemenway B, Ostrovsky R, Richelson S, Rosen A. Adaptive security with quasi-optimal rate Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9562: 525-541. DOI: 10.1007/978-3-662-49096-9_22  1
2016 Ishai Y, Kushilevitz E, Lu S, Ostrovsky R. Private large-scale databases with distributed Searchable symmetric encryption Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9610: 90-107. DOI: 10.1007/978-3-319-29485-8_6  1
2015 Felber D, Ostrovsky R. A randomized online quantile summary in O(1/∈ log 1/∈) words Leibniz International Proceedings in Informatics, Lipics. 40: 775-785. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2015.775  1
2015 Braverman V, Ostrovsky R, Roytman A. Zero-one laws for sliding windows and universal sketches Leibniz International Proceedings in Informatics, Lipics. 40: 573-590. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2015.573  1
2015 Ostrovsky R, Rosenbaum W. Fast distributed almost stable matchings Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 2015: 101-108. DOI: 10.1145/2767386.2767424  1
2015 Garg S, Lu S, Ostrovsky R, Scafuro A. Garbled RAM from one-way functions Proceedings of the Annual Acm Symposium On Theory of Computing. 14: 449-458. DOI: 10.1145/2746539.2746593  1
2015 Franklin M, Gelles R, Ostrovsky R, Schulman LJ. Optimal coding for streaming authentication and interactive communication Ieee Transactions On Information Theory. 61: 133-145. DOI: 10.1109/TIT.2014.2367094  1
2015 Garg S, Lu S, Ostrovsky R. Black-Box Garbled RAM Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 210-229. DOI: 10.1109/FOCS.2015.22  1
2015 Braverman V, Ostrovsky R, Vorsanger G. Weighted sampling without replacement from data streams Information Processing Letters. 115: 923-926. DOI: 10.1016/j.ipl.2015.07.007  1
2015 Hemenway B, Ostrovsky R, Wootters M. Local correctability of expander codes Information and Computation. 243: 178-190. DOI: 10.1016/j.ic.2014.12.013  1
2015 Chandran N, Garay JA, Ostrovsky R. Almost-Everywhere Secure Computation with Edge Corruptions Journal of Cryptology. 28: 745-768. DOI: 10.1007/s00145-013-9176-3  1
2015 Ostrovsky R, Persiano G, Visconti I. Impossibility of black-box simulation against leakage attacks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9216: 130-149. DOI: 10.1007/978-3-662-48000-7_7  1
2015 Alwen J, Ostrovsky R, Zhou HS, Zikas V. Incoercible multi-party computation and universally composable receipt-free voting Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9216: 763-780. DOI: 10.1007/978-3-662-48000-7_37  1
2015 Ostrovsky R, Richelson S, Scafuro A. Round-optimal black-box two-party computation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9216: 339-358. DOI: 10.1007/978-3-662-48000-7_17  1
2015 Garg S, Ishai Y, Kushilevit E, Ostrovsky R, Sahai A. Cryptography with one-way communication Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9216: 191-208. DOI: 10.1007/978-3-662-48000-7_10  1
2015 Chase M, Ostrovsky R, Visconti I. Executable proofs, input-size hiding secure computation and a new ideal world Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9057: 532-560. DOI: 10.1007/978-3-662-46803-6_18  1
2015 Baron J, Defrawy KE, Lampkins J, Ostrovsky R. Communication-optimal proactive secret sharing for dynamic groups Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9092: 23-41. DOI: 10.1007/978-3-319-28166-7_2  1
2015 Ostrovsky R, Paskin-Cherniavsky A. Locally decodable codes for edit distance Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9063: 236-249. DOI: 10.1007/978-3-319-17470-9_14  1
2015 Hemenway B, Ostrovsky R, Rosen A. Non-committing encryption from Φ-hiding Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9014: 591-608.  1
2015 Ostrovsky R, Scafuro A, Venkitasubramanian M. Resettably sound Zero-Knowledge arguments from OWFs - The (semi) black-box way Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9014: 345-374.  1
2014 He D, Furlotte NA, Hormozdiari F, Joo JW, Wadia A, Ostrovsky R, Sahai A, Eskin E. Identifying genetic relatives without compromising privacy. Genome Research. 24: 664-72. PMID 24614977 DOI: 10.1101/gr.153346.112  1
2014 Chandran N, Kanukurthi B, Ostrovsky R, Reyzin L. Privacy amplification with asymptotically optimal entropy loss Journal of the Acm. 61. DOI: 10.1145/2630064  1
2014 Barenboim L, Dolev S, Ostrovsky R. Deterministic and energy-optimal wireless synchronization Acm Transactions On Sensor Networks. 11. DOI: 10.1145/2629493  1
2014 Garay J, Givens C, Ostrovsky R, Raykov P. Fast and unconditionally secure anonymous channel Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 313-321. DOI: 10.1145/2611462.2611494  1
2014 Baron J, Defrawy KE, Lampkins J, Ostrovsky R. How to withstand mobile virus attacks, revisited Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 293-302. DOI: 10.1145/2611462.2611474  1
2014 Vipul G, Ostrovsky R, Scafuro A, Visconti I. Black-box non-black-box zero knowledge Proceedings of the Annual Acm Symposium On Theory of Computing. 515-524. DOI: 10.1145/2591796.2591879  1
2014 Ben-Sasson E, Ostrovsky R. Special section on the fifty-second annual symposium on foundations of computer science (FOCS 2011) Siam Journal On Computing. 43: 654. DOI: 10.1137/14097361X  1
2014 Buhrma H, Chandran N, Fehr S, Gelles R, Goyal V, Ostrovsky R, Schaffner C. Position-based quantum cryptography:Impossibility and constructions Siam Journal On Computing. 43: 150-178. DOI: 10.1137/130913687  1
2014 Chandran N, Goyal V, Moriarty R, Ostrovsky R. Position-based cryptography Siam Journal On Computing. 43: 1291-1341. DOI: 10.1137/100805005  1
2014 Garay J, Givens C, Ostrovsky R. Secure message transmission with small public discussion Ieee Transactions On Information Theory. 60: 2373-2390. DOI: 10.1109/TIT.2014.2307309  1
2014 Baron J, Ishai Y, Ostrovsky R. On linear-size pseudorandom generators and hardcore functions Theoretical Computer Science. 554: 50-63. DOI: 10.1016/j.tcs.2014.06.013  1
2014 Braverman V, Gelles R, Ostrovsky R. How to catch L2-heavy-hitters on sliding windows Theoretical Computer Science. 554: 82-94. DOI: 10.1016/j.tcs.2014.06.008  1
2014 Amir Y, Bunn P, Ostrovsky R. Authenticated adversarial routing Journal of Cryptology. 27: 636-771. DOI: 10.1007/s00145-013-9157-6  1
2014 Groth J, Ostrovsky R. Cryptography in the multi-string model Journal of Cryptology. 27: 506-543. DOI: 10.1007/s00145-013-9152-y  1
2014 Ishai Y, Ostrovsky R, Zikas V. Secure multi-party computation with identifiable abort Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8617: 369-386. DOI: 10.1007/978-3-662-44381-1_21  1
2014 Ostrovsky R, Paskin-Cherniavsky A, Paskin-Cherniavsky B. Maliciously circuit-private FHE Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8616: 536-553. DOI: 10.1007/978-3-662-44371-2_30  1
2014 Ostrovsky R, Persiano G, Visconti I. On input indistinguishable proof systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8572: 895-906. DOI: 10.1007/978-3-662-43948-7_74  1
2014 Gentry C, Halevi S, Lu S, Ostrovsky R, Raykova M, Wichs D. Garbled RAM revisited Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8441: 405-422. DOI: 10.1007/978-3-642-55220-5_23  1
2014 Ananth P, Chandran N, Goyal V, Kanukurthi B, Ostrovsky R. Achieving privacy in verifiable computation with multiple servers - Without FHE and without pre-processing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8383: 149-166. DOI: 10.1007/978-3-642-54631-0_9  1
2014 Cho C, Garg S, Ostrovsky R. Cross-domain secure computation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8383: 650-668. DOI: 10.1007/978-3-642-54631-0_37  1
2014 Chung KM, Ostrovsky R, Pass R, Venkitasubramaniam M, Visconti I. 4-round resettably-sound zero knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8349: 192-216. DOI: 10.1007/978-3-642-54242-8_9  1
2014 Orlandi C, Ostrovsky R, Rao V, Sahai A, Visconti I. Statistical concurrent non-malleable zero knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8349: 167-191. DOI: 10.1007/978-3-642-54242-8_8  1
2014 Chandran N, Kanukurthi B, Ostrovsky R. Locally updatable and locally decodable codes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8349: 489-514. DOI: 10.1007/978-3-642-54242-8_21  1
2014 Gelles R, Ostrovsky R, Roytman A. Efficient error-correcting codes for sliding windows Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8327: 258-268. DOI: 10.1007/978-3-319-04298-5_23  1
2014 Garay J, Givens C, Ostrovsky R, Raykov P. Broadcast (and round) efficient verifiable secret sharing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8317: 200-219. DOI: 10.1007/978-3-319-04268-8_12  1
2014 Ostrovsky R, Rao V, Visconti I. On selective-opening attacks against encryption schemes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8642: 578-597.  1
2014 Lampkins J, Ostrovsky R. Communication-efficient MPC for general adversary structures Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8642: 155-174.  1
2013 Baron J, El Defrawy K, Minkovich K, Ostrovsky R, Tressler E. 5PM: Secure pattern matching Journal of Computer Security. 21: 601-625. DOI: 10.3233/JCS-130481  1
2013 Baron J, Defrawy KE, Nogin A, Ostrovsky R. An architecture for a resilient cloud computing infrastructure 2013 Ieee International Conference On Technologies For Homeland Security, Hst 2013. 390-395. DOI: 10.1109/THS.2013.6699036  1
2013 Chung KM, Ostrovsky R, Pass R, Visconti I. Simultaneous resettability from one-way functions Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 60-69. DOI: 10.1109/FOCS.2013.15  1
2013 Lu S, Ostrovsky R, Sahai A, Shacham H, Waters B. Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles Journal of Cryptology. 26: 340-373. DOI: 10.1007/s00145-012-9126-5  1
2013 Hemenway B, Ostrovsky R. Building lossy trapdoor functions from lossy encryption Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8270: 241-260. DOI: 10.1007/978-3-642-42045-0_13  1
2013 Goyal V, Jain A, Ostrovsky R, Richelson S, Visconti I. Constant-round concurrent zero knowledge in the bounded player model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8269: 21-40. DOI: 10.1007/978-3-642-42033-7_2  1
2013 Bunn P, Ostrovsky R. Secure end-to-end communication with optimal throughput and resilience against malicious adversary Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8205: 403-417. DOI: 10.1007/978-3-642-41527-2_28  1
2013 Braverman V, Ostrovsky R. Generalizing the layering method of indyk and Woodruff: Recursive sketches for frequency-based vectors on streams Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8096: 58-70. DOI: 10.1007/978-3-642-40328-6_5  1
2013 Braverman V, Ostrovsky R. Approximating large frequency moments with pick-and-drop sampling Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8096: 42-57. DOI: 10.1007/978-3-642-40328-6_4  1
2013 Ishai Y, Kushilevitz E, Li X, Ostrovsky R, Prabhakaran M, Sahai A, Zuckerman D. Robust pseudorandom generators Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7965: 576-588. DOI: 10.1007/978-3-642-39206-1_49  1
2013 Braverman V, Ostrovsky R, Vilenchik D. How hard is counting triangles in the streaming model? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7965: 244-254. DOI: 10.1007/978-3-642-39206-1_21  1
2013 Braverman V, Gelles R, Ostrovsky R. How to catch l 2-heavy-hitters on sliding windows Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7936: 638-650. DOI: 10.1007/978-3-642-38768-5_56  1
2013 Lu S, Ostrovsky R. How to garble RAM programs? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7881: 719-734. DOI: 10.1007/978-3-642-38348-9_42  1
2013 Ostrovsky R, Scafuro A, Visconti I, Wadia A. Universally composable secure computation with (malicious) physically uncloneable functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7881: 702-718. DOI: 10.1007/978-3-642-38348-9_41  1
2013 Goyal V, Jain A, Ostrovsky R, Richelson S, Visconti I. Concurrent zero knowledge in the bounded player model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7785: 60-79. DOI: 10.1007/978-3-642-36594-2_4  1
2013 Ostrovsky R, Rao V, Scafuro A, Visconti I. Revisiting lower and upper bounds for selective decommitments Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7785: 559-578. DOI: 10.1007/978-3-642-36594-2_31  1
2013 Lu S, Ostrovsky R. Distributed oblivious RAM for secure two-party computation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7785: 377-396. DOI: 10.1007/978-3-642-36594-2_22  1
2013 Bitansky N, Chiesa A, Ishai Y, Paneth O, Ostrovsky R. Succinct non-interactive arguments via linear interactive proofs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7785: 315-333. DOI: 10.1007/978-3-642-36594-2_18  1
2013 Kumarasubramanian A, Ostrovsky R, Pandey O, Wadia A. Cryptography using captcha puzzles Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7778: 89-106. DOI: 10.1007/978-3-642-36362-7_7  1
2012 Ostrovsky R, Rabani Y, Schulman LJ, Swamy C. The effectiveness of Lloyd-type methods for the k-means problem Journal of the Acm. 59. DOI: 10.1145/2395116.2395117  1
2012 Groth J, Ostrovsky R, Sahai A. New techniques for noninteractive zero-knowledge Journal of the Acm. 59. DOI: 10.1145/2220357.2220358  1
2012 Goyal V, Lee CK, Ostrovsky R, Visconti I. Constructing non-malleable commitments: A black-box approach Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 51-60. DOI: 10.1109/FOCS.2012.47  1
2012 Bradonjić M, Kohler E, Ostrovsky R. Near-optimal radio use for wireless network synchronization Theoretical Computer Science. 453: 14-28. DOI: 10.1016/j.tcs.2011.09.026  1
2012 Braverman V, Ostrovsky R, Zaniolo C. Optimal sampling from sliding windows Journal of Computer and System Sciences. 78: 260-272. DOI: 10.1016/j.jcss.2011.04.004  1
2012 Ben-Sasson E, Fehr S, Ostrovsky R. Near-linear unconditionally-secure multiparty computation with a dishonest minority Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7417: 663-680. DOI: 10.1007/978-3-642-32009-5_39  1
2012 Garg S, Kumarasubramanian A, Ostrovsky R, Visconti I. Impossibility results for static input secure computation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7417: 424-442. DOI: 10.1007/978-3-642-32009-5_25  1
2012 Baron J, Ostrovsky R, Visconti I. Nearly simultaneously resettable black-box zero knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7391: 88-99. DOI: 10.1007/978-3-642-31594-7_8  1
2012 Gelles R, Ostrovsky R, Winoto K. Multiparty proximity testing with dishonest majority from equality testing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7392: 537-548. DOI: 10.1007/978-3-642-31585-5-48  1
2012 Chandran N, Garay J, Ostrovsky R. Edge fault tolerance on sparse networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7392: 452-463. DOI: 10.1007/978-3-642-31585-5-41  1
2012 Hemenway B, Ostrovsky R. On homomorphic encryption and chosen-ciphertext security Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7293: 52-65. DOI: 10.1007/978-3-642-30057-8_4  1
2012 Hemenway B, Ostrovsky R. Extended-DDH and lossy trapdoor functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7293: 627-643. DOI: 10.1007/978-3-642-30057-8_37  1
2012 Hemenway B, Lu S, Ostrovsky R. Correlated product security from any one-way function Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7293: 558-575. DOI: 10.1007/978-3-642-30057-8_33  1
2012 Cevallos A, Fehr S, Ostrovsky R, Rabani Y. Unconditionally-secure robust secret sharing with compact shares Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7237: 195-208. DOI: 10.1007/978-3-642-29011-4_13  1
2012 Cho C, Ostrovsky R, Scafuro A, Visconti I. Simultaneously resettable arguments of knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7194: 530-547. DOI: 10.1007/978-3-642-28914-9_30  1
2012 Garg S, Ostrovsky R, Visconti I, Wadia A. Resettable statistical zero knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7194: 494-511. DOI: 10.1007/978-3-642-28914-9_28  1
2012 Ishai Y, Ostrovsky R, Seyalioglu H. Identifying cheaters without an honest majority Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7194: 21-38. DOI: 10.1007/978-3-642-28914-9_2  1
2012 Kushilevitz E, Lu S, Ostrovsky R. On the (in)security of hash-based oblivious RAM and a new balancing scheme Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 143-156.  1
2011 Curtmola R, Garay J, Kamara S, Ostrovsky R. Searchable symmetric encryption: Improved definitions and efficient constructions Journal of Computer Security. 19: 895-934. DOI: 10.3233/JCS-2011-0426  1
2011 Ostrovsky R. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS: Foreword Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. xii. DOI: 10.1109/FOCS.2011.4  1
2011 Hemenway B, Libert B, Ostrovsky R, Vergnaud D. Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7073: 70-88. DOI: 10.1007/978-3-642-25385-0_4  1
2011 Hemenway B, Ostrovsky R, Strauss MJ, Wootters M. Public key locally decodable codes with short keys Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6845: 605-615. DOI: 10.1007/978-3-642-22935-0_51  1
2011 Ishai Y, Kushilevitz E, Ostrovsky R, Prabhakaran M, Sahai A, Wullschleger J. Constant-rate oblivious transfer from noisy channels Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6841: 667-684. DOI: 10.1007/978-3-642-22792-9_38  1
2011 Buhrman H, Chandran N, Fehr S, Gelles R, Goyal V, Ostrovsky R, Schaffner C. Position-based quantum cryptography: Impossibility and constructions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6841: 429-446. DOI: 10.1007/978-3-642-22792-9_24  1
2011 Garay J, Givens C, Ostrovsky R. Secure message transmission by public discussion: A brief survey Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6639: 126-141. DOI: 10.1007/978-3-642-20901-7_8  1
2011 Ishai Y, Kushilevitz E, Ostrovsky R, Prabhakaran M, Sahai A. Efficient non-interactive secure computation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6632: 406-425. DOI: 10.1007/978-3-642-20465-4_23  1
2011 Braverman V, Meyerson A, Ostrovsky R, Roytman A, Shindler M, Tagiku B. Streaming k-means on well-clusterable data Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 26-40.  1
2010 Gordon D, Ishai Y, Moran T, Ostrovsky R, Sahai A. On complete primitives for fairness Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5978: 91-108. DOI: 10.1007/978-3-642-11799-2_7  1
2009 Ostrovsky R, Rabani Y, Schulman LJ. Error-correcting codes for automatic control Ieee Transactions On Information Theory. 55: 2931-2941. DOI: 10.1109/TIT.2009.2021303  1
2009 Ishai Y, Kushilevitz E, Ostrovsky R, Sahai A. Extracting correlations Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 261-270. DOI: 10.1109/FOCS.2009.56  1
2008 Chandran N, Moriarty R, Ostrovsky R, Pandey O, Safari MA, Sahai A. Improved algorithms for optimal embeddings Acm Transactions On Algorithms. 4. DOI: 10.1145/1383369.1383376  1
2008 Dodis Y, Ostrovsky R, Reyzin L, Smith A. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data Siam Journal On Computing. 38: 97-139. DOI: 10.1137/060651380  1
2007 Ostrovsky R, Sahai A, Waters B. Attribute-based encryption with non-monotonic access structures Proceedings of the Acm Conference On Computer and Communications Security. 195-203. DOI: 10.1145/1315245.1315270  1
2005 Fitzi M, Garay JA, Maurer U, Ostrovsky R. Minimal complete primitives for secure multi-party computation Journal of Cryptology. 18: 37-61. DOI: 10.1007/s00145-004-0150-y  1
2001 Chuzhoy J, Ostrovsky R, Rabani Y. Approximation algorithms for the job interval selection problem and related scheduling problems Annual Symposium On Foundations of Computer Science - Proceedings. 348-356. DOI: 10.1287/moor.1060.0218  1
Show low-probability matches.