BibSLEIGH — Rafail

Travelled to:

1 × Denmark
1 × Finland
1 × France
1 × Iceland
1 × Latvia
1 × Poland
1 × Switzerland
13 × USA
2 × United Kingdom
4 × Canada

Collaborated with:

E.Kushilevitz Y.Rabani V.Braverman A.Sahai I.Visconti Y.Ishai N.Chandran A.Rosén R.Canetti G.Persiano J.A.Garay A.Borodin M.Bellare S.Micali A.Scafuro P.Bunn W.Aiello V.Shoup ∅ D.Vilenchik B.Hemenway M.Wootters J.Baron R.Gelles K.Winoto C.Zaniolo O.Pandey C.Rackoff A.Smith G.D.Crescenzo N.Linial O.Goldreich E.Petrank S.Rajagopalan U.V.Vazirani S.Garg S.Lu V.Goyal B.Kanukurthi L.Reyzin Y.Lindell S.N.Bhatt S.Rajagopalan A.J.Mayer Y.Ofek M.Yung X.Li M.Prabhakaran D.Zuckerman

Talks about:

knowledg (7) comput (7) zero (7) constant (4) complex (4) effici (4) space (4) secur (4) non (4) dimension (3)

Person: Rafail Ostrovsky

DBLP: Ostrovsky:Rafail

Contributed to:

2015

2014

2013

2012

2010

2009

2008

2007

2005

2004

2002

2000

1999

1998

1997

1996

1995

1994

1992

1990

Wrote 41 papers:

STOC-2015-GargLOS #ram: Garbled RAM From One-Way Functions (SG, SL, RO, AS), pp. 449–458.
ICALP-v1-2014-OstrovskyPV #on the #proving: On Input Indistinguishable Proof Systems (RO, GP, IV), pp. 895–906.
STOC-2014-GoyalOSV #black box: Black-box non-black-box zero knowledge (VG, RO, AS, IV), pp. 515–524.
ICALP-v1-2013-BravermanOV #how #question #streaming: How Hard Is Counting Triangles in the Streaming Model? (VB, RO, DV), pp. 244–254.
ICALP-v1-2013-HemenwayOW: Local Correctability of Expander Codes (BH, RO, MW), pp. 540–551.
ICALP-v1-2013-IshaiKLOPSZ #generative #pseudo #robust: Robust Pseudorandom Generators (YI, EK, XL, RO, MP, AS, DZ), pp. 576–588.
ICALP-v1-2012-BaronOV #black box: Nearly Simultaneously Resettable Black-Box Zero Knowledge (JB, RO, IV), pp. 88–99.
ICALP-v2-2012-ChandranGO #fault tolerance #network: Edge Fault Tolerance on Sparse Networks (NC, JAG, RO), pp. 452–463.
ICALP-v2-2012-GellesOW #multi #proximity #similarity #testing: Multiparty Proximity Testing with Dishonest Majority from Equality Testing (RG, RO, KW), pp. 537–548.
ICALP-v2-2010-BunnO #network: Asynchronous Throughput-Optimal Routing in Malicious Networks (PB, RO), pp. 236–248.
ICALP-v2-2010-ChandranGO #fault tolerance #network: Improved Fault Tolerance and Secure Computation on Sparse Networks (NC, JAG, RO), pp. 249–260.
STOC-2010-BravermanO #dataset #independence: Measuring independence of datasets (VB, RO), pp. 271–280.
STOC-2010-BravermanO10a: Zero-one frequency laws (VB, RO), pp. 281–290.
STOC-2010-ChandranKOR #privacy: Privacy amplification with asymptotically optimal entropy loss (NC, BK, RO, LR), pp. 785–794.
PODS-2009-BravermanOZ: Optimal sampling from sliding windows (VB, RO, CZ), pp. 147–156.
ICALP-C-2008-OstrovskyPV #concurrent: Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (RO, GP, IV), pp. 548–559.
STOC-2008-IshaiKOS #constant #encryption: Cryptography with constant computational overhead (YI, EK, RO, AS), pp. 433–442.
ICALP-2007-OstrovskyPS: Private Locally Decodable Codes (RO, OP, AS), pp. 387–398.
STOC-2007-IshaiKOS #multi: Zero-knowledge from secure multiparty computation (YI, EK, RO, AS), pp. 21–30.
STOC-2005-OstrovskyR #distance #edit distance: Low distortion embeddings for edit distance (RO, YR), pp. 218–224.
ICALP-2004-OstrovskyRS #commit #consistency #database #performance #proving #query: Efficient Consistency Proofs for Generalized Queries on a Committed Database (RO, CR, AS), pp. 1041–1053.
STOC-2004-IshaiKOS: Batch codes and their applications (YI, EK, RO, AS), pp. 262–271.
STOC-2002-CanettiLOS #composition #multi: Universally composable two-party and multi-party secure computation (RC, YL, RO, AS), pp. 494–503.
ICALP-2000-AielloBOR #performance #proving #verification: Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP (WA, SNB, RO, SR), pp. 463–474.
STOC-1999-BorodinOR #bound #nearest neighbour #problem: Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems (AB, RO, YR), pp. 312–321.
STOC-1999-BorodinOR99a #algorithm #approximate #clustering #problem: Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces (AB, RO, YR), pp. 435–444.
STOC-1999-CanettiO #question #what: Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (RC, RO), pp. 255–264.
STOC-1998-AielloKOR #adaptation: Adaptive Packet Routing for Bursty Adversarial Traffic (WA, EK, RO, AR), pp. 359–368.
STOC-1998-CrescenzoIO: Non-Interactive and Non-Malleable Commitment (GDC, YI, RO), pp. 141–150.
STOC-1998-KushilevitzOR #approximate #nearest neighbour #performance: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces (EK, RO, YR), pp. 614–623.
STOC-1997-OstrovskyR #algorithm: Universal O(Congestion + Dilation + log1+epsilonN) Local Control Packet Switching Algorithms (RO, YR), pp. 644–653.
STOC-1997-OstrovskyS: Private Information Storage (RO, VS), pp. 294–303.
STOC-1996-KushilevitzLO #communication #complexity: The Linear-Array Conjecture in Communication Complexity is False (EK, NL, RO), pp. 1–10.
STOC-1996-KushilevitzOR #linear #privacy: Characterizing Linear Size Circuits in Terms of Privacy (EK, RO, AR), pp. 541–550.
STOC-1995-KushilevitzOR #communication #polynomial: Log-space polynomial end-to-end communication (EK, RO, AR), pp. 559–568.
STOC-1994-GoldreichOP #complexity: Computational complexity and knowledge complexity (OG, RO, EP), pp. 534–543.
STOC-1994-OstrovskyRV #performance: Simple and efficient leader election in the full information model (RO, SR, UVV), pp. 234–242.
STOC-1992-MayerOOY #self #symmetry: Self-Stabilizing Symmetry Breaking in Constant-Space (AJM, YO, RO, MY), pp. 667–678.
STOC-1990-BellareMO #constant: Perfect Zero-Knowledge in Constant Rounds (MB, SM, RO), pp. 482–493.
STOC-1990-BellareMO90a #complexity #statistics: The (True) Complexity of Statistical Zero Knowledge (MB, SM, RO), pp. 494–502.
STOC-1990-Ostrovsky #performance: Efficient Computation on Oblivious RAMs (RO), pp. 514–523.