Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRafail Ostrovsky
Rafail M. Ostrovsky
Person information
- affiliation: University of California, Los Angeles, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 1992
[b1]Rafail Ostrovsky:
Software protection and simulation on oblivious RAMs. Massachusetts Institute of Technology, Cambridge, MA, USA, 1992
Journal Articles
- 2023
- [j65]Brett Hemenway Falk, Rohit Nema
, Rafail Ostrovsky:
Linear-time 2-party secure merge from additively homomorphic encryption. J. Comput. Syst. Sci. 137: 37-49 (2023) - 2022
- [j64]Shaan Mathur, Rafail Ostrovsky:
A combinatorial characterization of self-stabilizing population protocols. Inf. Comput. 285(Part): 104829 (2022) - [j63]Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat:
A refined approximation for Euclidean k-means. Inf. Process. Lett. 176: 106251 (2022) - [j62]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-Interactive Arguments via Linear Interactive Proofs. J. Cryptol. 35(3): 15 (2022) - 2021
- [j61]Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, Damien Vergnaud:
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. SIAM J. Discret. Math. 35(1): 465-484 (2021) - 2020
- [j60]Paul Bunn, Rafail Ostrovsky:
Oblivious Sampling with Applications to Two-Party k-Means Clustering. J. Cryptol. 33(3): 1362-1403 (2020) - [j59]Ran Gelles, Rafail Ostrovsky, Alan Roytman:
Efficient Error-Correcting Codes for Sliding Windows. SIAM J. Discret. Math. 34(1): 904-937 (2020) - 2019
- [j58]Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum:
A stable marriage requires communication. Games Econ. Behav. 118: 626-647 (2019) - 2018
- [j57]Brett Hemenway, Rafail Ostrovsky:
Efficient robust secret sharing from expander graphs. Cryptogr. Commun. 10(1): 79-99 (2018) - [j56]George Alter, Brett Hemenway Falk, Steve Lu, Rafail Ostrovsky:
Computing Statistics from Private Data. Data Sci. J. 17: 31 (2018) - 2017
- [j55]Juan A. Garay, Rafail Ostrovsky:
Special Issue: Algorithmic Tools in Cryptography. Algorithmica 79(4): 985-986 (2017) - [j54]Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky:
Coding for Interactive Communication Correcting Insertions and Deletions. IEEE Trans. Inf. Theory 63(10): 6256-6270 (2017) - [j53]David Felber, Rafail Ostrovsky:
A Randomized Online Quantile Summary in O((1/ε) log(1/ε)) Words. Theory Comput. 13(1): 1-17 (2017) - 2016
- [j52]Nirattaya Khamsemanan, Rafail Ostrovsky, William E. Skeith III:
On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols. SIAM J. Discret. Math. 30(1): 266-295 (2016) - 2015
- [j51]Brett Hemenway, Rafail Ostrovsky, Mary Wootters:
Local correctability of expander codes. Inf. Comput. 243: 178-190 (2015) - [j50]Vladimir Braverman, Rafail Ostrovsky, Gregory Vorsanger:
Weighted sampling without replacement from data streams. Inf. Process. Lett. 115(12): 923-926 (2015) - [j49]Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky:
Almost-Everywhere Secure Computation with Edge Corruptions. J. Cryptol. 28(4): 745-768 (2015) - [j48]Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman:
Optimal Coding for Streaming Authentication and Interactive Communication. IEEE Trans. Inf. Theory 61(1): 133-145 (2015) - 2014
- [j47]Farhad Hormozdiari, Jong Wha J. Joo, Akshay Wadia, Feng Guan, Rafail Ostrovsky, Amit Sahai, Eleazar Eskin:
Privacy preserving protocol for detecting genetic relatives using rare variants. Bioinform. 30(12): 204-211 (2014) - [j46]Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky, Leonid Reyzin:
Privacy amplification with asymptotically optimal entropy loss. J. ACM 61(5): 29:1-29:28 (2014) - [j45]Jens Groth, Rafail Ostrovsky:
Cryptography in the Multi-string Model. J. Cryptol. 27(3): 506-543 (2014) - [j44]Yair Amir, Paul Bunn, Rafail Ostrovsky:
Authenticated Adversarial Routing. J. Cryptol. 27(4): 636-771 (2014) - [j43]Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. SIAM J. Comput. 43(1): 150-178 (2014) - [j42]Eli Ben-Sasson, Rafail Ostrovsky:
Special Section on the Fifty-Second IEEE Annual Symposium on Foundations of Computer Science (FOCS 2011). SIAM J. Comput. 43(2): 654 (2014) - [j41]Nishanth Chandran, Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky:
Position-Based Cryptography. SIAM J. Comput. 43(4): 1291-1341 (2014) - [j40]Joshua Baron, Yuval Ishai, Rafail Ostrovsky:
On linear-size pseudorandom generators and hardcore functions. Theor. Comput. Sci. 554: 50-63 (2014) - [j39]Vladimir Braverman, Ran Gelles, Rafail Ostrovsky:
How to catch L2-heavy-hitters on sliding windows. Theor. Comput. Sci. 554: 82-94 (2014) - [j38]Juan A. Garay, Clint Givens, Rafail Ostrovsky:
Secure Message Transmission With Small Public Discussion. IEEE Trans. Inf. Theory 60(4): 2373-2390 (2014) - [j37]Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky:
Deterministic and Energy-Optimal Wireless Synchronization. ACM Trans. Sens. Networks 11(1): 13:1-13:25 (2014) - 2013
- [j36]Joshua Baron, Karim El Defrawy, Kirill Minkovich, Rafail Ostrovsky, Eric Tressler:
5PM: Secure pattern matching. J. Comput. Secur. 21(5): 601-625 (2013) - [j35]Steve Lu, Rafail Ostrovsky, Amit Sahai, Hovav Shacham, Brent Waters:
Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles. J. Cryptol. 26(2): 340-373 (2013) - 2012
- [j34]Jens Groth, Rafail Ostrovsky, Amit Sahai:
New Techniques for Noninteractive Zero-Knowledge. J. ACM 59(3): 11:1-11:35 (2012) - [j33]Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
The effectiveness of lloyd-type methods for the k-means problem. J. ACM 59(6): 28:1-28:22 (2012) - [j32]Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo:
Optimal sampling from sliding windows. J. Comput. Syst. Sci. 78(1): 260-272 (2012) - [j31]Milan Bradonjic, Eddie Kohler, Rafail Ostrovsky:
Near-optimal radio use for wireless network synchronization. Theor. Comput. Sci. 453: 14-28 (2012) - 2011
- [j30]Steve Lu, Daniel Manchala, Rafail Ostrovsky:
Visual cryptography on graphs. J. Comb. Optim. 21(1): 47-66 (2011) - [j29]Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail Ostrovsky:
Searchable symmetric encryption: Improved definitions and efficient constructions. J. Comput. Secur. 19(5): 895-934 (2011) - 2010
- [j28]Vladimir Braverman, Rafail Ostrovsky:
Effective Computations on Sliding Windows. SIAM J. Comput. 39(6): 2113-2131 (2010) - 2009
- [j27]Jonathan Katz, Rafail Ostrovsky, Moti Yung:
Efficient and secure authenticated key exchange using weak passwords. J. ACM 57(1): 3:1-3:39 (2009) - [j26]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Zero-Knowledge Proofs from Secure Multiparty Computation. SIAM J. Comput. 39(3): 1121-1152 (2009) - [j25]Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman:
Error-correcting codes for automatic control. IEEE Trans. Inf. Theory 55(7): 2931-2941 (2009) - 2008
- [j24]Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam D. Smith:
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. SIAM J. Comput. 38(1): 97-139 (2008) - [j23]Nishanth Chandran, Ryan Moriarty, Rafail Ostrovsky, Omkant Pandey, Mohammad Ali Safari, Amit Sahai:
Improved algorithms for optimal embeddings. ACM Trans. Algorithms 4(4): 45:1-45:14 (2008) - 2007
- [j22]Rafail Ostrovsky, Yuval Rabani:
Low distortion embeddings for edit distance. J. ACM 54(5): 23 (2007) - [j21]Rafail Ostrovsky, William E. Skeith III:
Private Searching on Streaming Data. J. Cryptol. 20(4): 397-430 (2007) - 2006
- [j20]Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani:
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. Math. Oper. Res. 31(4): 730-738 (2006) - 2005
- [j19]Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky:
Minimal Complete Primitives for Secure Multi-Party Computation. J. Cryptol. 18(1): 37-61 (2005) - 2004
- [j18]Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds. J. Interconnect. Networks 5(1): 1-12 (2004) - [j17]Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. Mach. Learn. 56(1-3): 153-167 (2004) - 2003
- [j16]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Amortizing Randomness in Private Multiparty Computations. SIAM J. Discret. Math. 16(4): 533-544 (2003) - 2002
- [j15]Rafail Ostrovsky, Yuval Rabani:
Polynomial-time approximation schemes for geometric min-sum median clustering. J. ACM 49(2): 139-156 (2002) - [j14]Alain J. Mayer, Rafail Ostrovsky, Yoram Ofek, Moti Yung:
Self-Stabilizing Symmetry Breaking in Constant Space. SIAM J. Comput. 31(5): 1571-1595 (2002) - 2001
- [j13]Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky:
Universal Service-Providers for Private Information Retrieval. J. Cryptol. 14(1): 37-74 (2001) - 2000
- [j12]Shay Kutten, Rafail Ostrovsky, Boaz Patt-Shamir:
The Las-Vegas Processor Identity Problem (How and When to Be Unique). J. Algorithms 37(2): 468-494 (2000) - [j11]William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Adaptive Packet Routing for Bursty Adversarial Traffic. J. Comput. Syst. Sci. 60(3): 482-509 (2000) - [j10]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness versus Fault-Tolerance. J. Cryptol. 13(1): 107-142 (2000) - [j9]Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky:
Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000) - [j8]Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani:
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. SIAM J. Comput. 30(2): 457-474 (2000) - [j7]Shlomi Dolev, Rafail Ostrovsky:
Xor-trees for efficient anonymous multicast and reception. ACM Trans. Inf. Syst. Secur. 3(2): 63-84 (2000) - 1999
- [j6]Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky:
The Linear-Array Conjecture in Communication Complexity Is False. Comb. 19(2): 241-254 (1999) - [j5]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Characterizing Linear Size Circuits in Terms of Pricacy. J. Comput. Syst. Sci. 58(1): 129-136 (1999) - 1998
- [j4]Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung:
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation. J. Cryptol. 11(2): 87-108 (1998) - [j3]Oded Goldreich, Rafail Ostrovsky, Erez Petrank:
Computational Complexity and Knowledge Complexity. SIAM J. Comput. 27(4): 1116-1141 (1998) - [j2]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Log-Space Polynomial End-to-End Communication. SIAM J. Comput. 27(6): 1531-1549 (1998) - 1996
- [j1]Oded Goldreich, Rafail Ostrovsky:
Software Protection and Simulation on Oblivious RAMs. J. ACM 43(3): 431-473 (1996)
Conference and Workshop Papers
- 2023
- [c278]Samuel Dittmer, Karim Eldefrawy, Stéphane Graham-Lengrand, Steve Lu, Rafail Ostrovsky, Vitor Pereira:
Boosting the Performance of High-Assurance Cryptography: Parallel Execution and Optimizing Memory Access in Formally-Verified Line-Point Zero-Knowledge. CCS 2023: 2098-2112 - [c277]Vipul Goyal, Chen-Da Liu-Zhang, Rafail Ostrovsky:
Asymmetric Multi-Party Computation. ITC 2023: 6:1-6:25 - [c276]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Tri-State Circuits - A Circuit Model that Captures RAM. CRYPTO (4) 2023: 128-160 - [c275]Yuval Ishai, Rafail Ostrovsky, Akash Shah:
Succinct Arguments for RAM Programs via Projection Codes. CRYPTO (2) 2023: 159-192 - [c274]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. CRYPTO (1) 2023: 459-488 - [c273]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
Anonymous Permutation Routing. TCC (3) 2023: 33-61 - [c272]Brett Hemenway, Daniel Noble, Rafail Ostrovsky, Matan Shtepel, Jacob Zhang:
DORAM Revisited: Maliciously Secure RAM-MPC with Logarithmic Overhead. TCC (1) 2023: 441-470 - [c271]Brett Hemenway Falk, Rafail Ostrovsky, Matan Shtepel, Jacob Zhang:
GigaDORAM: Breaking the Billion Address Barrier. USENIX Security Symposium 2023: 3871-3888 - 2022
- [c270]Wutichai Chongchitmate, Yuval Ishai, Steve Lu, Rafail Ostrovsky:
PSI from Ring-OLE. CCS 2022: 531-545 - [c269]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky:
Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One. CCS 2022: 829-841 - [c268]Nishanth Chandran, Pouyan Forghani, Juan A. Garay, Rafail Ostrovsky, Rutvik Patel, Vassilis Zikas:
Universally Composable Almost-Everywhere Secure Computation. ITC 2022: 14:1-14:25 - [c267]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky:
Authenticated Garbling from Simple Correlations. CRYPTO (4) 2022: 57-87 - [c266]Brett Hemenway Falk, Rohit Nema, Rafail Ostrovsky:
A Linear-Time 2-Party Secure Merge Protocol. CSCML 2022: 408-427 - [c265]Michele Ciampi, Muhammad Ishaq, Malik Magdon-Ismail, Rafail Ostrovsky, Vassilis Zikas:
FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker. CSCML 2022: 428-446 - [c264]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
EpiGRAM: Practical Garbled RAM. EUROCRYPT (1) 2022: 3-33 - [c263]Abida Haque, David Heath, Vladimir Kolesnikov, Steve Lu, Rafail Ostrovsky, Akash Shah:
Garbled Circuits with Sublinear Evaluator. EUROCRYPT (1) 2022: 37-64 - [c262]Michele Ciampi, Rafail Ostrovsky, Hendrik Waldner, Vassilis Zikas:
Round-Optimal and Communication-Efficient Multiparty Computation. EUROCRYPT (1) 2022: 65-95 - [c261]Laasya Bangalore, Rafail Ostrovsky, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam:
Adaptively Secure Computation for RAM Programs. EUROCRYPT (2) 2022: 187-216 - [c260]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
CNF-FSS and Its Applications. Public Key Cryptography (1) 2022: 283-314 - [c259]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
3-Party Distributed ORAM from Oblivious Set Membership. SCN 2022: 437-461 - [c258]Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky, Antigoni Polychroniadou:
Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares. SCN 2022: 516-539 - [c257]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky, Mohamed Elsabagh, Nikolaos Kiourtis, Brian Schulte, Angelos Stavrou:
Streaming and Unbalanced PSI from Function Secret Sharing. SCN 2022: 564-587 - 2021
- [c256]Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani:
Min-Sum Clustering (With Outliers). APPROX-RANDOM 2021: 16:1-16:16 - [c255]Sanjam Garg, Mohammad Hajiabadi, Giulio Malavolta, Rafail Ostrovsky:
How to Build a Trapdoor Function from an Encryption Scheme. ASIACRYPT (3) 2021: 220-249 - [c254]Nicholas Franzese, Jonathan Katz, Steve Lu, Rafail Ostrovsky, Xiao Wang, Chenkai Weng:
Constant-Overhead Zero-Knowledge for RAM Programs. CCS 2021: 178-191 - [c253]Xiaoqi Duan, Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, Yifan Song:
ACCO: Algebraic Computation with Comparison. CCSW 2021: 21-38 - [c252]Samuel Dittmer, Yuval Ishai, Rafail Ostrovsky:
Line-Point Zero Knowledge and Its Applications. ITC 2021: 5:1-5:24 - [c251]Brett Hemenway Falk, Rafail Ostrovsky:
Secure Merge with O(n log log n) Secure Operations. ITC 2021: 7:1-7:29 - [c250]Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, Yifan Song:
ATLAS: Efficient and Scalable MPC in the Honest Majority Setting. CRYPTO (2) 2021: 244-274 - [c249]Michele Ciampi, Vipul Goyal, Rafail Ostrovsky:
Threshold Garbled Circuits and Ad Hoc Secure Computation. EUROCRYPT (3) 2021: 64-93 - [c248]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
Alibi: A Flaw in Cuckoo-Hashing Based Hierarchical ORAM Schemes and a Solution. EUROCRYPT (3) 2021: 338-369 - [c247]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds. TCC (2) 2021: 518-549 - 2020
- [c246]Ohad Barta, Yuval Ishai, Rafail Ostrovsky, David J. Wu:
On Succinct Arguments and Witness Encryption from Groups. CRYPTO (1) 2020: 776-806 - [c245]Juan A. Garay, Aggelos Kiayias, Rafail M. Ostrovsky, Giorgos Panagiotakos, Vassilis Zikas:
Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era. EUROCRYPT (2) 2020: 129-158 - [c244]Leonard Kleinrock, Rafail Ostrovsky, Vassilis Zikas:
Proof-of-Reputation Blockchain with Nakamoto Fallback. INDOCRYPT 2020: 16-38 - [c243]Karim Eldefrawy, Seoyeon Hwang, Rafail Ostrovsky, Moti Yung:
Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups. SCN 2020: 108-129 - [c242]Paul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky:
Efficient 3-Party Distributed ORAM. SCN 2020: 215-232 - [c241]Samuel Dittmer, Rafail Ostrovsky:
Oblivious Tight Compaction In O(n) Time with Smaller Constant. SCN 2020: 253-274 - [c240]Shaan Mathur, Rafail Ostrovsky:
A Combinatorial Characterization of Self-stabilizing Population Protocols. SSS 2020: 167-182 - [c239]Sanjam Garg, Mohammad Hajiabadi, Rafail Ostrovsky:
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More. TCC (1) 2020: 88-116 - [c238]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Round Optimal Secure Multiparty Computation from Minimal Assumptions. TCC (2) 2020: 291-319 - 2019
- [c237]Saikrishna Badrinarayanan, Abhishek Jain, Rafail Ostrovsky, Ivan Visconti:
UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens. ASIACRYPT (2) 2019: 577-605 - [c236]Nico Döttling, Sanjam Garg, Yuval Ishai, Giulio Malavolta, Tamer Mour, Rafail Ostrovsky:
Trapdoor Hash Functions and Their Applications. CRYPTO (3) 2019: 3-32 - [c235]Nishanth Chandran, Wutichai Chongchitmate, Rafail Ostrovsky, Ivan Visconti:
Universally Composable Secure Computation with Corrupted Tokens. CRYPTO (3) 2019: 432-461 - [c234]Melissa Chase, Yevgeniy Dodis, Yuval Ishai, Daniel Kraschewski, Tianren Liu, Rafail Ostrovsky, Vinod Vaikuntanathan:
Reusable Non-Interactive Secure Computation. CRYPTO (3) 2019: 462-488 - [c233]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptographic Sensing. CRYPTO (3) 2019: 583-604 - [c232]Ariel Hamlin, Rafail Ostrovsky, Mor Weiss, Daniel Wichs:
Private Anonymous Data Access. EUROCRYPT (2) 2019: 244-273 - [c231]Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosén, Adrian Thillard, Damien Vergnaud:
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. TCC (2) 2019: 386-406 - [c230]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
Private Set Intersection with Linear Communication from General Assumptions. WPES@CCS 2019: 14-25 - [c229]Brett Hemenway Falk, Steve Lu, Rafail Ostrovsky:
DURASIFT: A Robust, Decentralized, Encrypted Database Supporting Private Searches with Complex Policy Controls. WPES@CCS 2019: 26-36 - 2018
- [c228]Saikrishna Badrinarayanan, Abhishek Jain, Rafail Ostrovsky, Ivan Visconti:
Non-interactive Secure Computation from One-Way Functions. ASIACRYPT (3) 2018: 118-138 - [c227]Karim Eldefrawy, Rafail Ostrovsky, Moti Yung:
Theoretical Foundations for Mobile Target Defense: Proactive Secret Sharing and Secure Multiparty Computation. From Database to Cyber Security 2018: 470-486 - [c226]Quinn Grier, Brett Hemenway Falk, Steve Lu, Rafail Ostrovsky:
ETERNAL: Encrypted Transmission With an Error-correcting, Real-time, Noise-resilient Apparatus on Lightweight Devices. MPS@CCS 2018: 61-70 - [c225]Yun Lu, Konstantinos Mitropoulos, Rafail Ostrovsky, Avraham Weinstock, Vassilis Zikas:
Cryptographically Secure Detection of Injection Attacks. CCS 2018: 2240-2242 - [c224]Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan:
Adaptive Garbled RAM from Laconic Oblivious Transfer. CRYPTO (3) 2018: 515-544 - [c223]Rafail Ostrovsky, Giuseppe Persiano, Daniele Venturi, Ivan Visconti:
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions. CRYPTO (3) 2018: 608-639 - [c222]Rafail Ostrovsky, Yuval Rabani, Arman Yousefi:
Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration. ICALP 2018: 93:1-93:11 - [c221]Yuval Ishai, Manika Mittal, Rafail Ostrovsky:
On the Message Complexity of Secure Multiparty Computation. Public Key Cryptography (1) 2018: 698-711 - [c220]Shafi Goldwasser, Rafail Ostrovsky, Alessandra Scafuro, Adam Sealfon:
Population Stability: Regulating Size in the Presence of an Adversary. PODC 2018: 397-406 - [c219]Karim Eldefrawy, Rafail Ostrovsky, Sunoo Park, Moti Yung:
Proactive Secure Multiparty Computation with a Dishonest Majority. SCN 2018: 200-215 - [c218]Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan:
Round Optimal Black-Box "Commit-and-Prove". TCC (1) 2018: 286-313 - [c217]Wutichai Chongchitmate, Rafail Ostrovsky:
Information-Theoretic Broadcast with Dishonest Majority for Long Messages. TCC (1) 2018: 370-388 - 2017
- [c216]Steve Lu, Rafail Ostrovsky:
Black-Box Parallel Garbled RAM. CRYPTO (2) 2017: 66-92 - [c215]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions. CRYPTO (2) 2017: 127-157 - [c214]Juan A. Garay, Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas:
The Price of Low Communication in Secure Multi-party Computation. CRYPTO (1) 2017: 420-446 - [c213]Saikrishna Badrinarayanan, Dakshita Khurana, Rafail Ostrovsky, Ivan Visconti:
Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs. EUROCRYPT (1) 2017: 382-411 - [c212]Wutichai Chongchitmate, Rafail Ostrovsky:
Circuit-Private Multi-key FHE. Public Key Cryptography (2) 2017: 241-270 - [c211]Shlomi Dolev, Karim Eldefrawy, Juan A. Garay, Muni Venkateswarlu Kumaramangalam, Rafail Ostrovsky, Moti Yung:
Brief Announcement: Secure Self-Stabilizing Computation. PODC 2017: 415-417 - [c210]Rafail Ostrovsky, Mor Perry, Will Rosenbaum:
Space-Time Tradeoffs for Distributed Verification. SIROCCO 2017: 53-70 - [c209]Rafail Ostrovsky, Yuval Rabani, Arman Yousefi:
Matrix Balancing in Lp Norms: Bounding the Convergence Rate of Osborne's Iteration. SODA 2017: 154-169 - [c208]Wutichai Chongchitmate, Rafail Ostrovsky, Ivan Visconti:
Resettably-Sound Resettable Zero Knowledge in Constant Rounds. TCC (2) 2017: 111-138 - [c207]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. TCC (1) 2017: 678-710 - [c206]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. TCC (1) 2017: 711-742 - 2016
- [c205]Brett Hemenway, Zahra Jafargholi, Rafail Ostrovsky, Alessandra Scafuro, Daniel Wichs:
Adaptively Secure Garbled Circuits from One-Way Functions. CRYPTO (3) 2016: 149-178 - [c204]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Concurrent Non-Malleable Commitments (and More) in 3 Rounds. CRYPTO (3) 2016: 270-299 - [c203]Yuval Ishai, Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky:
Private Large-Scale Databases with Distributed Searchable Symmetric Encryption. CT-RSA 2016: 90-107 - [c202]Ivan Damgård, Jesper Buus Nielsen, Rafail Ostrovsky, Adi Rosén:
Unconditionally Secure Computation with Reduced Interaction. EUROCRYPT (2) 2016: 420-447 - [c201]Richard J. Lipton, Rafail Ostrovsky, Vassilis Zikas:
Provably Secure Virus Detection: Using The Observer Effect Against Malware. ICALP 2016: 32:1-32:14 - [c200]Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky:
Coding for Interactive Communication Correcting Insertions and Deletions. ICALP 2016: 61:1-61:14 - [c199]Mor Baruch, Rafail Ostrovsky, Will Rosenbaum:
Brief Announcement: Space-Time Tradeoffs for Distributed Verification. PODC 2016: 357-359 - [c198]Shlomi Dolev, Karim Eldefrawy, Joshua Lampkins, Rafail Ostrovsky, Moti Yung:
Brief Announcement: Proactive Secret Sharing with a Dishonest Majority. PODC 2016: 401-403 - [c197]David Felber, Rafail Ostrovsky:
Variability in Data Streams. PODS 2016: 251-260 - [c196]Brett Hemenway, Steve Lu, Rafail Ostrovsky, William Welser IV:
High-Precision Secure Computation of Satellite Collision Probabilities. SCN 2016: 169-187 - [c195]Shlomi Dolev, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky, Moti Yung:
Proactive Secret Sharing with a Dishonest Majority. SCN 2016: 529-548 - [c194]Brett Hemenway, Rafail Ostrovsky, Silas Richelson, Alon Rosen:
Adaptive Security with Quasi-Optimal Rate. TCC (A1) 2016: 525-541 - 2015
- [c193]Joshua Baron, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky:
Communication-Optimal Proactive Secret Sharing for Dynamic Groups. ACNS 2015: 23-41 - [c192]Vladimir Braverman, Rafail Ostrovsky, Alan Roytman:
Zero-One Laws for Sliding Windows and Universal Sketches. APPROX-RANDOM 2015: 573-590 - [c191]David Felber, Rafail Ostrovsky:
A Randomized Online Quantile Summary in O(1/epsilon * log(1/epsilon)) Words. APPROX-RANDOM 2015: 775-785 - [c190]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Impossibility of Black-Box Simulation Against Leakage Attacks. CRYPTO (2) 2015: 130-149 - [c189]Sanjam Garg, Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography with One-Way Communication. CRYPTO (2) 2015: 191-208 - [c188]Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro:
Round-Optimal Black-Box Two-Party Computation. CRYPTO (2) 2015: 339-358 - [c187]Joël Alwen, Rafail Ostrovsky, Hong-Sheng Zhou, Vassilis Zikas:
Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting. CRYPTO (2) 2015: 763-780 - [c186]Melissa Chase, Rafail Ostrovsky, Ivan Visconti:
Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World. EUROCRYPT (2) 2015: 532-560 - [c185]Sanjam Garg, Steve Lu, Rafail Ostrovsky:
Black-Box Garbled RAM. FOCS 2015: 210-229 - [c184]Rafail Ostrovsky, Anat Paskin-Cherniavsky:
Locally Decodable Codes for Edit Distance. ICITS 2015: 236-249 - [c183]Nishanth Chandran, Wutichai Chongchitmate, Juan A. Garay, Shafi Goldwasser, Rafail Ostrovsky, Vassilis Zikas:
The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults. ITCS 2015: 153-162 - [c182]Rafail Ostrovsky, Will Rosenbaum:
Fast Distributed Almost Stable Matchings. PODC 2015: 101-108 - [c181]Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum:
A Stable Marriage Requires Communication. SODA 2015: 1003-1017 - [c180]Sanjam Garg, Steve Lu, Rafail Ostrovsky, Alessandra Scafuro:
Garbled RAM From One-Way Functions. STOC 2015: 449-458 - [c179]Rafail Ostrovsky, Alessandra Scafuro, Muthuramakrishnan Venkitasubramaniam:
Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way. TCC (1) 2015: 345-374 - [c178]Brett Hemenway, Rafail Ostrovsky, Alon Rosen:
Non-committing Encryption from Φ-hiding. TCC (1) 2015: 591-608 - 2014
- [c177]Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas:
Secure Multi-Party Computation with Identifiable Abort. CRYPTO (2) 2014: 369-386 - [c176]Rafail Ostrovsky, Anat Paskin-Cherniavsky, Beni Paskin-Cherniavsky:
Maliciously Circuit-Private FHE. CRYPTO (1) 2014: 536-553 - [c175]Craig Gentry, Shai Halevi, Steve Lu, Rafail Ostrovsky, Mariana Raykova, Daniel Wichs:
Garbled RAM Revisited. EUROCRYPT 2014: 405-422 - [c174]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
On Input Indistinguishable Proof Systems. ICALP (1) 2014: 895-906 - [c173]Prabhanjan Ananth, Nishanth Chandran, Vipul Goyal, Bhavana Kanukurthi, Rafail Ostrovsky:
Achieving Privacy in Verifiable Computation with Multiple Servers - Without FHE and without Pre-processing. Public Key Cryptography 2014: 149-166 - [c172]Chongwon Cho, Sanjam Garg, Rafail Ostrovsky:
Cross-Domain Secure Computation. Public Key Cryptography 2014: 650-668 - [c171]Joshua Baron, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky:
How to withstand mobile virus attacks, revisited. PODC 2014: 293-302 - [c170]Juan A. Garay, Clinton Givens, Rafail Ostrovsky, Pavel Raykov:
Fast and unconditionally secure anonymous channel. PODC 2014: 313-321 - [c169]Joshua Lampkins, Rafail Ostrovsky:
Communication-Efficient MPC for General Adversary Structures. SCN 2014: 155-174 - [c168]Rafail Ostrovsky, Vanishree Rao, Ivan Visconti:
On Selective-Opening Attacks against Encryption Schemes. SCN 2014: 578-597 - [c167]Ran Gelles, Rafail Ostrovsky, Alan Roytman:
Efficient Error-Correcting Codes for Sliding Windows. SOFSEM 2014: 258-268 - [c166]Vipul Goyal, Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti:
Black-box non-black-box zero knowledge. STOC 2014: 515-524 - [c165]Claudio Orlandi, Rafail Ostrovsky, Vanishree Rao, Amit Sahai, Ivan Visconti:
Statistical Concurrent Non-malleable Zero Knowledge. TCC 2014: 167-191 - [c164]Kai-Min Chung, Rafail Ostrovsky, Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Ivan Visconti:
4-Round Resettably-Sound Zero Knowledge. TCC 2014: 192-216 - [c163]Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky:
Locally Updatable and Locally Decodable Codes. TCC 2014: 489-514 - 2013
- [c162]Vladimir Braverman, Rafail Ostrovsky:
Approximating Large Frequency Moments with Pick-and-Drop Sampling. APPROX-RANDOM 2013: 42-57 - [c161]Vladimir Braverman, Rafail Ostrovsky:
Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams. APPROX-RANDOM 2013: 58-70 - [c160]Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti:
Constant-Round Concurrent Zero Knowledge in the Bounded Player Model. ASIACRYPT (1) 2013: 21-40 - [c159]Brett Hemenway, Rafail Ostrovsky:
Building Lossy Trapdoor Functions from Lossy Encryption. ASIACRYPT (2) 2013: 241-260 - [c158]Joshua Baron, Yuval Ishai, Rafail Ostrovsky:
On Linear-Size Pseudorandom Generators and Hardcore Functions. COCOON 2013: 169-181 - [c157]Vladimir Braverman, Ran Gelles, Rafail Ostrovsky:
How to Catch L 2-Heavy-Hitters on Sliding Windows. COCOON 2013: 638-650 - [c156]Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman:
Optimal Coding for Streaming Authentication and Interactive Communication. CRYPTO (2) 2013: 258-276 - [c155]Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti, Akshay Wadia:
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions. EUROCRYPT 2013: 702-718 - [c154]Steve Lu, Rafail Ostrovsky:
How to Garble RAM Programs. EUROCRYPT 2013: 719-734 - [c153]Kai-Min Chung, Rafail Ostrovsky, Rafael Pass, Ivan Visconti:
Simultaneous Resettability from One-Way Functions. FOCS 2013: 60-69 - [c152]Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik:
How Hard Is Counting Triangles in the Streaming Model? ICALP (1) 2013: 244-254 - [c151]Brett Hemenway, Rafail Ostrovsky, Mary Wootters:
Local Correctability of Expander Codes. ICALP (1) 2013: 540-551 - [c150]Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman:
Robust Pseudorandom Generators. ICALP (1) 2013: 576-588 - [c149]Juan A. Garay, Clint Givens, Rafail Ostrovsky, Pavel Raykov:
Broadcast (and Round) Efficient Verifiable Secret Sharing. ICITS 2013: 200-219 - [c148]Abishek Kumarasubramanian, Rafail Ostrovsky, Omkant Pandey, Akshay Wadia:
Cryptography Using Captcha Puzzles. Public Key Cryptography 2013: 89-106 - [c147]Vipul Goyal, Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti:
Concurrent Zero Knowledge in the Bounded Player Model. TCC 2013: 60-79 - [c146]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-interactive Arguments via Linear Interactive Proofs. TCC 2013: 315-333 - [c145]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs. TCC 2013 - [c144]Steve Lu, Rafail Ostrovsky:
Distributed Oblivious RAM for Secure Two-Party Computation. TCC 2013: 377-396 - [c143]Rafail Ostrovsky, Vanishree Rao, Alessandra Scafuro, Ivan Visconti:
Revisiting Lower and Upper Bounds for Selective Decommitments. TCC 2013: 559-578 - [c142]Paul Bunn, Rafail Ostrovsky:
Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary. DISC 2013: 403-417 - 2012
- [c141]Sanjam Garg, Abishek Kumarasubramanian, Rafail Ostrovsky, Ivan Visconti:
Impossibility Results for Static Input Secure Computation. CRYPTO 2012: 424-442 - [c140]Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky:
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. CRYPTO 2012: 663-680 - [c139]Alfonso Cevallos, Serge Fehr, Rafail Ostrovsky, Yuval Rabani:
Unconditionally-Secure Robust Secret Sharing with Compact Shares. EUROCRYPT 2012: 195-208 - [c138]Vipul Goyal, Chen-Kuei Lee, Rafail Ostrovsky, Ivan Visconti:
Constructing Non-malleable Commitments: A Black-Box Approach. FOCS 2012: 51-60 - [c137]Joshua Baron, Rafail Ostrovsky, Ivan Visconti:
Nearly Simultaneously Resettable Black-Box Zero Knowledge. ICALP (1) 2012: 88-99 - [c136]Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky:
Edge Fault Tolerance on Sparse Networks. ICALP (2) 2012: 452-463 - [c135]Ran Gelles, Rafail Ostrovsky, Kina Winoto:
Multiparty Proximity Testing with Dishonest Majority from Equality Testing. ICALP (2) 2012: 537-548 - [c134]Brett Hemenway, Rafail Ostrovsky:
On Homomorphic Encryption and Chosen-Ciphertext Security. Public Key Cryptography 2012: 52-65 - [c133]Brett Hemenway, Steve Lu, Rafail Ostrovsky:
Correlated Product Security from Any One-Way Function. Public Key Cryptography 2012: 558-575 - [c132]Brett Hemenway, Rafail Ostrovsky:
Extended-DDH and Lossy Trapdoor Functions. Public Key Cryptography 2012: 627-643 - [c131]Joshua Baron, Karim El Defrawy, Kirill Minkovich, Rafail Ostrovsky, Eric Tressler:
5PM: Secure Pattern Matching. SCN 2012: 222-240 - [c130]Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky:
On the (in)security of hash-based oblivious RAM and a new balancing scheme. SODA 2012: 143-156 - [c129]Yuval Ishai, Rafail Ostrovsky, Hakan Seyalioglu:
Identifying Cheaters without an Honest Majority. TCC 2012: 21-38 - [c128]Sanjam Garg, Rafail Ostrovsky, Ivan Visconti, Akshay Wadia:
Resettable Statistical Zero Knowledge. TCC 2012: 494-511 - [c127]Chongwon Cho, Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti:
Simultaneously Resettable Arguments of Knowledge. TCC 2012: 530-547 - 2011
- [c126]Brett Hemenway, Rafail Ostrovsky, Martin J. Strauss, Mary Wootters:
Public Key Locally Decodable Codes with Short Keys. APPROX-RANDOM 2011: 605-615 - [c125]Brett Hemenway, Benoît Libert, Rafail Ostrovsky, Damien Vergnaud:
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security. ASIACRYPT 2011: 70-88 - [c124]Juan A. Garay, Clint Givens, Rafail Ostrovsky:
Secure Message Transmission by Public Discussion: A Brief Survey. IWCC 2011: 126-141 - [c123]Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. CRYPTO 2011: 429-446 - [c122]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, Jürg Wullschleger:
Constant-Rate Oblivious Transfer from Noisy Channels. CRYPTO 2011: 667-684 - [c121]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai:
Efficient Non-interactive Secure Computation. EUROCRYPT 2011: 406-425 - [c120]Vladimir Braverman, Adam Meyerson, Rafail Ostrovsky, Alan Roytman, Michael Shindler, Brian Tagiku:
Streaming k-means on Well-Clusterable Data. SODA 2011: 26-40 - [c119]Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky:
Deterministic and Energy-Optimal Wireless Synchronization. DISC 2011: 237-251 - 2010
- [c118]Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Password-Authenticated Session-Key Generation on the Internet in the Plain Model. CRYPTO 2010: 277-294 - [c117]Chongwon Cho, Chen-Kuei Lee, Rafail Ostrovsky:
Equivalence of Uniform Key Agreement and Composition Insecurity. CRYPTO 2010: 447-464 - [c116]Juan A. Garay, Clint Givens, Rafail Ostrovsky:
Secure Message Transmission with Small Public Discussion. EUROCRYPT 2010: 177-196 - [c115]Paul Bunn, Rafail Ostrovsky:
Asynchronous Throughput-Optimal Routing in Malicious Networks. ICALP (2) 2010: 236-248 - [c114]Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky:
Improved Fault Tolerance and Secure Computation on Sparse Networks. ICALP (2) 2010: 249-260 - [c113]Nishanth Chandran, Rafail Ostrovsky, William E. Skeith III:
Public-Key Encryption with Efficient Amortized Updates. SCN 2010: 17-35 - [c112]Vladimir Braverman, Kai-Min Chung, Zhenming Liu, Michael Mitzenmacher, Rafail Ostrovsky:
AMS Without 4-Wise Independence on Product Domains. STACS 2010: 119-130 - [c111]Vladimir Braverman, Rafail Ostrovsky:
Measuring independence of datasets. STOC 2010: 271-280 - [c110]Vladimir Braverman, Rafail Ostrovsky:
Zero-one frequency laws. STOC 2010: 281-290 - [c109]Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky, Leonid Reyzin:
Privacy amplification with asymptotically optimal entropy loss. STOC 2010: 785-794 - [c108]S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostrovsky, Amit Sahai:
On Complete Primitives for Fairness. TCC 2010: 91-108 - [c107]Rafail Ostrovsky, Omkant Pandey, Ivan Visconti:
Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge. TCC 2010: 535-552 - 2009
- [c106]Milan Bradonjic, Eddie Kohler, Rafail Ostrovsky:
Near-Optimal Radio Use for Wireless Network Synchronization. ALGOSENSORS 2009: 15-28 - [c105]Nishanth Chandran, Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky:
Position Based Cryptography. CRYPTO 2009: 391-407 - [c104]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Extracting Correlations. FOCS 2009: 261-270 - [c103]Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo:
Optimal sampling from sliding windows. PODS 2009: 147-156 - [c102]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Simulation-Based Concurrent Non-malleable Commitments and Decommitments. TCC 2009: 91-108 - [c101]Yair Amir, Paul Bunn, Rafail Ostrovsky:
Authenticated Adversarial Routing. TCC 2009: 163-182 - 2008
- [c100]Steve Lu, Daniel Manchala, Rafail Ostrovsky:
Visual Cryptography on Graphs. COCOON 2008: 225-234 - [c99]Dan Boneh, Shai Halevi, Michael Hamburg, Rafail Ostrovsky:
Circular-Secure Encryption from Decision Diffie-Hellman. CRYPTO 2008: 108-125 - [c98]Brett Hemenway, Rafail Ostrovsky:
Public-Key Locally-Decodable Codes. CRYPTO 2008: 126-143 - [c97]Rafail Ostrovsky, William E. Skeith III:
Communication Complexity in Algebraic Two-Party Protocols. CRYPTO 2008: 379-396 - [c96]Juan A. Garay, Rafail Ostrovsky:
Almost-Everywhere Secure Computation. EUROCRYPT 2008: 307-323 - [c95]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model. ICALP (2) 2008: 548-559 - [c94]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography with constant computational overhead. STOC 2008: 433-442 - 2007
- [c93]Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky, Amit Sahai:
Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions. ASIACRYPT 2007: 444-459 - [c92]Rafail Ostrovsky, Amit Sahai, Brent Waters:
Attribute-based encryption with non-monotonic access structures. CCS 2007: 195-203 - [c91]Paul Bunn, Rafail Ostrovsky:
Secure two-party k-means clustering. CCS 2007: 486-497 - [c90]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky:
Efficient Arguments without Short PCPs. CCC 2007: 278-291 - [c89]Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III:
Public Key Encryption That Allows PIR Queries. CRYPTO 2007: 50-67 - [c88]Jens Groth, Rafail Ostrovsky:
Cryptography in the Multi-string Model. CRYPTO 2007: 323-341 - [c87]Nishanth Chandran, Vipul Goyal, Rafail Ostrovsky, Amit Sahai:
Covert Multi-Party Computation. FOCS 2007: 238-248 - [c86]Vladimir Braverman, Rafail Ostrovsky:
Smooth Histograms for Sliding Windows. FOCS 2007: 283-293 - [c85]Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafail Ostrovsky:
Round Complexity of Authenticated Broadcast with a Dishonest Majority. FOCS 2007: 658-668 - [c84]Rafail Ostrovsky, Omkant Pandey, Amit Sahai:
Private Locally Decodable Codes. ICALP 2007: 387-398 - [c83]Rafail Ostrovsky, William E. Skeith III:
A Survey of Single-Database Private Information Retrieval: Techniques and Applications. Public Key Cryptography 2007: 393-411 - [c82]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Zero-knowledge from secure multiparty computation. STOC 2007: 21-30 - 2006
- [c81]Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail Ostrovsky:
Searchable symmetric encryption: improved definitions and efficient constructions. CCS 2006: 79-88 - [c80]Jens Groth, Rafail Ostrovsky, Amit Sahai:
Non-interactive Zaps and New Techniques for NIZK. CRYPTO 2006: 97-111 - [c79]Jens Groth, Rafail Ostrovsky, Amit Sahai:
Perfect Non-interactive Zero Knowledge for NP. EUROCRYPT 2006: 339-358 - [c78]Steve Lu, Rafail Ostrovsky, Amit Sahai, Hovav Shacham, Brent Waters:
Sequential Aggregate Signatures and Multisignatures Without Random Oracles. EUROCRYPT 2006: 465-485 - [c77]Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy:
The Effectiveness of Lloyd-Type Methods for the k-Means Problem. FOCS 2006: 165-176 - [c76]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography from Anonymity. FOCS 2006: 239-248 - 2005
- [c75]Rafail Ostrovsky, William E. Skeith III:
Private Searching on Streaming Data. CRYPTO 2005: 223-240 - [c74]Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam D. Smith:
Secure Remote Authentication Using Biometric Data. EUROCRYPT 2005: 147-163 - [c73]Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman:
Error-Correcting Codes for Automatic Control. FOCS 2005: 309-316 - [c72]Rafail Ostrovsky, Yuval Rabani:
Low distortion embeddings for edit distance. STOC 2005: 218-224 - [c71]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky:
Sufficient Conditions for Collision-Resistant Hashing. TCC 2005: 445-456 - 2004
- [c70]Jonathan Katz, Rafail Ostrovsky:
Round-Optimal Secure Two-Party Computation. CRYPTO 2004: 335-354 - [c69]Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano:
Public Key Encryption with Keyword Search. EUROCRYPT 2004: 506-522 - [c68]Rafail Ostrovsky, Charles Rackoff, Adam D. Smith:
Efficient Consistency Proofs for Generalized Queries on a Committed Database. ICALP 2004: 1041-1053 - [c67]Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin:
Identity-Based Zero Knowledge. SCN 2004: 180-192 - [c66]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Batch codes and their applications. STOC 2004: 262-271 - 2003
- [c65]Jonathan Katz, Rafail Ostrovsky, Adam D. Smith:
Round Efficiency of Multi-party Computation with a Dishonest Majority. EUROCRYPT 2003: 578-595 - [c64]William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén:
Dynamic routing on networks with fixed-size buffers. SODA 2003: 771-780 - 2002
- [c63]Jonathan Katz, Rafail Ostrovsky, Moti Yung:
Forward Secrecy in Password-Only Key Exchange Protocols. SCN 2002: 29-44 - [c62]Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai:
Universally composable two-party and multi-party secure computation. STOC 2002: 494-503 - 2001
- [c61]Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky:
Minimal Complete Primitives for Secure Multi-party Computation. CRYPTO 2001: 80-100 - [c60]Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, Amit Sahai:
Robust Non-interactive Zero Knowledge. CRYPTO 2001: 566-598 - [c59]Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam D. Smith:
Efficient and Non-interactive Non-malleable Commitment. EUROCRYPT 2001: 40-59 - [c58]Jonathan Katz, Steven A. Myers, Rafail Ostrovsky:
Cryptographic Counters and Applications to Electronic Voting. EUROCRYPT 2001: 78-92 - [c57]Jonathan Katz, Rafail Ostrovsky, Moti Yung:
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. EUROCRYPT 2001: 475-494 - [c56]Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani:
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. FOCS 2001: 348-356 - [c55]Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Stability preserving transformations: packet routing networks with edge capacities and speeds. SODA 2001: 601-610 - 2000
- [c54]Eyal Kushilevitz, Rafail Ostrovsky:
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval. EUROCRYPT 2000: 104-121 - [c53]Giovanni Di Crescenzo, Tal Malkin, Rafail Ostrovsky:
Single Database Private Information Retrieval Implies Oblivious Transfer. EUROCRYPT 2000: 122-138 - [c52]Rafail Ostrovsky, Yuval Rabani:
Polynomial Time Approximation Schemes for Geometric k-Clustering. FOCS 2000: 349-358 - [c51]William Aiello, Sandeep N. Bhatt, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan:
Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP. ICALP 2000: 463-474 - 1999
- [c50]Giovanni Di Crescenzo, Rafail Ostrovsky:
On Concurrent Zero-Knowledge with Pre-processing. CRYPTO 1999: 485-502 - [c49]Giovanni Di Crescenzo, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan:
Conditional Oblivious Transfer and Timed-Release Encryption. EUROCRYPT 1999: 74-89 - [c48]Rafail Ostrovsky, Boaz Patt-Shamir:
Optimal and Efficient Clock Synchronization Under Drifting Clocks. PODC 1999: 3-12 - [c47]Ran Canetti, Rafail Ostrovsky:
Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract). STOC 1999: 255-264 - [c46]Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems. STOC 1999: 312-321 - [c45]Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. STOC 1999: 435-444 - 1998
- [c44]William Aiello, Sachin Lodha, Rafail Ostrovsky:
Fast Digital Identity Revocation (Extended Abstract). CRYPTO 1998: 137-152 - [c43]Richard J. Lipton, Rafail Ostrovsky:
Micropayments via Efficient Coin-Flipping. Financial Cryptography 1998: 1-15 - [c42]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Amortizing Randomness in Private Multiparty Computations. PODC 1998: 81-90 - [c41]Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky:
Universal Service-Providers for Database Private Information Retrieval (Extended Abstract). PODC 1998: 91-100 - [c40]Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky:
Non-Interactive and Non-Malleable Commitment. STOC 1998: 141-150 - [c39]William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Adaptive Packet Routing for Bursty Adversarial Traffic. STOC 1998: 359-368 - [c38]Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani:
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. STOC 1998: 614-623 - 1997
- [c37]Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky:
Deniable Encryption. CRYPTO 1997: 90-104 - [c36]Ari Juels, Michael Luby, Rafail Ostrovsky:
Security of Blind Digital Signatures (Extended Abstract). CRYPTO 1997: 150-164 - [c35]Shlomi Dolev, Rafail Ostrovsky:
Efficient Anonymous Multicast and Reception (Extended Abstract). CRYPTO 1997: 395-409 - [c34]Eyal Kushilevitz, Rafail Ostrovsky:
Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. FOCS 1997: 364-373 - [c33]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness vs. Fault-Tolerance. PODC 1997: 35-44 - [c32]Rafail Ostrovsky, Victor Shoup:
Private Information Storage (Extended Abstract). STOC 1997: 294-303 - [c31]Rafail Ostrovsky, Yuval Rabani:
Universal O(Congestion + Dilation + log1+epsilonN) Local Control Packet Switching Algorithms. STOC 1997: 644-653 - 1996
- [c30]Alain J. Mayer, Rafail Ostrovsky, Moti Yung:
Self-Stabilizing Algorithms for Synchronous Unidirectional Rings. SODA 1996: 564-573 - [c29]Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky:
The Linear-Array Conjecture in Communication Complexity is False. STOC 1996: 1-10 - [c28]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Characterizing Linear Size Circuits in Terms of Privacy. STOC 1996: 541-550 - 1995
- [c27]Rafail Ostrovsky, Daniel Shawcross Wilkerson:
Faster Computation On Directed Networks of Automata (Extended Abstract). PODC 1995: 38-46 - [c26]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Log-Space Polynomial End-to-End Communication (Abstract). PODC 1995: 254 - [c25]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Log-space polynomial end-to-end communication. STOC 1995: 559-568 - 1994
- [c24]Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky:
Reducibility and Completeness in Multi-Party Private Computations. FOCS 1994: 478-489 - [c23]Baruch Awerbuch, Rafail Ostrovsky:
Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract). PODC 1994: 254-263 - [c22]Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky:
Matching Nuts and Bolts. SODA 1994: 690-696 - [c21]Rafail Ostrovsky, Sridhar Rajagopalan, Umesh V. Vazirani:
Simple and efficient leader election in the full information model. STOC 1994: 234-242 - [c20]Oded Goldreich, Rafail Ostrovsky, Erez Petrank:
Computational complexity and knowledge complexity (extended abstract). STOC 1994: 534-543 - 1993
- [c19]Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung:
Interactive Hashing Simplifies Zero-Knowledge Protocol Design. EUROCRYPT 1993: 267-273 - [c18]Rafail Ostrovsky, Avi Wigderson:
One-Way Fuctions are Essential for Non-Trivial Zero-Knowledge. ISTCS 1993: 3-17 - [c17]Shay Kutten, Rafail Ostrovsky, Boaz Patt-Shamir:
The Las-Vegas Processor Identity Problem (How and When to Be Unique). ISTCS 1993: 150-159 - 1992
- [c16]Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung:
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract). CRYPTO 1992: 196-214 - [c15]Shafi Goldwasser, Rafail Ostrovsky:
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract). CRYPTO 1992: 228-245 - [c14]Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung:
Secure Commitment Against A Powerful Adversary. STACS 1992: 439-448 - [c13]Alain J. Mayer, Yoram Ofek, Rafail Ostrovsky, Moti Yung:
Self-Stabilizing Symmetry Breaking in Constant-Space (Extended Abstract). STOC 1992: 667-678 - 1991
- [c12]Joan Feigenbaum, Rafail Ostrovsky:
A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems. ASIACRYPT 1991: 352-359 - [c11]Rafail Ostrovsky:
One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs. SCT 1991: 133-138 - [c10]Rafail Ostrovsky, Moti Yung:
How to Withstand Mobile Virus Attacks (Extended Abstract). PODC 1991: 51-59 - 1990
- [c9]Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung:
Fair Games against an All-Powerful Adversary. Advances In Computational Complexity Theory 1990: 155-169 - [c8]Mihir Bellare, Silvio Micali, Rafail Ostrovsky:
Perfect Zero-Knowledge in Constant Rounds. STOC 1990: 482-493 - [c7]Mihir Bellare, Silvio Micali, Rafail Ostrovsky:
The (True) Complexity of Statistical Zero Knowledge. STOC 1990: 494-502 - [c6]Rafail Ostrovsky:
Efficient Computation on Oblivious RAMs. STOC 1990: 514-523 - 1989
- [c5]Joe Kilian, Silvio Micali, Rafail Ostrovsky:
Minimum Resource Zero-Knowledge Proofs (Extended Abstract). CRYPTO 1989: 545-546 - [c4]Rafail Ostrovsky:
An Efficient Software Protection Scheme. CRYPTO 1989: 610-611 - [c3]Rafail Ostrovsky, Moti Yung:
On Necessary Conditions for Secure Distributed Computation. Distributed Computing And Cryptography 1989: 229-234 - [c2]Joe Kilian, Silvio Micali, Rafail Ostrovsky:
Minimum Resource Zero-Knowledge Proofs (Extended Abstract). FOCS 1989: 474-479 - 1986
- [c1]Rafail Ostrovsky:
HOLMES-I, a prolog-based reason maintenance system for collecting information from multiple experts. IPMU 1986: 329-336
Editorship
- 2011
- [e3]Rafail Ostrovsky:
IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011. IEEE Computer Society 2011, ISBN 978-1-4577-1843-4 [contents] - 2008
- [e2]Rafail Ostrovsky, Roberto De Prisco, Ivan Visconti:
Security and Cryptography for Networks, 6th International Conference, SCN 2008, Amalfi, Italy, September 10-12, 2008. Proceedings. Lecture Notes in Computer Science 5229, Springer 2008, ISBN 978-3-540-85854-6 [contents] - 2006
- [e1]Shlomi Dolev, Rafail Ostrovsky, Andreas Pfitzmann:
Anonymous Communication and its Applications, 09.10. - 14.10.2005. Dagstuhl Seminar Proceedings 05411, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents]
Informal and Other Publications
- 2024
- [i188]Daniel Noble, Brett Hemenway, Rafail Ostrovsky:
MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier. Electron. Colloquium Comput. Complex. TR24: TR24-005 (2024) - [i187]Daniel Noble, Brett Hemenway Falk, Rafail Ostrovsky:
MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier. IACR Cryptol. ePrint Arch. 2024: 11 (2024) - 2023
- [i186]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Tri-State Circuits: A Circuit Model that Captures RAM. Electron. Colloquium Comput. Complex. TR23 (2023) - [i185]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Tri-State Circuits: A Better Model of Computation for Garbling. IACR Cryptol. ePrint Arch. 2023: 455 (2023) - [i184]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky, Matan Shtepel, Jacob Zhang:
DORAM revisited: Maliciously secure RAM-MPC with logarithmic overhead. IACR Cryptol. ePrint Arch. 2023: 578 (2023) - [i183]Vipul Goyal, Chen-Da Liu-Zhang, Rafail Ostrovsky:
Asymmetric Multi-Party Computation. IACR Cryptol. ePrint Arch. 2023: 704 (2023) - [i182]Wutichai Chongchitmate, Yuval Ishai, Steve Lu, Rafail Ostrovsky:
PSI from ring-OLE. IACR Cryptol. ePrint Arch. 2023: 745 (2023) - [i181]Samuel Dittmer, Karim Eldefrawy, Stéphane Graham-Lengrand, Steve Lu, Rafail Ostrovsky, Vitor Pereira:
Boosting the Performance of High-Assurance Cryptography: Parallel Execution and Optimizing Memory Access in Formally-Verified Line-Point Zero-Knowledge. IACR Cryptol. ePrint Arch. 2023: 1322 (2023) - [i180]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing. IACR Cryptol. ePrint Arch. 2023: 1512 (2023) - [i179]Cruz Barnum, David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Adaptive Garbled Circuits and Garbled RAM from Non-Programmable Random Oracles. IACR Cryptol. ePrint Arch. 2023: 1527 (2023) - [i178]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner:
Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions. IACR Cryptol. ePrint Arch. 2023: 1742 (2023) - [i177]Brett Hemenway Falk, Rafail Ostrovsky, Matan Shtepel, Jacob Zhang:
GigaDORAM: Breaking the Billion Address Barrier. IACR Cryptol. ePrint Arch. 2023: 1950 (2023) - 2022
- [i176]Brett Hemenway Falk, Rohit Nema, Rafail Ostrovsky:
A Linear-Time 2-Party Secure Merge Protocol. IACR Cryptol. ePrint Arch. 2022: 380 (2022) - [i175]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky:
Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One. IACR Cryptol. ePrint Arch. 2022: 552 (2022) - [i174]Mark Blunk, Paul Bunn, Samuel Dittmer, Steve Lu, Rafail Ostrovsky:
Secure Merge in Linear Time and O(log log N) Rounds. IACR Cryptol. ePrint Arch. 2022: 590 (2022) - [i173]Abida Haque, David Heath, Vladimir Kolesnikov, Steve Lu, Rafail Ostrovsky, Akash Shah:
Garbled Circuits With Sublinear Evaluator. IACR Cryptol. ePrint Arch. 2022: 797 (2022) - [i172]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky:
Authenticated Garbling from Simple Correlations. IACR Cryptol. ePrint Arch. 2022: 836 (2022) - [i171]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
Anonymous Permutation Routing. IACR Cryptol. ePrint Arch. 2022: 1353 (2022) - 2021
- [i170]Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat:
A Refined Approximation for Euclidean k-Means. CoRR abs/2107.07358 (2021) - [i169]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
CNF-FSS and its Applications. IACR Cryptol. ePrint Arch. 2021: 163 (2021) - [i168]Michele Ciampi, Vipul Goyal, Rafail Ostrovsky:
Threshold Garbled Circuits and Ad Hoc Secure Computation. IACR Cryptol. ePrint Arch. 2021: 308 (2021) - [i167]Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky, Antigoni Polychroniadou:
Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares. IACR Cryptol. ePrint Arch. 2021: 576 (2021) - [i166]Michele Ciampi, Muhammad Ishaq, Malik Magdon-Ismail, Rafail Ostrovsky, Vassilis Zikas:
FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker. IACR Cryptol. ePrint Arch. 2021: 609 (2021) - [i165]Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, Yifan Song:
ATLAS: Efficient and Scalable MPC in the Honest Majority Setting. IACR Cryptol. ePrint Arch. 2021: 833 (2021) - [i164]Nicholas Franzese, Jonathan Katz, Steve Lu, Rafail Ostrovsky, Xiao Wang, Chenkai Weng:
Constant-Overhead Zero-Knowledge for RAM Programs. IACR Cryptol. ePrint Arch. 2021: 979 (2021) - [i163]Nishanth Chandran, Pouyan Forghani, Juan A. Garay, Rafail Ostrovsky, Rutvik Patel, Vassilis Zikas:
Universally Composable Almost-Everywhere Secure Computation. IACR Cryptol. ePrint Arch. 2021: 1398 (2021) - [i162]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds. IACR Cryptol. ePrint Arch. 2021: 1433 (2021) - [i161]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
3-Party Distributed ORAM from Oblivious Set Membership. IACR Cryptol. ePrint Arch. 2021: 1463 (2021) - [i160]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Practical Garbled RAM: GRAM with O(log2 n) Overhead. IACR Cryptol. ePrint Arch. 2021: 1519 (2021) - 2020
- [i159]Shaan Mathur, Rafail Ostrovsky:
A Combinatorial Characterization of Self-Stabilizing Population Protocols. CoRR abs/2010.03869 (2020) - [i158]Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani:
Min-Sum Clustering (with Outliers). CoRR abs/2011.12169 (2020) - [i157]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky, Mohamed Elsabagh, Nikolaos Kiourtis, Brian Schulte, Angelos Stavrou:
Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing. CoRR abs/2012.13053 (2020) - [i156]Samuel Dittmer, Rafail Ostrovsky:
Oblivious tight compaction in O(n) time with smaller constant. IACR Cryptol. ePrint Arch. 2020: 377 (2020) - [i155]Leonard Kleinrock, Rafail Ostrovsky, Vassilis Zikas:
A PoR/PoS-Hybrid Blockchain: Proof of Reputation with Nakamoto Fallback. IACR Cryptol. ePrint Arch. 2020: 381 (2020) - [i154]Karim Eldefrawy, Seoyeon Hwang, Rafail Ostrovsky, Moti Yung:
Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups. IACR Cryptol. ePrint Arch. 2020: 747 (2020) - [i153]Brett Hemenway Falk, Rafail Ostrovsky:
Secure merge with O(n log log n) secure operation. IACR Cryptol. ePrint Arch. 2020: 807 (2020) - [i152]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
Alibi: A Flaw in Cuckoo-Hashing based Hierarchical ORAM Schemes and a Solution. IACR Cryptol. ePrint Arch. 2020: 997 (2020) - [i151]Ohad Barta, Yuval Ishai, Rafail Ostrovsky, David J. Wu:
On Succinct Arguments and Witness Encryption from Groups. IACR Cryptol. ePrint Arch. 2020: 1319 (2020) - [i150]Michele Ciampi, Rafail Ostrovsky, Hendrik Waldner, Vassilis Zikas:
Round-Optimal and Communication-Efficient Multiparty Computation. IACR Cryptol. ePrint Arch. 2020: 1437 (2020) - [i149]Samuel Dittmer, Yuval Ishai, Rafail Ostrovsky:
Line-Point Zero Knowledge and Its Applications. IACR Cryptol. ePrint Arch. 2020: 1446 (2020) - [i148]Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky, Mohamed Elsabagh, Nikolaos Kiourtis, Brian Schulte, Angelos Stavrou:
Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing. IACR Cryptol. ePrint Arch. 2020: 1599 (2020) - 2019
- [i147]Michele Ciampi, Rafail Ostrovsky:
Four-Round Secure Multiparty Computation from General Assumptions. IACR Cryptol. ePrint Arch. 2019: 214 (2019) - [i146]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
On Round Optimal Secure Multiparty Computation from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2019: 216 (2019) - [i145]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptographic Sensing. IACR Cryptol. ePrint Arch. 2019: 637 (2019) - [i144]Nico Döttling, Sanjam Garg, Yuval Ishai, Giulio Malavolta, Tamer Mour, Rafail Ostrovsky:
Trapdoor Hash Functions and Their Applications. IACR Cryptol. ePrint Arch. 2019: 639 (2019) - [i143]Sanjam Garg, Mohammad Hajiabadi, Rafail Ostrovsky:
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More. IACR Cryptol. ePrint Arch. 2019: 990 (2019) - [i142]Juan A. Garay, Aggelos Kiayias, Rafail Ostrovsky, Giorgos Panagiotakos, Vassilis Zikas:
Resource-Restricted Cryptography: Honest-Majority MPC from a CRS (and No Broadcast). IACR Cryptol. ePrint Arch. 2019: 1264 (2019) - 2018
- [i141]Shafi Goldwasser, Rafail Ostrovsky, Alessandra Scafuro, Adam Sealfon:
Population stability: regulating size in the presence of an adversary. CoRR abs/1803.02540 (2018) - [i140]Yuval Ishai, Manika Mittal, Rafail Ostrovsky:
On the Message Complexity of Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2018: 38 (2018) - [i139]Brett Hemenway Falk, Daniel Noble, Rafail Ostrovsky:
Private Set Intersection with Linear Communication from General Assumptions. IACR Cryptol. ePrint Arch. 2018: 238 (2018) - [i138]Ariel Hamlin, Rafail Ostrovsky, Mor Weiss, Daniel Wichs:
Private Anonymous Data Access. IACR Cryptol. ePrint Arch. 2018: 363 (2018) - [i137]Rafail Ostrovsky, Giuseppe Persiano, Daniele Venturi, Ivan Visconti:
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2018: 542 (2018) - [i136]Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan:
Adaptive Garbled RAM from Laconic Oblivious Transfer. IACR Cryptol. ePrint Arch. 2018: 549 (2018) - [i135]Paul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky:
Efficient 3-Party Distributed ORAM. IACR Cryptol. ePrint Arch. 2018: 706 (2018) - [i134]Wutichai Chongchitmate, Rafail Ostrovsky:
Information-Theoretic Broadcast with Dishonest Majority for Long Messages. IACR Cryptol. ePrint Arch. 2018: 829 (2018) - [i133]Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan:
Round Optimal Black-Box “Commit-and-Prove”. IACR Cryptol. ePrint Arch. 2018: 921 (2018) - [i132]Melissa Chase, Yevgeniy Dodis, Yuval Ishai, Daniel Kraschewski, Tianren Liu, Rafail Ostrovsky, Vinod Vaikuntanathan:
Reusable Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2018: 940 (2018) - [i131]Saikrishna Badrinarayanan, Abhishek Jain, Rafail Ostrovsky, Ivan Visconti:
Non-Interactive Secure Computation from One-Way Functions. IACR Cryptol. ePrint Arch. 2018: 1020 (2018) - 2017
- [i130]Rafail Ostrovsky, Yuval Rabani, Arman Yousefi:
Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration. CoRR abs/1704.07406 (2017) - [i129]Wutichai Chongchitmate, Rafail Ostrovsky:
Circuit-Private Multi-Key FHE. IACR Cryptol. ePrint Arch. 2017: 10 (2017) - [i128]Juan A. Garay, Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas:
The Price of Low Communication in Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2017: 520 (2017) - [i127]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. IACR Cryptol. ePrint Arch. 2017: 920 (2017) - [i126]Wutichai Chongchitmate, Rafail Ostrovsky, Ivan Visconti:
Resettably-Sound Resettable Zero Knowledge in Constant Rounds. IACR Cryptol. ePrint Arch. 2017: 925 (2017) - [i125]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. IACR Cryptol. ePrint Arch. 2017: 931 (2017) - [i124]Nishanth Chandran, Wutichai Chongchitmate, Rafail Ostrovsky, Ivan Visconti:
Universally Composable Secure Two and Multi-party Computation in the Corruptible Tamper-Proof Hardware Token Model. IACR Cryptol. ePrint Arch. 2017: 1092 (2017) - 2016
- [i123]Mor Baruch, Rafail Ostrovsky, Will Rosenbaum:
Space-Time Tradeoffs for Distributed Verification. CoRR abs/1605.06814 (2016) - [i122]Rafail Ostrovsky, Yuval Rabani, Arman Yousefi:
Matrix Balancing in Lp Norms: A New Analysis of Osborne's Iteration. CoRR abs/1606.08083 (2016) - [i121]Brett Hemenway, Steve Lu, Rafail Ostrovsky, William Welser IV:
High-precision Secure Computation of Satellite Collision Probabilities. IACR Cryptol. ePrint Arch. 2016: 319 (2016) - [i120]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
Concurrent Non-Malleable Commitments (and More) in 3 Rounds. IACR Cryptol. ePrint Arch. 2016: 566 (2016) - [i119]Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti:
On Round-Efficient Non-Malleable Protocols. IACR Cryptol. ePrint Arch. 2016: 621 (2016) - [i118]Saikrishna Badrinarayanan, Dakshita Khurana, Rafail Ostrovsky, Ivan Visconti:
New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs. IACR Cryptol. ePrint Arch. 2016: 636 (2016) - [i117]Brett Hemenway, Rafail Ostrovsky:
Efficient Robust Secret Sharing from Expander Graphs. IACR Cryptol. ePrint Arch. 2016: 735 (2016) - 2015
- [i116]David Felber, Rafail Ostrovsky:
Variability in data streams. CoRR abs/1502.07027 (2015) - [i115]David Felber, Rafail Ostrovsky:
A randomized online quantile summary in O(1/ɛ log 1/ɛ) words. CoRR abs/1503.01156 (2015) - [i114]Vladimir Braverman, Rafail Ostrovsky, Gregory Vorsanger:
Weighted Sampling Without Replacement from Data Streams. CoRR abs/1506.01747 (2015) - [i113]Mark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky:
Coding for interactive communication correcting insertions and deletions. CoRR abs/1508.00514 (2015) - [i112]Sanjam Garg, Steve Lu, Rafail Ostrovsky:
Black-Box Garbled RAM. Electron. Colloquium Comput. Complex. TR15 (2015) - [i111]Brett Hemenway, Rafail Ostrovsky, Alon Rosen:
Non-committing encryption from Φ-hiding. IACR Cryptol. ePrint Arch. 2015: 54 (2015) - [i110]Brett Hemenway, Rafail Ostrovsky:
Building Lossy Trapdoor Functions from Lossy Encryption. IACR Cryptol. ePrint Arch. 2015: 156 (2015) - [i109]Joshua Baron, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky:
Communication-Optimal Proactive Secret Sharing for Dynamic Groups. IACR Cryptol. ePrint Arch. 2015: 304 (2015) - [i108]Sanjam Garg, Steve Lu, Rafail Ostrovsky:
Black-Box Garbled RAM. IACR Cryptol. ePrint Arch. 2015: 307 (2015) - [i107]Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas:
Secure Multi-Party Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2015: 325 (2015) - [i106]Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro:
Round-Optimal Black-Box Two-Party Computation. IACR Cryptol. ePrint Arch. 2015: 553 (2015) - [i105]Richard J. Lipton, Rafail Ostrovsky, Vassilis Zikas:
Provable Virus Detection: Using the Uncertainty Principle to Protect Against Malware. IACR Cryptol. ePrint Arch. 2015: 728 (2015) - [i104]Steve Lu, Rafail Ostrovsky:
Black-Box Parallel Garbled RAM. IACR Cryptol. ePrint Arch. 2015: 1068 (2015) - [i103]Yuval Ishai, Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky:
Private Large-Scale Databases with Distributed Searchable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2015: 1190 (2015) - [i102]Brett Hemenway, Zahra Jafargholi, Rafail Ostrovsky, Alessandra Scafuro, Daniel Wichs:
Adaptively Secure Garbled Circuits from One-Way Functions. IACR Cryptol. ePrint Arch. 2015: 1250 (2015) - 2014
- [i101]Arman Yousefi, Rafail Ostrovsky:
Improved Approximation Algorithms for Earth-Mover Distance in Data Streams. CoRR abs/1404.6287 (2014) - [i100]Yannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum:
A Stable Marriage Requires Communication. CoRR abs/1405.7709 (2014) - [i99]Vladimir Braverman, Rafail Ostrovsky, Alan Roytman:
Universal Streaming. CoRR abs/1408.2604 (2014) - [i98]Rafail Ostrovsky, Will Rosenbaum:
Fast distributed almost stable marriages. CoRR abs/1408.2782 (2014) - [i97]Rafail Ostrovsky, Will Rosenbaum:
It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems. CoRR abs/1412.1130 (2014) - [i96]Steve Lu, Rafail Ostrovsky:
Garbled RAM Revisited, Part II. IACR Cryptol. ePrint Arch. 2014: 83 (2014) - [i95]Claudio Orlandi, Rafail Ostrovsky, Vanishree Rao, Amit Sahai, Ivan Visconti:
Statistical Concurrent Non-Malleable Zero Knowledge. IACR Cryptol. ePrint Arch. 2014: 143 (2014) - [i94]Rafail Ostrovsky, Anat Paskin-Cherniavsky:
Locally Decodable Codes for edit distance. IACR Cryptol. ePrint Arch. 2014: 260 (2014) - [i93]Rafail Ostrovsky, Alessandra Scafuro, Muthuramakrishnan Venkitasubramaniam:
Resettably Sound Zero-Knoweldge Arguments from OWFs - the (semi) Black-Box way. IACR Cryptol. ePrint Arch. 2014: 284 (2014) - [i92]Vipul Goyal, Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti:
Black-Box Non-Black-Box Zero Knowledge. IACR Cryptol. ePrint Arch. 2014: 390 (2014) - [i91]Nishanth Chandran, Wutichai Chongchitmate, Juan A. Garay, Shafi Goldwasser, Rafail Ostrovsky, Vassilis Zikas:
Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality. IACR Cryptol. ePrint Arch. 2014: 615 (2014) - [i90]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Impossibility Results for Leakage-Resilient Zero Knowledge and Multi-Party Computation. IACR Cryptol. ePrint Arch. 2014: 865 (2014) - [i89]Sanjam Garg, Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography with One-Way Communication. IACR Cryptol. ePrint Arch. 2014: 914 (2014) - [i88]Sanjam Garg, Steve Lu, Rafail Ostrovsky, Alessandra Scafuro:
Garbled RAM From One-Way Functions. IACR Cryptol. ePrint Arch. 2014: 941 (2014) - 2013
- [i87]Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik:
How Hard is Counting Triangles in the Streaming Model. CoRR abs/1304.1458 (2013) - [i86]Paul Bunn, Rafail Ostrovsky:
Secure End-to-End Communication with Optimal Throughput in Unreliable Networks. CoRR abs/1304.2454 (2013) - [i85]Brett Hemenway, Rafail Ostrovsky, Mary Wootters:
Local Correctability of Expander Codes. CoRR abs/1304.8129 (2013) - [i84]Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman:
Robust Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR13 (2013) - [i83]Rafail Ostrovsky, Anat Paskin-Cherniavsky, Beni Paskin-Cherniavsky:
Maliciously Circuit-private FHE. IACR Cryptol. ePrint Arch. 2013: 307 (2013) - [i82]Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky:
Locally Updatable and Locally Decodable Codes. IACR Cryptol. ePrint Arch. 2013: 520 (2013) - [i81]Joshua Baron, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky:
How to Withstand Mobile Virus Attacks, Revisited. IACR Cryptol. ePrint Arch. 2013: 529 (2013) - [i80]Joshua Lampkins, Rafail Ostrovsky:
Communication-Efficient MPC for General Adversary Structures. IACR Cryptol. ePrint Arch. 2013: 640 (2013) - [i79]Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman:
Robust Pseudorandom Generators. IACR Cryptol. ePrint Arch. 2013: 671 (2013) - 2012
- [i78]Vladimir Braverman, Rafail Ostrovsky:
Approximating Large Frequency Moments with Pick-and-Drop Sampling. CoRR abs/1212.0202 (2012) - [i77]Matthew K. Franklin, Ran Gelles, Rafail Ostrovsky, Leonard J. Schulman:
Optimal Coding for Streaming Authentication and Interactive Communication. Electron. Colloquium Comput. Complex. TR12 (2012) - [i76]Rafail Ostrovsky, Ivan Visconti:
Simultaneous Resettability from Collision Resistance. Electron. Colloquium Comput. Complex. TR12 (2012) - [i75]Juan A. Garay, Clint Givens, Rafail Ostrovsky:
Broadcast-Efficient Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2012: 130 (2012) - [i74]Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti, Akshay Wadia:
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions. IACR Cryptol. ePrint Arch. 2012: 143 (2012) - [i73]Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky:
Almost-Everywhere Secure Computation with Edge Corruptions. IACR Cryptol. ePrint Arch. 2012: 221 (2012) - [i72]Abhishek Jain, Rafail Ostrovsky, Silas Richelson, Ivan Visconti:
Concurrent Zero Knowledge in the Bounded Player Model. IACR Cryptol. ePrint Arch. 2012: 279 (2012) - [i71]Ran Gelles, Rafail Ostrovsky, Kina Winoto:
Multiparty Proximity Testing with Dishonest Majority from Equality Testing. IACR Cryptol. ePrint Arch. 2012: 378 (2012) - [i70]Sanjam Garg, Abishek Kumarasubramanian, Rafail Ostrovsky, Ivan Visconti:
Impossibility Results for Static Input Secure Computation. IACR Cryptol. ePrint Arch. 2012: 433 (2012) - [i69]Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky, Leonid Reyzin:
Privacy Amplification with Asymptotically Optimal Entropy Loss. IACR Cryptol. ePrint Arch. 2012: 501 (2012) - [i68]Steve Lu, Rafail Ostrovsky:
How to Garble RAM Programs. IACR Cryptol. ePrint Arch. 2012: 601 (2012) - [i67]Abishek Kumarasubramanian, Rafail Ostrovsky, Omkant Pandey, Akshay Wadia:
Cryptography Using CAPTCHA Puzzles. IACR Cryptol. ePrint Arch. 2012: 689 (2012) - [i66]Joshua Baron, Karim El Defrawy, Kirill Minkovich, Rafail Ostrovsky, Eric Tressler:
5PM: Secure Pattern Matching. IACR Cryptol. ePrint Arch. 2012: 698 (2012) - [i65]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-Interactive Arguments via Linear Interactive Proofs. IACR Cryptol. ePrint Arch. 2012: 718 (2012) - 2011
- [i64]Brett Hemenway, Rafail Ostrovsky, Martin Strauss, Mary Wootters:
Public Key Locally Decodable Codes with Short Keys. Electron. Colloquium Comput. Complex. TR11 (2011) - [i63]Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky:
On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme. IACR Cryptol. ePrint Arch. 2011: 327 (2011) - [i62]Steve Lu, Rafail Ostrovsky:
Multi-Server Oblivious RAM. IACR Cryptol. ePrint Arch. 2011: 384 (2011) - [i61]Sanjam Garg, Rafail Ostrovsky, Ivan Visconti, Akshay Wadia:
Resettable Statistical Zero Knowledge. IACR Cryptol. ePrint Arch. 2011: 457 (2011) - [i60]Rafail Ostrovsky, Vanishree Rao, Alessandra Scafuro, Ivan Visconti:
Revisiting Lower and Upper Bounds for Selective Decommitments. IACR Cryptol. ePrint Arch. 2011: 536 (2011) - [i59]Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky:
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. IACR Cryptol. ePrint Arch. 2011: 629 (2011) - 2010
- [i58]Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. CoRR abs/1009.2490 (2010) - [i57]Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky:
Deterministic and Energy-Optimal Wireless Synchronization. CoRR abs/1010.1112 (2010) - [i56]Vladimir Braverman, Rafail Ostrovsky:
Recursive Sketching For Frequency Moments. CoRR abs/1011.2571 (2010) - [i55]Vladimir Braverman, Rafail Ostrovsky, Yuval Rabani:
Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform. CoRR abs/1011.2590 (2010) - [i54]Vladimir Braverman, Ran Gelles, Rafail Ostrovsky:
How to Catch L_2-Heavy-Hitters on Sliding Windows. CoRR abs/1012.3130 (2010) - [i53]Brett Hemenway, Rafail Ostrovsky:
Building Injective Trapdoor Functions From Oblivious Transfer. Electron. Colloquium Comput. Complex. TR10 (2010) - [i52]Brett Hemenway, Rafail Ostrovsky:
Homomorphic Encryption Over Cyclic Groups Implies Chosen-Ciphertext Security. IACR Cryptol. ePrint Arch. 2010: 99 (2010) - [i51]Brett Hemenway, Steve Lu, Rafail Ostrovsky:
Correlated Product Security From Any One-Way Function and the New Notion of Decisional Correlated Product Security. IACR Cryptol. ePrint Arch. 2010: 100 (2010) - [i50]Paul Bunn, Rafail Ostrovsky:
Throughput-Optimal Routing in Unreliable Networks. IACR Cryptol. ePrint Arch. 2010: 231 (2010) - [i49]Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner:
Position-Based Quantum Cryptography: Impossibility and Constructions. IACR Cryptol. ePrint Arch. 2010: 275 (2010) - 2009
- [i48]Vladimir Braverman, Rafail Ostrovsky:
Measuring Independence of Datasets. CoRR abs/0903.0034 (2009) - [i47]Paul Bunn, Rafail Ostrovsky:
Throughput in Asynchronous Networks. CoRR abs/0910.4572 (2009) - [i46]Chongwon Cho, Chen-Kuei Lee, Rafail Ostrovsky:
Equivalence of Uniform Key Agreement and Composition Insecurity. Electron. Colloquium Comput. Complex. TR09 (2009) - [i45]Brett Hemenway, Rafail Ostrovsky:
Lossy Trapdoor Functions from Smooth Homomorphic Hash Proof Systems. Electron. Colloquium Comput. Complex. TR09 (2009) - [i44]Brett Hemenway, Benoît Libert, Rafail Ostrovsky, Damien Vergnaud:
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security. IACR Cryptol. ePrint Arch. 2009: 88 (2009) - [i43]Nishanth Chandran, Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky:
Position Based Cryptography. IACR Cryptol. ePrint Arch. 2009: 364 (2009) - [i42]Juan A. Garay, Clint Givens, Rafail Ostrovsky:
Secure Message Transmission with Small Public Discussion. IACR Cryptol. ePrint Arch. 2009: 519 (2009) - 2008
- [i41]Vladimir Braverman, Rafail Ostrovsky:
Measuring $k$-Wise Independence of Streaming Data. CoRR abs/0806.4790 (2008) - [i40]Yair Amir, Paul Bunn, Rafail Ostrovsky:
Optimal-Rate Coding Theorem For Adversarial Networks in the Public-Key Setting. CoRR abs/0808.0156 (2008) - [i39]Milan Bradonjic, Eddie Kohler, Rafail Ostrovsky:
Near-Optimal Radio Use For Wireless Network Synchronization. CoRR abs/0810.1756 (2008) - [i38]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Constant-Round Concurrent Non-Malleable Commitments and Decommitments. IACR Cryptol. ePrint Arch. 2008: 235 (2008) - [i37]Nishanth Chandran, Rafail Ostrovsky, William E. Skeith III:
Public-Key Encryption with Efficient Amortized Updates. IACR Cryptol. ePrint Arch. 2008: 429 (2008) - [i36]Yair Amir, Paul Bunn, Rafail Ostrovsky:
Authenticated Adversarial Routing. IACR Cryptol. ePrint Arch. 2008: 448 (2008) - 2007
- [i35]Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo:
Succinct Sampling on Streams. CoRR abs/cs/0702151 (2007) - [i34]Brett Hemenway, Rafail Ostrovsky:
Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code. Electron. Colloquium Comput. Complex. TR07 (2007) - [i33]Rafail Ostrovsky, William E. Skeith III:
Algebraic Lower Bounds for Computing on Encrypted Data. Electron. Colloquium Comput. Complex. TR07 (2007) - [i32]Rafail Ostrovsky, Omkant Pandey, Amit Sahai:
Private Locally Decodable Codes. IACR Cryptol. ePrint Arch. 2007: 25 (2007) - [i31]Rafail Ostrovsky, William E. Skeith III:
A Survey of Single Database PIR: Techniques and Applications. IACR Cryptol. ePrint Arch. 2007: 59 (2007) - [i30]Rafail Ostrovsky, William E. Skeith III:
Algebraic Lower Bounds for Computing on Encrypted Data. IACR Cryptol. ePrint Arch. 2007: 64 (2007) - [i29]Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III:
Public Key Encryption that Allows PIR Queries. IACR Cryptol. ePrint Arch. 2007: 73 (2007) - [i28]Brett Hemenway, Rafail Ostrovsky:
Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code. IACR Cryptol. ePrint Arch. 2007: 83 (2007) - [i27]Paul Bunn, Rafail Ostrovsky:
Secure Two-Party k-Means Clustering. IACR Cryptol. ePrint Arch. 2007: 231 (2007) - [i26]Rafail Ostrovsky, Amit Sahai, Brent Waters:
Attribute-Based Encryption with Non-Monotonic Access Structures. IACR Cryptol. ePrint Arch. 2007: 323 (2007) - [i25]Juan A. Garay, Rafail Ostrovsky:
Almost-everywhere Secure Computation. IACR Cryptol. ePrint Arch. 2007: 394 (2007) - 2006
- [i24]Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam D. Smith:
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. CoRR abs/cs/0602007 (2006) - [i23]Nishanth Chandran, Ryan Moriarty, Rafail Ostrovsky, Omkant Pandey, Amit Sahai:
Improved Algorithms for Optimal Embeddings. Electron. Colloquium Comput. Complex. TR06 (2006) - [i22]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Concurrent Non-Malleable Witness Indistinguishability and its Applications. Electron. Colloquium Comput. Complex. TR06 (2006) - [i21]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography from Anonymity. IACR Cryptol. ePrint Arch. 2006: 84 (2006) - [i20]Steve Lu, Rafail Ostrovsky, Amit Sahai, Hovav Shacham, Brent Waters:
Sequential Aggregate Signatures and Multisignatures without Random Oracles. IACR Cryptol. ePrint Arch. 2006: 96 (2006) - [i19]Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail Ostrovsky:
Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions. IACR Cryptol. ePrint Arch. 2006: 210 (2006) - [i18]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Constant-Round Concurrent NMWI and its relation to NMZK. IACR Cryptol. ePrint Arch. 2006: 256 (2006) - [i17]Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky, Amit Sahai:
Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions. IACR Cryptol. ePrint Arch. 2006: 400 (2006) - [i16]Jens Groth, Rafail Ostrovsky:
Cryptography in the Multi-string Model. IACR Cryptol. ePrint Arch. 2006: 407 (2006) - 2005
- [i15]Shlomi Dolev, Andreas Pfitzmann, Rafail Ostrovsky:
05411 Abstracts Collection -- Anonymous Communication and its Applications. Anonymous Communication and its Applications 2005 - [i14]Jens Groth, Rafail Ostrovsky, Amit Sahai:
Perfect Non-Interactive Zero Knowledge for NP. Electron. Colloquium Comput. Complex. TR05 (2005) - [i13]Rafail Ostrovsky, William E. Skeith III:
Private Searching On Streaming Data. IACR Cryptol. ePrint Arch. 2005: 242 (2005) - [i12]Jens Groth, Rafail Ostrovsky, Amit Sahai:
Perfect Non-Interactive Zero Knowledge for NP. IACR Cryptol. ePrint Arch. 2005: 290 (2005) - 2004
- [i11]Rafail Ostrovsky, Charles Rackoff, Adam D. Smith:
Efficient Consistency Proofs for Generalized Queries on a Committed Database. IACR Cryptol. ePrint Arch. 2004: 170 (2004) - 2003
- [i10]Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano:
Public Key Encryption with keyword Search. IACR Cryptol. ePrint Arch. 2003: 195 (2003) - [i9]Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam D. Smith:
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. IACR Cryptol. ePrint Arch. 2003: 235 (2003) - 2002
- [i8]Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai:
Universally Composable Two-Party and Multi-Party Secure Computation. IACR Cryptol. ePrint Arch. 2002: 140 (2002) - 2001
- [i7]Jonathan Katz, Rafail Ostrovsky, Moti Yung:
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. IACR Cryptol. ePrint Arch. 2001: 31 (2001) - [i6]Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam D. Smith:
Efficient and Non-Interactive Non-Malleable Commitment. IACR Cryptol. ePrint Arch. 2001: 32 (2001) - 1998
- [i5]Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky:
Universal Service Providers for Database Private Information Retrieval. IACR Cryptol. ePrint Arch. 1998: 4 (1998) - [i4]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness versus Fault-Tolerance. IACR Cryptol. ePrint Arch. 1998: 14 (1998) - 1996
- [i3]Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky:
Deniable Encryption. IACR Cryptol. ePrint Arch. 1996: 2 (1996) - [i2]Rafail Ostrovsky, Victor Shoup:
Private Information Storage. IACR Cryptol. ePrint Arch. 1996: 5 (1996) - 1994
- [i1]Oded Goldreich, Rafail Ostrovsky, Erez Petrank:
Computational Complexity and Knowledge Complexity. Electron. Colloquium Comput. Complex. TR94 (1994)
Coauthor Index
Brett Hemenway
aka: Brett Hemenway Falk
aka: Brett Hemenway Falk
[j65] [j57] [j56] [j51] [c272] [c271] [c266] [c259] [c251] [c248] [c230] [c229] [c226] [c205] [c196] [c194] [c178] [c159] [c151] [c134] [c133] [c132] [c126] [c125] [c98] [i188] [i187] [i184] [i177] [i176] [i161] [i153] [i152] [i139] [i121] [i117] [i111] [i110] [i102] [i85] [i64] [i53] [i52] [i51] [i45] [i44] [i34] [i28]
[j62] [j40] [j26] [j13] [c275] [c270] [c269] [c267] [c257] [c252] [c246] [c236] [c234] [c233] [c221] [c214] [c203] [c189] [c177] [c158] [c150] [c146] [c145] [c129] [c122] [c121] [c108] [c104] [c94] [c90] [c82] [c76] [c71] [c66] [c41] [c40] [i182] [i175] [i172] [i157] [i151] [i149] [i148] [i145] [i144] [i140] [i132] [i128] [i107] [i103] [i89] [i84] [i79] [i65] [i21] [i5]
[j61] [j26] [j16] [j11] [j10] [j9] [j8] [j6] [j5] [j2] [c273] [c260] [c242] [c233] [c231] [c203] [c189] [c150] [c130] [c122] [c121] [c104] [c94] [c90] [c89] [c82] [c76] [c71] [c66] [c64] [c54] [c42] [c39] [c38] [c34] [c33] [c29] [c28] [c26] [c25] [c24] [i171] [i169] [i145] [i135] [i103] [i89] [i84] [i79] [i63] [i29] [i21] [i4]
[j56] [j35] [j30] [c278] [c270] [c269] [c267] [c263] [c257] [c254] [c229] [c226] [c216] [c203] [c196] [c185] [c180] [c175] [c154] [c144] [c133] [c130] [c100] [c78] [i182] [i181] [i175] [i174] [i173] [i172] [i164] [i157] [i148] [i121] [i112] [i108] [i104] [i103] [i96] [i88] [i68] [i63] [i62] [i51] [i20]
[c237] [c235] [c228] [c223] [c215] [c213] [c208] [c207] [c206] [c204] [c190] [c186] [c174] [c168] [c166] [c165] [c164] [c160] [c155] [c153] [c147] [c143] [c141] [c138] [c137] [c128] [c127] [c107] [c102] [c95] [e2] [i137] [i131] [i127] [i126] [i125] [i124] [i120] [i119] [i118] [i95] [i92] [i90] [i76] [i74] [i72] [i70] [i61] [i60] [i38] [i22] [i18]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-18 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
