- Near-Optimal Radio Use For Wireless Network Synchronization
- Appeared in SIAM Journal on Computing 274:1116-1141, August 1998
- Privacy Amplification with Asymptotically Optimal Entropy Loss
- Single Database Private Information Retrieval Implies Oblivious Transfer \Lambda
- On Concurrent Zero-Knowledge with Pre-Processing
- Privacy Amplification with Asymptotically Optimal Entropy Loss
- To appear in STACS 2010 -Symposium on Theoretical Aspects of Computer Science www.stacs-conf.org
- Position Based Cryptography Nishanth Chandran Vipul Goyal
- Authenticated Adversarial Routing , Paul Bunn2
- Circular-Secure Encryption from Decision Diffie-Hellman
- Computer SCienCe Department miSSion Statement The Computer Science Department strives for excellence
- Public Key Encryption that Allows PIR Queries Eyal Kushilevitz
- Covert Multi-party Computation Nishanth Chandran
- Smooth Histograms for Sliding Windows Vladimir Braverman
- Private Locally Decodable Codes Rafail Ostrovsky Omkant Pandey Amit Sahai
- Efficient Arguments without Short PCPs Yuval Ishai
- Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
- Secure Two-Party k-Means Clustering Rafail Ostrovsky
- Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions
- Error-Correcting Codes for Automatic Control Rafail Ostrovsky
- Low Distortion Embeddings for Edit Distance Rafail Ostrovsky
- Secure Remote Authentication Using Biometric Data
- Identity-Based Zero-Knowledge Jonathan Katz1
- Efficient Consistency Proofs for Generalized Queries on a Committed Database
- Batch Codes and Their Applications Yuval Ishai
- Public Key Encryption with keyword Search Giovanni Di Crescenzo
- Dynamic Routing on Networks with Fixed-Size Buffers
- Robust Non-Interactive Zero Knowledge ALFREDO DE SANTIS
- E cient Password-Authenticated Key Exchange Using Human-Memorable Passwords
- E cient and Non-Interactive Non-Malleable Commitment
- Cryptographic Counters and Applications to Electronic Voting
- Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds
- Secure Computation with Honest-Looking Parties: What if nobody is truly honest?
- Optimal and E cient Clock Synchronization Under Drifting Clocks
- Universal Service-Providers for Database Private Information Retrieval
- Amortizing Randomness in Private Multiparty Computations Eyal Kushilevitzy Rafail Ostrovskyz Adi Ros enx
- Adaptive Packet Routing for Bursty Adversarial Tra c William Aiello Eyal Kushilevitzy Rafail Ostrovskyz Adi Ros enx
- Xor-Trees for E cient Anonymous Multicast and Reception Shlomi Dolevy Rafail Ostrovskyz
- Security of Blind Digital Signatures (Revised Extended Abstract)
- Deniable Encryption Ran Canetti Cynthia Dwork y Moni Naor z Rafail Ostrovsky x
- Universal Ocongestion + dilation +log1+ N Local Control
- Characterizing Linear Size Circuits in Terms of Eyal Kushilevitzy Rafail Ostrovskyz Adi Ros enx
- Self-Stabilizing Algorithms for Synchronous Unidirectional Rings Alain Mayery
- Reducibility and Completeness In Private Computations
- Simple and E cient Leader Election in the Full Information Model
- Interactive Hashing Simpli es Zero-Knowledge Protocol Design
- One-Way Functions are Essential for Non-Trivial Zero-Knowledge
- Secure Commitment Against A Powerful Adversary A security primitive based on average intractability
- Invariant Signatures and Non-Interactive Zero-Knowledge Proofs
- Perfect Zero-Knowledge Arguments for NP Can Be Based on
- Fair Games Against an All-Powerful Adversary Rafail Ostrovskyy
- On Necessary Conditions for Secure Distributed Computation
- Software Protection and Simulation on Oblivious RAMs
- Software Protection and Simulation on Oblivious RAMs
- Perfect Zero-Knowledge in Constant Rounds Mihir Bellare Silvio Micaliy Rafail Ostrovskyz
- The (True) Complexity of Statistical Zero Knowledge (Extended Abstract)
- Non-Interactive and Non-Malleable Commitment Giovanni Di Crescenzoy
- Zero-One Frequency Laws Vladimir Braverman
- Efficient and NonInteractive NonMalleable Commitment
- The Effectiveness of Lloydtype Methods for the kMeans Problem Rafail Ostrovsky # Yuval Rabani + Leonard J. Schulman # Chaitanya Swamy
- Private Information Storage (Extended Abstract)
- Cryptography with Constant Computational Overhead Yuval Ishai # + Eyal Kushilevitz # + Rafail Ostrovsky + Amit Sahai +
- The Linear-Array Conjecture in Communication Complexity is False
- Subquadratic Approximation Algorithms For Clustering Problems in High Dimensional Spaces
- Interactive Hashing Simplifies ZeroKnowledge Protocol Design
- Characterizing Linear Size Circuits in Terms of Privacy \Lambda
- Cryptography from Anonymity # Yuval Ishai + Eyal Kushilevitz # Rafail Ostrovsky Amit Sahai
- E#ciency Preserving Transformations for Concurrent NonMalleable Zero Knowledge
- Measuring Independence of Datasets Vladimir Braverman #
- The Las-Vegas Processor Identity Problem How and When to Be Unique
- Universal ServiceProviders for Database Private Information Retrieval \Lambda
- OneWay Functions, Hard on Average Problems, and Statistical ZeroKnowledge Proofs
- Cryptography in the Multi-string Model University College London
- Conditional Oblivious Transfer and Timed-Release Encryption
- Polynomial Time Approximation Schemes for Geometric k-Clustering
- Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions #
- MemoryEfficient and SelfStabilizing Network (Extended Abstract)
- Optimal Sampling from Sliding Windows Vladimir Braverman
- A Survey of Single-Database PIR: Techniques and Applications
- Efficient PasswordAuthenticated Key Exchange Using HumanMemorable Passwords
- Subquadratic Approximation Algorithms For Clustering Problems in High Dimensional Spaces
- Public Key Encryption with keyword Search Dan Boneh # Giovanni Di Crescenzo
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Universally Composable TwoParty and Multiparty Secure Computation
- Almost-everywhere Secure Computation Juan A. Garay
- Minimum Resource Zero-Knowledge Proofs
- Round Complexity of Authenticated Broadcast with a Dishonest Majority
- Single Database Private Information Retrieval Implies Oblivious Transfer
- Optimal Sampling from Sliding Windows Vladimir Braverman #
- Deniable Encryption Ran Canetti \Lambda Cynthia Dwork y Moni Naor z Rafail Ostrovsky x
- PublicKey LocallyDecodable Codes Brett Hemenway # Rafail Ostrovsky +
- Low Distortion Embeddings for Edit Distance # Rafail Ostrovsky + Yuval Rabani #
- E cient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- On Concurrent ZeroKnowledge with PreProcessing \Lambda
- Conditional Oblivious Transfer and TimedRelease Encryption
- ConstantRound Concurrent NonMalleable Zero Knowledge in the Bare PublicKey Model
- Round Complexity of Authenticated Broadcast with a Dishonest Majority #
- The LinearArray Conjecture in Communication Complexity is False \Lambda
- Adaptive Packet Routing for Bursty Adversarial Traffic William Aiello \Lambda Eyal Kushilevitz y Rafail Ostrovsky z Adi Ros'en x
- Micro-Payments via E cient Coin-Flipping Extended Abstract
- Almosteverywhere Secure Computation Juan A. Garay # Rafail Ostrovsky +
- Software Protection and Simulation on Oblivious RAMs \Lambda
- Covert Multiparty Computation Nishanth Chandran # Vipul Goyal # Rafail Ostrovsky + Amit Sahai #
- Self-Stabilizing Symmetry Breaking in Constant-Space extended abstract
- Amortizing Randomness in Private Multiparty Computations \Lambda Eyal Kushilevitz y Rafail Ostrovsky z Adi Ros'en x
- Efficient Consistency Proofs for Generalized Queries on a Committed Database #
- Software Protection and Simulation on Oblivious RAMs #
- To appear in STACS 2010 Symposium on Theoretical Aspects of Computer Science www.stacsconf.org
- Perfect NonInteractive Zero Knowledge for NP Jens Groth # , Rafail Ostrovsky ## , and Amit Sahai # # #
- Authenticated Adversarial Routing # Yair Amir 1 , Paul Bunn 2 , and Rafail Ostrovsky 3
- Private Locally Decodable Codes # Rafail Ostrovsky Omkant Pandey Amit Sahai
- Extracting Correlations Yuval Ishai #
- Constant-Round Concurrent Non-Malleable Zero Knowledge in the Bare Public-Key Model
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling
- Perfect Non-Interactive Zero Knowledge for NP , Rafail Ostrovsky
- Dynamic Routing on Networks with Fixed-Size Bu ers Extended Abstract
- The (True) Complexity of Statistical Zero Knowledge (Extended Abstract)
- Smooth Histograms for Sliding Windows Vladimir Braverman # Rafail Ostrovsky +
- Fast Digital Identity Revocation (Extended Abstract)
- Journal of Cryptology, Volume 20:4, pp. 397430, October 2007. 1 Private Searching On Streaming Data #
- SelfStabilizing Algorithms for Synchronous Unidirectional Rings \Lambda Alain Mayer y Rafail Ostrovsky z Moti Yung x
- SelfStabilizing Symmetry Breaking in ConstantSpace (extended abstract)
- Universally Composable Two-Party and Multi-party Secure Computation
- Fair Games Against an AllPowerful Adversary \Lambda Rafail Ostrovsky y Ramarathnam Venkatesan z Moti Yung x
- Visual Cryptography on Graphs University of California, Los Angeles
- Robust NonInteractive Zero Knowledge ALFREDO DE SANTIS 1 GIOVANNI DI CRESCENZO 2 RAFAIL OSTROVSKY 2
- Secure Computation with HonestLooking Parties: What if nobody is truly honest?
- Efficient Arguments without Short PCPs # Yuval Ishai +
- Efficiency Preserving Transformations for Concurrent Non-Malleable Zero Knowledge
- Minimal Complete Primitives for Secure Multi-Party Computation
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds
- Universal O(congestion + dilation + log 1+ffl Local Control
- Randomness versus Fault-Tolerance Ran Canettiy Eyal Kushilevitzz Rafail Ostrovskyx Adi Ros en
- Non-interactive Zaps and New Techniques for NIZK Rafail Ostrovsky
- Simulation-Based Concurrent Non-Malleable Commitments and Decommitments
- Matching nuts and bolts (Extended Abstract) \Lambda
- Invariant Signatures and NonInteractive ZeroKnowledge Proofs
- Cryptographic Counters and Applications to Electronic Voting
- A Survey of SingleDatabase PIR: Techniques and Applications
- Proc. 10th ACM Conf. on Principles of Distributed Systems, August 1991 1 How To Withstand Mobile Virus Attacks
- NearOptimal Radio Use For Wireless Network Synchronization #
- Forward Secrecy in Password-Only Key Exchange Protocols
- ErrorCorrecting Codes for Automatic Control # Rafail Ostrovsky + Yuval Rabani # Leonard J. Schulman
- Polynomial EndtoEnd Communication \Lambda Eyal Kushilevitz y Rafail Ostrovsky z Adi Ros'en x
- Cryptography with Constant Computational Overhead Yuval Ishai
- Public-Key Locally-Decodable Codes Brett Hemenway
- Cryptography from Anonymity Yuval Ishai
- ZeroKnowledge from Secure Multiparty Computation # Yuval Ishai + Eyal Kushilevitz # Rafail Ostrovsky Amit Sahai
- MicroPayments via Efficient CoinFlipping (Extended Abstract)
- Appeared in SIAM Journal on Computing 27(4):11161141, August 1998
- InstanceHiding Proof Systems \Lambda D. Beaver y J. Feigenbaum z R. Ostrovsky x V. Shoup --
- RoundOptimal Secure TwoParty Computation Jonathan Katz 1# Rafail Ostrovsky 2##
- Journal of Cryptology, Volume 20:4, pp. 397-430, October 2007. 1 Private Searching On Streaming Data
- One-way Trapdoor Permutations Are Su cient for Non-Trivial Single-Server
- Faster Computation On Directed Networks of Rafail Ostrovskyy
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- The Effectiveness of Lloyd-type Methods for the k-Means Problem Rafail Ostrovsky
- Communication Complexity in Algebraic Two-Party Protocols Rafail Ostrovsky
- Improved Algorithms for Optimal Embeddings (This paper supersedes previous versions that appear in ACM Transactions of Algorithms, August 2008 and
- Public Key Encryption that Allows PIR Queries Dan Boneh # Eyal Kushilevitz + Rafail Ostrovsky # William E. Skeith III
- Noninteractive Zaps and New Techniques for NIZK Jens Groth # Rafail Ostrovsky + Amit Sahai #
- Concurrent Statistical ZeroKnowledge Arguments for NP from One Way Functions
- SimulationBased Concurrent NonMalleable Commitments and Decommitments
- Cryptography in the Multistring Model # Jens Groth +
- On Necessary Conditions for Secure Distributed Computation
- Secure TwoParty kMeans Clustering Paul Bunn # Rafail Ostrovsky +
- One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
- Communication Complexity in Algebraic TwoParty Protocols Rafail Ostrovsky # William E. Skeith III +
- CircularSecure Encryption from Decision Di#eHellman
- Minimum Resource ZeroKnowledge Proofs
- Security of Blind Digital Signatures (Revised Extended Abstract)
- Memory-E cient and Self-Stabilizing Network Extended Abstract
- Extracting Correlations Yuval Ishai
- Fast Digital Identity Revocation Extended Abstract
- Matching nuts and bolts Extended Abstract
- Perfect ZeroKnowledge in Constant Rounds Mihir Bellare \Lambda Silvio Micali y Rafail Ostrovsky z
- Proc. 10th ACM Conf. on Principles of Distributed Systems, August 1991 1 How To Withstand Mobile Virus Attacks
- Private Information Storage Extended Abstract
- Zero-Knowledge from Secure Multiparty Computation Yuval Ishai
- Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems
- Improved Algorithms for Optimal Embeddings (This paper supersedes previous versions that appear in ACM Transactions of Algorithms, August 2008 and
- Instance-Hiding Proof Systems D. Beavery J. Feigenbaumz R. Ostrovskyx V. Shoup{
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Round Eciency of Multi-Party Computation with a Dishonest Majority
- Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems
- Attribute-Based Encryption with Non-Monotonic Access Structures
- Sufficient Conditions for Collision-Resistant Hashing
- Measuring Independence of Datasets Vladimir Braverman
- NonInteractive and NonMalleable Commitment \Lambda Giovanni Di Crescenzo y Yuval Ishai z Rafail Ostrovsky x
- XorTrees for Efficient Anonymous Multicast and Reception \Lambda Shlomi Dolev y Rafail Ostrovsky z
- ZeroOne Frequency Laws Vladimir Braverman #
- OneWay Functions are Essential for NonTrivial ZeroKnowledge
- Minimal Complete Primitives for Secure MultiParty Computation
- Optimal and Efficient Clock Synchronization Under Drifting Clocks
- Batch Codes and Their Applications Yuval Ishai # Eyal Kushilevitz + Rafail Ostrovsky # Amit Sahai
- Polynomial End-to-End Communication Eyal Kushilevitzy Rafail Ostrovskyz Adi Ros enx
- IdentityBased ZeroKnowledge Jonathan Katz 1# Rafail Ostrovsky 2## Michael O. Rabin 3
- Secure Commitment Against A Powerful Adversary A security primitive based on average intractability
- Randomness versus FaultTolerance \Lambda Ran Canetti y Eyal Kushilevitz z Rafail Ostrovsky x Adi Ros'en --
- Faster Computation On Directed Networks of Automata \Lambda
- Replication Is Not Needed: Single Database, Computationally-Private Information Retrieval
- Perfect ZeroKnowledge Arguments for NP Can Be Based on
- Reducibility and Completeness In Private Computations \Lambda
- The LasVegas Processor Identity Problem (How and When to Be Unique) \Lambda
- AttributeBased Encryption with NonMonotonic Access Structures
- Secure Remote Authentication Using Biometric Data
- Position Based Cryptography # Nishanth Chandran Vipul Goyal + Ryan Moriarty Rafail Ostrovsky #
- Visual Cryptography on Graphs University of California, Los Angeles
- Simple and Efficient Leader Election in the Full Information Model \Lambda
- On Complete Primitives for Fairness Dov Gordon 1,# , Yuval Ishai 2,3,## , Tal Moran 4 , Rafail Ostrovsky 3,# # # , and Amit
- Round-Optimal Secure Two-Party Computation Jonathan Katz 1 Rafail Ostrovsky 2
