Travelled to:1 × Canada
1 × Denmark
1 × Finland
1 × France
1 × Japan
1 × Latvia
1 × Poland
1 × Spain
2 × Greece
6 × USA
Collaborated with:E.Kushilevitz R.Ostrovsky A.Sahai T.Malkin A.Beimel H.Wee B.Dubrov R.N.Wright K.Nissim M.Prabhakaran B.Applebaum O.Barkol E.Weinreb G.D.Crescenzo S.Agrawal D.Khurana A.Paskin-Cherniavsky M.J.Strauss Y.Lindell E.Petrank R.Gennaro T.Rabin Y.Gertner D.Genkin E.Tromer P.Harsha J.Kilian S.Venkatesh J.Feigenbaum M.Strauss X.Li D.Zuckerman
Talks about:comput (8) secur (7) inform (6) privat (5) retriev (4) multiparti (3) theoret (3) complex (3) random (3) applic (3)
Person: Yuval Ishai
DBLP: Ishai:Yuval
Contributed to:
20152014
20142013201020082007200720062004200420022001200119991998Wrote 21 papers:
- ICALP-v1-2015-AgrawalIKP #complexity #encoding #perspective #random #statistics
- Statistical Randomized Encodings: A Complexity Theoretic View (SA, YI, DK, APC), pp. 1–13.
- ICALP-v1-2014-IshaiW
- Partial Garbling Schemes and Their Applications (YI, HW), pp. 650–662.
- STOC-2014-GenkinIPST
- Circuits resilient to additive attacks with applications to secure computation (DG, YI, MP, AS, ET), pp. 495–504.
- 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.
- STOC-2008-BarkolIW #communication #replication
- Communication in the presence of replication (OB, YI, EW), pp. 661–670.
- STOC-2008-IshaiKOS #constant #encryption
- Cryptography with constant computational overhead (YI, EK, RO, AS), pp. 433–442.
- ICALP-2007-IshaiMSW #approximate #multi
- Private Multiparty Sampling and Approximation of Vector Combinations (YI, TM, MJS, RNW), pp. 243–254.
- STOC-2007-IshaiKOS #multi
- Zero-knowledge from secure multiparty computation (YI, EK, RO, AS), pp. 21–30.
- STOC-2006-DubrovI #complexity #on the #performance
- On the randomness complexity of efficient sampling (BD, YI), pp. 711–720.
- STOC-2006-IshaiKLP #black box
- Black-box constructions for secure computation (YI, EK, YL, EP), pp. 99–108.
- ICALP-2004-HarshaIKNV #communication
- Communication Versus Computation (PH, YI, JK, KN, SV), pp. 745–756.
- STOC-2004-IshaiKOS
- Batch codes and their applications (YI, EK, RO, AS), pp. 262–271.
- ICALP-2002-IshaiK
- Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials (YI, EK), pp. 244–256.
- ICALP-2001-BeimelI #information retrieval
- Information-Theoretic Private Information Retrieval: A Unified Construction (AB, YI), pp. 912–926.
- ICALP-2001-FeigenbaumIMNSW #approximate #multi
- Secure Multiparty Computation of Approximations (JF, YI, TM, KN, MS, RNW), pp. 927–938.
- STOC-2001-GennaroIKR #complexity #multi
- The round complexity of verifiable secret sharing and secure multicast (RG, YI, EK, TR), pp. 580–589.
- 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-CrescenzoIO
- Non-Interactive and Non-Malleable Commitment (GDC, YI, RO), pp. 141–150.
- STOC-1998-GertnerIKM #information retrieval #privacy
- Protecting Data Privacy in Private Information Retrieval Schemes (YG, YI, EK, TM), pp. 151–160.