BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Finland
1 × France
1 × Latvia
1 × Spain
13 × USA
2 × Greece
Collaborated with:
Y.Ishai R.Ostrovsky E.Weinreb Y.Mansour A.Rosén A.Sahai Y.Lindell T.Rabin A.Beimel S.Halevy T.Malkin B.Chor D.Zuckerman B.Applebaum J.Draisma H.Kaplan Y.Rabani S.Ben-David N.H.Bshouty N.Linial S.B.Daniel E.Petrank R.Gennaro S.Halevi R.Krauthgamer K.Nissim W.Aiello Y.Gertner M.O.Rabin X.Li M.Prabhakaran
Talks about:
secur (7) complex (6) communic (5) inform (5) comput (5) privat (4) retriev (3) privaci (3) learn (3) multiparti (2)

Person: Eyal Kushilevitz

DBLP DBLP: Kushilevitz:Eyal

Contributed to:

ICALP (1) 20132013
ICALP (1) 20102010
ICALP (1) 20092009
STOC 20092009
STOC 20082008
STOC 20072007
STOC 20062006
STOC 20052005
ICALP 20042004
STOC 20042004
ICALP 20022002
STOC 20012001
STOC 19991999
STOC 19981998
STOC 19971997
STOC 19961996
STOC 19951995
STOC 19931993
STOC 19911991
STOC 19891989

Wrote 27 papers:

ICALP-v1-2013-IshaiKLOPSZ #generative #pseudo #robust
Robust Pseudorandom Generators (YI, EK, XL, RO, MP, AS, DZ), pp. 576–588.
ICALP-v1-2010-ApplebaumIK #performance #verification
From Secrecy to Soundness: Efficient Verification via Secure Computation (BA, YI, EK), pp. 152–163.
ICALP-v1-2010-BeimelDKW #communication #complexity
Choosing, Agreeing, and Eliminating in Communication Complexity (AB, SBD, EK, EW), pp. 451–462.
ICALP-v1-2009-DraismaKW #communication #complexity #multi
Partition Arguments in Multiparty Communication Complexity (JD, EK, EW), pp. 390–402.
STOC-2009-KushilevitzW #communication #complexity #on the
On the complexity of communication complexity (EK, EW), pp. 465–474.
STOC-2008-IshaiKOS #constant #encryption
Cryptography with constant computational overhead (YI, EK, RO, AS), pp. 433–442.
STOC-2007-IshaiKOS #multi
Zero-knowledge from secure multiparty computation (YI, EK, RO, AS), pp. 21–30.
STOC-2006-IshaiKLP #black box
Black-box constructions for secure computation (YI, EK, YL, EP), pp. 99–108.
STOC-2006-KushilevitzLR #composition #protocol #security
Information-theoretically secure protocols and security under composition (EK, YL, TR), pp. 109–118.
STOC-2005-KaplanKM #learning
Learning with attribute costs (HK, EK, YM), pp. 356–365.
ICALP-2004-HalevyK #graph #testing
Testing Monotonicity over Graph Products (SH, EK), pp. 721–732.
Batch codes and their applications (YI, EK, RO, AS), pp. 262–271.
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials (YI, EK), pp. 244–256.
STOC-2001-GennaroIKR #complexity #multi
The round complexity of verifiable secret sharing and secure multicast (RG, YI, EK, TR), pp. 580–589.
STOC-2001-HaleviKKN #approximate #np-hard
Private approximation of NP-hard functions (SH, RK, EK, KN), pp. 550–559.
STOC-1999-BeimelIKM #information retrieval
One-Way Functions Are Essential for Single-Server Private Information Retrieval (AB, YI, EK, TM), pp. 89–98.
STOC-1999-IshaiK #bound #information retrieval
Improved Upper Bounds on Information-Theoretic Private Information Retrieval (YI, EK), pp. 79–88.
STOC-1998-AielloKOR #adaptation
Adaptive Packet Routing for Bursty Adversarial Traffic (WA, EK, RO, AR), pp. 359–368.
STOC-1998-GertnerIKM #information retrieval #privacy
Protecting Data Privacy in Private Information Retrieval Schemes (YG, YI, EK, TM), pp. 151–160.
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-Ben-DavidBK #algorithm #composition #concept #geometry #learning #theorem
A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes (SBD, NHB, EK), pp. 324–333.
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-1993-KushilevitzMRZ #bound #random
Lower bounds for randomized mutual exclusion (EK, YM, MOR, DZ), pp. 154–163.
STOC-1991-KushilevitzM #fourier #learning #using
Learning Decision Trees Using the Fourier Sprectrum (EK, YM), pp. 455–464.
STOC-1989-ChorK #privacy
A Zero-One Law for Boolean Privacy (BC, EK), pp. 62–72.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.