Rafail Ostrovsky

Q: What Schools Are Affiliated With Rafail Ostrovsky

Rafail Ostrovsky is affiliated with the following schools: University of California, Santa Barbara, Weizmann Institute of Science, University of California, San Diego, University of California, Los Angeles, Massachusetts Institute of Technology

Rafail Ostrovsky's AcademicInfluence.com Rankings

Rafail Ostrovsky

Computer Science

#1433

World Rank

#1482

Historical Rank

#708

USA Rank

Theoretical Computer Science

#49

World Rank

#49

Historical Rank

#16

USA Rank

computer-science Degrees

Rafail Ostrovsky

Mathematics

#3646

World Rank

#5347

Historical Rank

#1333

USA Rank

Measure Theory

#652

World Rank

#892

Historical Rank

#263

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Why Is Rafail Ostrovsky Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Rafail Ostrovsky is a distinguished professor of computer science and mathematics at UCLA and a well-known researcher in algorithms and cryptography. Biography Rafail Ostrovsky received his Ph.D. from MIT in 1992.

(See a Problem?)

Rafail Ostrovsky's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Public Key Encryption with Keyword Search (2004) (3155)
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data (2004) (2697)
Searchable symmetric encryption: improved definitions and efficient constructions (2006) (2388)
Software protection and simulation on oblivious RAMs (1996) (1619)
Attribute-based encryption with non-monotonic access structures (2007) (1192)
Replication is not needed: single database, computationally-private information retrieval (1997) (1037)
Universally composable two-party and multi-party secure computation (2002) (722)
Efficient search for approximate nearest neighbor in high dimensional spaces (1998) (515)
The Effectiveness of Lloyd-Type Methods for the k-Means Problem (2006) (477)
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords (2001) (439)
How to withstand mobile virus attacks (extended abstract) (1991) (426)
Deniable Encryption (1997) (366)
How To Withstand Mobile Virus Attacks (1991) (349)
Perfect Non-Interactive Zero Knowledge for NP (2006) (337)
Sequential Aggregate Signatures and Multisignatures Without Random Oracles (2006) (319)
Public Key Encryption That Allows PIR Queries (2007) (300)
Robust Non-interactive Zero Knowledge (2001) (297)
Zero-knowledge from secure multiparty computation (2007) (287)
Efficient computation on oblivious RAMs (1990) (277)
Circular-Secure Encryption from Decision Diffie-Hellman (2008) (268)
On the (in)security of hash-based oblivious RAM and a new balancing scheme (2012) (262)
Secure Remote Authentication Using Biometric Data (2005) (255)
A Survey of Single-Database Private Information Retrieval: Techniques and Applications (2007) (245)
Private Searching on Streaming Data (2005) (245)
Batch codes and their applications (2004) (219)
Secure two-party k-means clustering (2007) (214)
Succinct Non-Interactive Arguments via Linear Interactive Proofs (2013) (201)
Non-interactive Zaps and New Techniques for NIZK (2006) (193)
Security of blind digital signatures (1997) (190)
Private information storage (extended abstract) (1997) (188)
Round-Optimal Secure Two-Party Computation (2004) (185)
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation (1998) (170)
Single Database Private Information Retrieval Implies Oblivious Transfer (2000) (167)
One-way functions are essential for non-trivial zero-knowledge (1993) (166)
New Techniques for Noninteractive Zero-Knowledge (2012) (165)
Non-interactive and non-malleable commitment (1998) (161)
Security of Blind Digital Signatures (Extended Abstract) (1997) (156)
Cryptography with constant computational overhead (2008) (151)
Fingerprint Recognition (2008) (141)
Distributed Oblivious RAM for Secure Two-Party Computation (2013) (132)
Cryptography from Anonymity (2006) (127)
Optimal sampling from sliding windows (2009) (126)
Private Information Storage (1996) (126)
Conditional Oblivious Transfer and Timed-Release Encryption (1999) (124)
Efficient Arguments without Short PCPs (2007) (124)
Fast digital identity revocation (1998) (123)
Efficient and Non-interactive Non-malleable Commitment (2001) (121)
How to Garble RAM Programs (2013) (121)
Fast Digital Identity Revocation (Extended Abstract) (1998) (121)
Smooth Histograms for Sliding Windows (2007) (117)
Position-Based Quantum Cryptography: Impossibility and Constructions (2011) (116)
Position-Based Cryptography (2014) (115)
Efficient Non-interactive Secure Computation (2011) (112)
Lower bounds for high dimensional nearest neighbor search and related problems (1999) (112)
Garbled RAM Revisited (2014) (112)
Approximation algorithms for the job interval selection problem and related scheduling problems (2001) (112)
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval (2000) (110)
Efficient and secure authenticated key exchange using weak passwords (2009) (104)
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security (2011) (103)
Perfect zero-knowledge in constant rounds (1990) (102)
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority (2012) (102)
Adaptive packet routing for bursty adversarial traffic (1998) (97)
Round Efficiency of Multi-party Computation with a Dishonest Majority (2003) (97)
Zero-Knowledge Proofs from Secure Multiparty Computation (2009) (97)
Universal O(congestion + dilation + log1+εN) local control packet switching algorithms (1997) (87)
Streaming k-means on well-clusterable data (2011) (84)
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract) (1992) (81)
One-way functions, hard on average problems, and statistical zero-knowledge proofs (1991) (80)
Secure Multi-Party Computation with Identifiable Abort (2014) (80)
Zero-one frequency laws (2010) (79)
Constructing Non-malleable Commitments: A Black-Box Approach (2012) (79)
The (true) complexity of statistical zero knowledge (1990) (79)
Fair Games against an All-Powerful Adversary (1990) (79)
A Survey of Single Database PIR: Techniques and Applications (2007) (78)
Xor-trees for efficient anonymous multicast and reception (2000) (77)
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions (2013) (74)
Forward Secrecy in Password-Only Key Exchange Protocols (2002) (73)
Cryptography in the Multi-string Model (2007) (71)
Low distortion embeddings for edit distance (2005) (71)
Private Large-Scale Databases with Distributed Searchable Symmetric Encryption (2016) (68)
Universal service-providers for database private information retrieval (extended abstract) (1998) (67)
Optimal Coding for Streaming Authentication and Interactive Communication (2013) (66)
Cryptographic Counters and Applications to Electronic Voting (2001) (66)
Minimum resource zero knowledge proofs (1989) (63)
Almost-Everywhere Secure Computation (2008) (62)
Polynomial-time approximation schemes for geometric min-sum median clustering (2002) (61)
Optimal and efficient clock synchronization under drifting clocks (1999) (61)
Sufficient Conditions for Collision-Resistant Hashing (2005) (61)
On Concurrent Zero-Knowledge with Pre-processing (1999) (60)
Garbled RAM From One-Way Functions (2015) (60)
Reducibility and completeness in multi-party private computations (1994) (60)
Trapdoor Hash Functions and Their Applications (2019) (59)
Position-Based Quantum Cryptography: Impossibility and Constructions (2010) (57)
Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP (2000) (57)
Polynomial time approximation schemes for geometric k-clustering (2000) (56)
5PM: Secure pattern matching (2012) (56)
Reducibility and Completeness in Private Computations (2000) (55)
Adaptively Secure Garbled Circuits from One-Way Functions (2016) (54)
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract) (1992) (54)
Micropayments via Efficient Coin-Flipping (1998) (54)
Efficient Consistency Proofs for Generalized Queries on a Committed Database (2004) (53)
Error-correcting codes for automatic control (2005) (52)
How Hard Is Counting Triangles in the Streaming Model? (2013) (52)
Round Complexity of Authenticated Broadcast with a Dishonest Majority (2007) (52)
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces (1999) (51)
Maliciously Circuit-Private FHE (2014) (50)
How to withstand mobile virus attacks, revisited (2014) (50)
Unconditionally-Secure Robust Secret Sharing with Compact Shares (2012) (50)
Concurrent Non-Malleable Commitments (and More) in 3 Rounds (2016) (49)
Position Based Cryptography (2009) (48)
Extracting Correlations (2009) (48)
Coding for Interactive Communication Correcting Insertions and Deletions (2015) (48)
A Stable Marriage Requires Communication (2014) (48)
Black-Box Garbled RAM (2015) (47)
Low distortion embeddings for edit distance (2007) (47)
Dynamic routing on networks with fixed-size buffers (2003) (47)
Identifying Cheaters without an Honest Majority (2012) (46)
Round-Optimal Black-Box Two-Party Computation (2015) (45)
Local correctability of expander codes (2013) (44)
Memory-efficient and self-stabilizing network RESET (extended abstract) (1994) (43)
Locally Updatable and Locally Decodable Codes (2014) (43)
Simple and efficient leader election in the full information model (1994) (42)
Lossy Trapdoor Functions from Smooth Homomorphic Hash Proof Systems (2009) (42)
Private Set Intersection with Linear Communication from General Assumptions (2019) (40)
Password-Authenticated Session-Key Generation on the Internet in the Plain Model (2010) (39)
Communication-Optimal Proactive Secret Sharing for Dynamic Groups (2015) (38)
Interactive Hashing Simplifies Zero-Knowledge Protocol Design (1994) (38)
Characterizing linear size circuits in terms of privacy (1996) (37)
Constant-Rate Oblivious Transfer from Noisy Channels (2011) (37)
Stability preserving transformations: packet routing networks with edge capacities and speeds (2001) (36)
Privacy amplification with asymptotically optimal entropy loss (2014) (36)
4-Round Resettably-Sound Zero Knowledge (2014) (35)
Perfect zero-knowledge ar-guments for NP can be based on general complexity assumptions (1998) (35)
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions (2017) (35)
Matching nuts and bolts (1994) (34)
Identifying genetic relatives without compromising privacy (2014) (34)
Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles (2013) (32)
On Complete Primitives for Fairness (2010) (32)
Reusable Non-Interactive Secure Computation (2019) (31)
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (2008) (31)
Public-Key Locally-Decodable Codes (2008) (31)
Achieving Privacy in Verifiable Computation with Multiple Servers - Without FHE and without Pre-processing (2014) (30)
Self-stabilizing symmetry breaking in constant-space (extended abstract) (1992) (30)
Minimal Complete Primitives for Secure Multi-Party Computation (2004) (30)
Recursive Sketching For Frequency Moments (2010) (30)
Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform (2010) (30)
Computational Complexity and Knowledge Complexity (1998) (30)
How to catch L2-heavy-hitters on sliding windows (2010) (30)
Line-Point Zero Knowledge and Its Applications (2020) (30)
On Round Optimal Secure Multiparty Computation from Minimal Assumptions (2019) (29)
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations (2017) (28)
Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams (2013) (28)
Algebraic Lower Bounds for Computing on Encrypted Data (2007) (27)
High-Precision Secure Computation of Satellite Collision Probabilities (2016) (27)
Measuring independence of datasets (2009) (27)
Covert Multi-Party Computation (2007) (27)
The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults (2015) (27)
Extended-DDH and Lossy Trapdoor Functions (2012) (27)
Black-box non-black-box zero knowledge (2014) (26)
Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge (2010) (26)
Private Locally Decodable Codes (2007) (26)
Log-space polynomial end-to-end communication (1995) (25)
Efficient 3-Party Distributed ORAM (2018) (25)
Continuously Non-malleable Codes in the Split-State Model (2018) (25)
Simultaneous Resettability from Collision Resistance (2012) (25)
Robust Pseudorandom Generators (2013) (25)
Impossibility Results for Static Input Secure Computation (2012) (25)
Circuit-Private Multi-key FHE (2017) (25)
The Linear-Array Conjecture in Communication Complexity Is False (1996) (25)
Minimum Resource Zero-Knowledge Proofs (Extended Abstract) (1989) (24)
Simultaneously Resettable Arguments of Knowledge (2012) (24)
Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting (2015) (24)
Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract) (1999) (24)
Revisiting Lower and Upper Bounds for Selective Decommitments (2013) (24)
Visual cryptography on graphs (2008) (24)
Self-Stabilizing Symmetry Breaking in Constant Space (2002) (23)
The Las-Vegas processor identity problem (how and when to be unique) (1993) (23)
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds (2017) (23)
Private Anonymous Data Access (2019) (23)
Approximating Large Frequency Moments with Pick-and-Drop Sampling (2012) (22)
Effective Computations on Sliding Windows (2010) (22)
Improved Fault Tolerance and Secure Computation on Sparse Networks (2010) (22)
Non-committing Encryption from Φ-hiding (2015) (22)
Simulation-Based Concurrent Non-malleable Commitments and Decommitments (2009) (21)
Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares (2021) (21)
A Randomized Online Quantile Summary in O((1/ε) log(1/ε)) Words (2017) (21)
Zero-One Laws for Sliding Windows and Universal Sketches (2015) (21)
Resettable Statistical Zero Knowledge (2012) (21)
AMS Without 4-Wise Independence on Product Domains (2008) (20)
Simultaneous Resettability from One-Way Functions (2013) (20)
Secure Commitment Against A Powerful Adversary (1992) (20)
Building Lossy Trapdoor Functions from Lossy Encryption (2013) (20)
Faster computation on directed networks of automata (1995) (20)
On Homomorphic Encryption and Chosen-Ciphertext Security (2012) (19)
Amortizing randomness in private multiparty computations (1998) (19)
Communication Complexity in Algebraic Two-Party Protocols (2008) (19)
The Price of Low Communication in Secure Multi-party Computation (2017) (19)
Self-stabilizing algorithms for synchronous unidirectional rings (1996) (18)
Proactive Secret Sharing with a Dishonest Majority (2016) (18)
Black-Box Parallel Garbled RAM (2017) (18)
Minimum resource zero-knowledge proofs (extended abstracts) (1989) (18)
Secure computation with honest-looking parties (extended abstract): what if nobody is truly honest? (1999) (17)
Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era (2020) (17)
Public Key Locally Decodable Codes with Short Keys (2011) (16)
Minimal Complete Primitives for Secure Multi-party Computation (2001) (16)
Space-Time Tradeoffs for Distributed Verification (2016) (16)
Universal Service-Providers for Private Information Retrieval (2015) (16)
Weighted sampling without replacement from data streams (2015) (16)
Cryptography with One-Way Communication (2015) (15)
ATLAS: Efficient and Scalable MPC in the Honest Majority Setting (2021) (15)
Concurrent Non-Malleable Witness Indistinguishability and its Applications (2006) (15)
Randomness vs. fault-tolerance (1997) (14)
FairMM: A Fast and Frontrunning-Resistant Crypto Market-Maker (2021) (14)
Privacy preserving protocol for detecting genetic relatives using rare variants (2014) (14)
Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs (2017) (14)
Dynamic interfacial tension in binary systems and spontaneous pulsation of individual drops by their dissolution (1983) (14)
Secure Message Transmission With Small Public Discussion (2010) (14)
Function Secret Sharing for PSI-CA: With Applications to Private Contact Tracing (2020) (13)
Garbled RAM Revisited, Part II (2014) (13)
Constant-Overhead Zero-Knowledge for RAM Programs (2021) (13)
Matrix Balancing in Lp Norms: Bounding the Convergence Rate of Osborne's Iteration (2017) (13)
Concurrent Zero Knowledge in the Bounded Player Model (2013) (13)
Randomness versus Fault-Tolerance (2000) (12)
Constant-Round Concurrent Zero Knowledge in the Bounded Player Model (2013) (12)
Proactive Secure Multiparty Computation with a Dishonest Majority (2018) (12)
Adaptive Garbled RAM from Laconic Oblivious Transfer (2018) (12)
An Efficient Software Protection Scheme (1989) (12)
Near-optimal radio use for wireless network synchronization (2008) (12)
Efficient anonymous multicast and reception (1997) (11)
Characterizing Linear Size Circuits in Terms of Pricacy (1999) (11)
Privacy amplification with asymptotically optimal entropy loss (2010) (11)
Multiparty Proximity Testing with Dishonest Majority from Equality Testing (2012) (11)
A Randomized Online Quantile Summary in O(1/epsilon * log(1/epsilon)) Words (2015) (10)
Edge Fault Tolerance on Sparse Networks (2012) (10)
Public-Key Encryption with Efficient Amortized Updates (2010) (10)
Identity-Based Zero Knowledge (2004) (10)
Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way (2015) (10)
Broadcast (and Round) Efficient Verifiable Secret Sharing (2013) (10)
Efficient Consistency Proofs on a Committed Database (2003) (10)
Round Optimal Black-Box “Commit-and-Prove” (2018) (10)
Secure Message Transmission by Public Discussion: A Brief Survey (2011) (10)
Secure Remote Authentication Using Biometrics (2005) (10)
Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions (2007) (10)
Fast Distributed Almost Stable Matchings (2015) (10)
Alibi: A Flaw in Cuckoo-Hashing based Hierarchical ORAM Schemes and a Solution (2020) (9)
Non-Interactive Secure Computation from One-Way Functions (2018) (9)
Multi-Server Oblivious RAM (2011) (9)
Efficient Anonymous Multicast and Reception (Extended Abstract) (1997) (9)
On Succinct Arguments and Witness Encryption from Groups (2020) (9)
Adaptive Security with Quasi-Optimal Rate (2016) (9)
Error-Correcting Codes for Automatic Control (2009) (9)
Equivalence of Uniform Key Agreement and Composition Insecurity (2010) (8)
Oblivious tight compaction in O(n) time with smaller constant (2020) (8)
Constant-Round Concurrent NMWI and its relation to NMZK (2006) (8)
A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems (1991) (8)
Unconditionally Secure Computation with Reduced Interaction (2016) (8)
Brief Announcement: Secure Self-Stabilizing Computation (2017) (8)
On the Message Complexity of Secure Multiparty Computation (2018) (8)
Locally Decodable Codes for Edit Distance (2015) (7)
Instance-Hiding Proof Systems (1999) (7)
Population Stability: Regulating Size in the Presence of an Adversary (2018) (7)
Computational complexity and knowledge complexity (extended abstract) (1994) (7)
On Selective-Opening Attacks against Encryption Schemes (2014) (7)
Authenticated Adversarial Routing (2008) (7)
Information-Theoretic Broadcast with Dishonest Majority for Long Messages (2018) (7)
Secure merge with O(n log log n) secure operation (2020) (7)
Proof-of-Reputation Blockchain with Nakamoto Fallback (2020) (7)
Homomorphic Encryption Over Cyclic Groups Implies Chosen-Ciphertext Security (2010) (7)
Deterministic and Energy-Optimal Wireless Synchronization (2010) (7)
Almost-Everywhere Secure Computation with Edge Corruptions (2015) (7)
Computing Statistics from Private Data (2018) (6)
Statistical Concurrent Non-Malleable Zero Knowledge (2014) (6)
It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems (2014) (6)
Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World (2015) (6)
Cryptography Using Captcha Puzzles (2013) (6)
Correlated Product Security From Any One-Way Function and the New Notion of Decisional Correlated Product Security (2012) (6)
On Necessary Conditions for Secure Distributed Computation (1989) (6)
A Refined Approximation for Euclidean k-Means (2021) (6)
On linear-size pseudorandom generators and hardcore functions (2013) (6)
Improved algorithms for optimal embeddings (2008) (6)
New Techniques for Non-interactive Zero-Knowledge (2006) (6)
Building Injective Trapdoor Functions From Oblivious Transfer (2010) (6)
Provably Secure Virus Detection: Using The Observer Effect Against Malware (2016) (5)
Impossibility of Black-Box Simulation Against Leakage Attacks (2015) (5)
Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality (2014) (5)
Communication-Efficient MPC for General Adversary Structures (2014) (5)
Asynchronous Throughput-Optimal Routing in Malicious Networks (2010) (5)
Searchable Symmetric Encryption: Improved Deﬁnitions and Eﬃcient Constructions ∗ (5)
Efficient Error-Correcting Codes for Sliding Windows (2020) (5)
Broadcast-Efficient Secure Multiparty Computation (2012) (4)
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND (2019) (4)
A PoR/PoS-Hybrid Blockchain: Proof of Reputation with Nakamoto Fallback (2020) (4)
On Round-Efficient Non-Malleable Protocols (2016) (4)
Improved Approximation Algorithms for Earth-Mover Distance in Data Streams (2014) (4)
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More (2019) (4)
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds (2021) (4)
Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups (2020) (4)
Resettably-Sound Resettable Zero Knowledge in Constant Rounds (2017) (4)
ACCO (2021) (4)
UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens (2019) (4)
DURASIFT: A Robust, Decentralized, Encrypted Database Supporting Private Searches with Complex Policy Controls (2019) (3)
Fast and unconditionally secure anonymous channel (2014) (3)
Constant-Round Concurrent Non-Malleable Commitments and Decommitments (2008) (3)
Efficient robust secret sharing from expander graphs (2017) (3)
Succinct Sampling on Streams (2007) (3)
Universally Composable Secure Computation with Corrupted Tokens (2019) (3)
TOWARDS AN INTELLIGENT COMPUTER GRAPHICS SYSTEM (3)
Four-Round Secure Multiparty Computation from General Assumptions (2019) (3)
HOLMES-I, a prolog-based reason maintenance system for collecting information from multiple experts (1986) (3)
Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One (2022) (3)
Measuring $k$-Wise Independence of Streaming Data (2008) (3)
Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code (2007) (3)
Threshold Garbled Circuits and Ad Hoc Secure Computation (2021) (3)
Brief Announcement: Space-Time Tradeoffs for Distributed Verification (2016) (3)
Universally Composable Secure Two and Multi-party Computation in the Corruptible Tamper-Proof Hardware Token Model (2017) (2)
Variability in Data Streams (2015) (2)
Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration (2017) (2)
On The Communication Complexity of Finding an (Approximate) Stable Marriage (2014) (2)
Round-Optimal and Communication-Efficient Multiparty Computation (2020) (2)
Provable Virus Detection: Using the Uncertainty Principle to Protect Against Malware (2015) (2)
On Input Indistinguishable Proof Systems (2014) (2)
Nearly Simultaneously Resettable Black-Box Zero Knowledge (2012) (2)
Oblivious Sampling with Applications to Two-Party k-Means Clustering (2020) (2)
CNF-FSS and its Applications (2021) (2)
Throughput in Asynchronous Networks (2009) (2)
An architecture for a resilient cloud computing infrastructure (2013) (2)
Unconditional UC-Secure Computation with ( Stronger-Malicious ) (2017) (2)
On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (2016) (2)
Secure End-to-End Communication with Optimal Throughput in Unreliable Networks (2013) (2)
How to Garble RAM Programs 3 (2013) (2)
Cryptography in the Multi-string Model (2013) (1)
Faster Computation On Directed Networks of Automata (Extended Abstract). (1995) (1)
05411 Abstracts Collection -- Anonymous Communication and its Applications (2005) (1)
New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs (2016) (1)
Fast distributed almost stable marriages (2014) (1)
Theoretical foundations of position-based cryptography (2011) (1)
EpiGRAM: Practical Garbled RAM (2022) (1)
Homomorphic encryption and non-interactive secure computation (2007) (1)
Measuring $k$-Wise Independence of Streaming Data under $L_2$ Norm (2008) (1)
Announcement : Space-Time Tradeoffs for Distributed Verification (2016) (1)
Authenticated Garbling from Simple Correlations (2022) (1)
Semantic network reasoning for picture composition (1986) (1)
Secure Commitment against a Powerful Adversary a Security Primitive Based on Average Intractability Extended Abstract (1999) (1)
Matrix Balancing in Lp Norms: A New Analysis of Osborne's Iteration (2016) (1)
Brief Announcement: Proactive Secret Sharing with a Dishonest Majority (2016) (1)
A randomized online quantile summary in $O(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon})$ words (2015) (1)
Cryptographic Sensing (2019) (1)
Micro-payments via Eecient Coin-flipping (1998) (1)
Proceedings of the 5th international conference on Security and Cryptography for Networks (2006) (1)
PSI from Ring-OLE (2022) (1)
How to Build a Trapdoor Function from an Encryption Scheme (2021) (1)
Universal Streaming (2014) (1)
Losing information (2010) (1)
A Linear-Time 2-Party Secure Merge Protocol (2022) (1)
Cryptographically Secure Detection of Injection Attacks (2018) (1)
Min-Sum Clustering (with Outliers) (2020) (1)
Practical Garbled RAM: GRAM with O(log2 n) Overhead (2021) (1)
A Combinatorial Characterization of Self-Stabilizing Population Protocols (2020) (1)
3-Party Distributed ORAM from Oblivious Set Membership (2021) (1)
Streaming and Unbalanced PSI from Function Secret Sharing (2022) (0)
Appeared I N Siam Journal on Computing Computational Complexity and Knowledge Complexity Appeared I N Siam Journal on Computing (1998) (0)
FOCS 2018 Organizing Committee and Sponsors (2018) (0)
Efficient robust secret sharing from expander graphs (2017) (0)
Secure Multi-Party Computation with Identiable Abort (2016) (0)
4-Round Concurrent Non-Malleable Commitments from One-Way Functions (2016) (0)
Practical Garbled RAM (2021) (0)
Secure Merge in Linear Time and O(log log N) Rounds (2022) (0)
Anonymous Permutation Routing (2022) (0)
Studies in zero knowledge (2010) (0)
Session details: Session 8A (2003) (0)
Determining Relatedness of Textual Data An Implementation Utilizing Dimension Reduction (2008) (0)
Almost-Everywhere Secure Computation with Edge Corruptions (2013) (0)
Anonymous Communication and its Applications, 09.10. - 14.10.2005 (2006) (0)
Cryptographi Counters and Appli ations to Ele troni Voting (0)
Rafail Ostrovsky – Research Statement (2011) (0)
Dynamic Routing on Networks with Fixed-Size Bu ers Extended Abstract (2003) (0)
Near-Optimal Energy Consumption for Radio Synchronization (2008) (0)
Throughput-optimal routing in adversarial networks (2010) (0)
CS 194 Checkpoint 1 Determining Relatedness of Textual Data Utilizing the Fast Johson-Lindenstrauss Transform (2007) (0)
Electronic Theses and Dissertations Title On Interactive Computation over a Noisy Channel (2014) (0)
Special Issue: Algorithmic Tools in Cryptography (2017) (0)
Special Issue: Advances in Security for Communication Networks (2013) (0)
Theoretical Foundations for Mobile Target Defense: Proactive Secret Sharing and Secure Multiparty Computation (2018) (0)
- 20-SEMANTIC NETWORK REASONING FOR PICTURE COMPOSITION (2015) (0)
Special Issue: Algorithmic Tools in Cryptography (2017) (0)
5 PM : 5 ecure Pattern Matching ? (2012) (0)
Security and Cryptography for Networks, 6th International Conference, SCN 2008, Amalfi, Italy, September 10-12, 2008. Proceedings (2008) (0)
Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary (2013) (0)
Cross-Domain Secure Computation (2014) (0)
Adaptively Secure Computation for RAM Programs (2022) (0)
LOWER AND UPPER BOUNDS ON THE RANDOMNESS (2020) (0)
Session details: Session 1B (2003) (0)
Authenticated Adversarial Routing (2013) (0)
ETERNAL: Encrypted Transmission With an Error-correcting, Real-time, Noise-resilient Apparatus on Lightweight Devices (2018) (0)
New constructions in pairing-based cryptography (2009) (0)
Garbled Circuits with Sublinear Evaluator (2022) (0)
Security of Blind Digital Signatures ( Revised Extended Abstract ) (2006) (0)
Resource-Restricted Cryptography: Honest-Majority MPC from a CRS (and No Broadcast) (2019) (0)
Matching nuts and bolts ( Extended Abstract ) (1994) (0)
ACCO: Algebraic Computation with Comparison (2021) (0)
DURASIFT (2019) (0)
Impossibility Results for Leakage-Resilient Zero Knowledge and Multi-Party Computation (2014) (0)
Special Section on the Fifty-Second IEEE Annual Symposium on Foundations of Computer Science (FOCS 2011) (2014) (0)
Universally Composable Almost-Everywhere Secure Computation (2021) (0)
Optimal-Rate Coding Theorem For Adversarial Networks in the Public-Key Setting (2008) (0)
Throughput-Optimal Routing in Unreliable Networks (2010) (0)
Oblivious Sampling with Applications to Two-Party k-Means Clustering (2020) (0)
Privacy Saving Multi-Keyword Ranking Search Anonymous ID on the Cloud Data that has been encrypted (2016) (0)
Log-Space Polynomial End-to-End Communication (Abstract) (1995) (0)
Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles (2012) (0)
Procede et systeme d'extraction de d'informations privees par utilisation de messages (2000) (0)

This paper list is powered by the following services:

Other Resources About Rafail Ostrovsky

en.wikipedia.org

What Schools Are Affiliated With Rafail Ostrovsky?

Rafail Ostrovsky is affiliated with the following schools:

Rafail Ostrovsky's Academic­Influence.com Rankings

Why Is Rafail Ostrovsky Influential?

Rafail Ostrovsky's Published Works

Published Works

Other Resources About Rafail Ostrovsky

What Schools Are Affiliated With Rafail Ostrovsky?

Rafail Ostrovsky's AcademicInfluence.com Rankings