Eyal Kushilevitz
Technion - Israel Institute of Technology, Haifa, Israel
http://www.cs.technion.ac.il/~eyalk/
https://scholar.google.com/citations?user=gUGK3TYAAAAJ
https://zbmath.org/authors/?q=ai:kushilevitz.eyal
https://mathgenealogy.org/id.php?id=102880
https://www.wikidata.org/entity/Q27996487
https://mathscinet.ams.org/mathscinet/MRAuthorID/277224
https://dl.acm.org/profile/81100383717
https://orcid.org/0009-0009-9277-3863
Shai Halevi
Yuval Ishai
Eyal Kushilevitz
Tal Rabin
Additive Randomized Encodings and Their Applications.
203-235
2023
CRYPTO (1)
https://doi.org/10.1007/978-3-031-38557-5_7
conf/crypto/2023-1
db/conf/crypto/crypto2023-1.html#HaleviIKR23
Bernardo David
Giovanni Deligios
Aarushi Goel
Yuval Ishai
Anders Konring
Eyal Kushilevitz
Chen-Da Liu-Zhang
Varun Narayanan
Perfect MPC over Layered Graphs.
360-392
2023
CRYPTO (1)
https://doi.org/10.1007/978-3-031-38557-5_12
conf/crypto/2023-1
db/conf/crypto/crypto2023-1.html#DavidDGIKKLN23
Riddhi Ghosal
Yuval Ishai
Alexis Korb
Eyal Kushilevitz
Paul Lou
Amit Sahai
Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness.
1243-1256
2023
STOC
https://doi.org/10.1145/3564246.3585119
conf/stoc/2023
db/conf/stoc/stoc2023.html#GhosalIKKLS23
Benny Applebaum
Amos Beimel
Yuval Ishai
Eyal Kushilevitz
Tianren Liu
Vinod Vaikuntanathan
Succinct Computational Secret Sharing.
1553-1566
2023
STOC
https://doi.org/10.1145/3564246.3585127
conf/stoc/2023
db/conf/stoc/stoc2023.html#ApplebaumBIKLV23
Paul Bunn
Eyal Kushilevitz
Rafail Ostrovsky
Anonymous Permutation Routing.
33-61
2023
TCC (3)
https://doi.org/10.1007/978-3-031-48621-0_2
conf/tcc/2023-3
db/conf/tcc/tcc2023-3.html#BunnKO23
Damiano Abram
Amos Beimel
Yuval Ishai
Eyal Kushilevitz
Varun Narayanan
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages.
286-315
2023
TCC (1)
https://doi.org/10.1007/978-3-031-48615-9_11
conf/tcc/2023-1
db/conf/tcc/tcc2023-1.html#AbramBIKN23
Benny Applebaum
Amos Beimel
Yuval Ishai
Eyal Kushilevitz
Tianren Liu
Vinod Vaikuntanathan
Succinct Computational Secret Sharing.
TR23-091
2023
TR23
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2023/091
db/journals/eccc/eccc2023.html#ApplebaumBIKLV23
Riddhi Ghosal
Yuval Ishai
Alexis Korb
Eyal Kushilevitz
Paul Lou
Amit Sahai
Hard Languages in $\text{NP}\cap\text{coNP}$ and NIZK Proofs from Unstructured Hardness.
TR23-213
2023
TR23
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2023/213
db/journals/eccc/eccc2023.html#GhosalIKKLS23
Bernardo David
Anders Konring
Yuval Ishai
Eyal Kushilevitz
Varun Narayanan
Perfect MPC over Layered Graphs.
330
2023
2023
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2023/330
db/journals/iacr/iacr2023.html#DavidKIKN23
Shai Halevi
Yuval Ishai
Eyal Kushilevitz
Tal Rabin
Additive Randomized Encodings and Their Applications.
870
2023
2023
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2023/870
db/journals/iacr/iacr2023.html#HaleviIKR23
Benny Applebaum
Amos Beimel
Yuval Ishai
Eyal Kushilevitz
Tianren Liu
Vinod Vaikuntanathan
Succinct Computational Secret Sharing.
955
2023
2023
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2023/955
db/journals/iacr/iacr2023.html#ApplebaumBIKLV23
Damiano Abram
Amos Beimel
Yuval Ishai
Eyal Kushilevitz
Varun Narayanan
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages.
1929
2023
2023
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2023/1929
db/journals/iacr/iacr2023.html#AbramBIKN23
Riddhi Ghosal
Yuval Ishai
Alexis Korb
Eyal Kushilevitz
Paul Lou
Amit Sahai
Hard Languages in $\mathsf{NP} \cap \mathsf{coNP}$ and NIZK Proofs from Unstructured Hardness.
1972
2023
2023
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2023/1972
db/journals/iacr/iacr2023.html#GhosalIKKLS23
Paul Bunn
Eyal Kushilevitz
Rafail Ostrovsky
CNF-FSS and Its Applications.
283-314
2022
Public Key Cryptography (1)
https://doi.org/10.1007/978-3-030-97121-2_11
conf/pkc/2022-1
db/conf/pkc/pkc2022-1.html#BunnKO22
Shai Halevi
Eyal Kushilevitz
Random-Index Oblivious RAM.
33-59
2022
TCC (3)
https://doi.org/10.1007/978-3-031-22368-6_2
conf/tcc/2022-3
db/conf/tcc/tcc2022-3.html#HaleviK22
Shai Halevi
Eyal Kushilevitz
Random-Index Oblivious RAM.
982
2022
2022
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2022/982
db/journals/iacr/iacr2022.html#HaleviK22
Paul Bunn
Eyal Kushilevitz
Rafail Ostrovsky
Anonymous Permutation Routing.
1353
2022
2022
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2022/1353
db/journals/iacr/iacr2022.html#BunnKO22
Sameer Wagh
Shruti Tople
Fabrice Benhamouda
Eyal Kushilevitz
Prateek Mittal
Tal Rabin
Falcon: Honest-Majority Maliciously Secure Framework for Private Deep Learning.
188-208
2021
2021
Proc. Priv. Enhancing Technol.
1
https://doi.org/10.2478/popets-2021-0011
https://www.wikidata.org/entity/Q109039654
db/journals/popets/popets2021.html#WaghTBKMR21
Eyal Kushilevitz
Rafail Ostrovsky
Emmanuel Prouff
Adi Rosén
Adrian Thillard
Damien Vergnaud
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND.
465-484
2021
35
SIAM J. Discret. Math.
1
https://doi.org/10.1137/20M1314197
db/journals/siamdm/siamdm35.html#KushilevitzOPRT21
Shweta Agrawal
Yuval Ishai
Eyal Kushilevitz
Varun Narayanan
Manoj Prabhakaran
Vinod M. Prabhakaran
Alon Rosen
Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration.
124-154
2021
CRYPTO (2)
https://doi.org/10.1007/978-3-030-84245-1_5
conf/crypto/2021-2
db/conf/crypto/crypto2021-2.html#AgrawalIKNPPR21
Paul Bunn
Eyal Kushilevitz
Rafail Ostrovsky
CNF-FSS and its Applications.
163
2021
2021
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2021/163
db/journals/iacr/iacr2021.html#BunnKO21
Shweta Agrawal
Yuval Ishai
Eyal Kushilevitz
Varun Narayanan
Manoj Prabhakaran
Vinod M. Prabhakaran
Alon Rosen
Cryptography from One-Way Communication: On Completeness of Finite Channels.
653-685
2020
ASIACRYPT (3)
https://doi.org/10.1007/978-3-030-64840-4_22
conf/asiacrypt/2020-3
db/conf/asiacrypt/asiacrypt2020-3.html#AgrawalIKNPPR20
Paul Bunn
Jonathan Katz
Eyal Kushilevitz
Rafail Ostrovsky
Efficient 3-Party Distributed ORAM.
215-232
2020
SCN
https://doi.org/10.1007/978-3-030-57990-6_11
conf/scn/2020
db/conf/scn/scn2020.html#BunnKKO20
Sameer Wagh
Shruti Tople
Fabrice Benhamouda
Eyal Kushilevitz
Prateek Mittal
Tal Rabin
FALCON: Honest-Majority Maliciously Secure Framework for Private Deep Learning.
2020
abs/2004.02229
CoRR
https://arxiv.org/abs/2004.02229
db/journals/corr/corr2004.html#abs-2004-02229
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Amit Sahai
Cryptographic Sensing.
583-604
2019
CRYPTO (3)
https://doi.org/10.1007/978-3-030-26954-8_19
conf/crypto/2019-3
db/conf/crypto/crypto2019-3.html#IshaiKOS19
Eyal Kushilevitz
Tamer Mour
Sub-logarithmic Distributed Oblivious RAM with Small Block Size.
3-33
2019
Public Key Cryptography (1)
https://doi.org/10.1007/978-3-030-17253-4_1
conf/pkc/2019-1
db/conf/pkc/pkc2019-1.html#KushilevitzM19
Shai Halevi
Yuval Ishai
Eyal Kushilevitz
Nikolaos Makriyannis
Tal Rabin
On Fully Secure MPC with Solitary Output.
312-340
2019
TCC (1)
https://doi.org/10.1007/978-3-030-36030-6_13
conf/tcc/2019-1
db/conf/tcc/tcc2019-1.html#HaleviIKMR19
Eyal Kushilevitz
Rafail Ostrovsky
Emmanuel Prouff
Adi Rosén
Adrian Thillard
Damien Vergnaud
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND.
386-406
2019
TCC (2)
https://doi.org/10.1007/978-3-030-36033-7_15
conf/tcc/2019-2
db/conf/tcc/tcc2019-2.html#KushilevitzOPRT19
Eyal Kushilevitz
Tamer Mour
Sub-logarithmic Distributed Oblivious RAM with Small Block Size.
48
2019
2019
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2019/048
db/journals/iacr/iacr2019.html#KushilevitzM19
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Amit Sahai
Cryptographic Sensing.
637
2019
2019
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2019/637
db/journals/iacr/iacr2019.html#IshaiKOS19
Shai Halevi
Yuval Ishai
Eyal Kushilevitz
Nikolaos Makriyannis
Tal Rabin
On Fully Secure MPC with Solitary Output.
1032
2019
2019
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2019/1032
db/journals/iacr/iacr2019.html#HaleviIKMR19
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings.
1-22
2018
31
J. Cryptol.
1
https://doi.org/10.1007/s00145-016-9244-6
db/journals/joc/joc31.html#ApplebaumIK18
Amos Beimel
Eyal Kushilevitz
Pnina Nissim
The Complexity of Multiparty PSM Protocols and Related Models.
287-318
2018
EUROCRYPT (2)
https://doi.org/10.1007/978-3-319-78375-8_10
conf/eurocrypt/2018-2
db/conf/eurocrypt/eurocrypt2018-2.html#BeimelKN18
Shai Halevi
Yuval Ishai
Eyal Kushilevitz
Tal Rabin
Best Possible Information-Theoretic MPC.
255-281
2018
TCC (2)
https://doi.org/10.1007/978-3-030-03810-6_10
conf/tcc/2018-2
db/conf/tcc/tcc2018-2.html#HaleviIKR18
Eyal Kushilevitz
Tamer Mour
Sub-logarithmic Distributed Oblivious RAM with Small Block Size.
2018
abs/1802.05145
CoRR
http://arxiv.org/abs/1802.05145
db/journals/corr/corr1802.html#abs-1802-05145
Amos Beimel
Eyal Kushilevitz
Pnina Nissim
The Complexity of Multiparty PSM Protocols and Related Models.
148
2018
2018
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2018/148
db/journals/iacr/iacr2018.html#BeimelKN18
Paul Bunn
Jonathan Katz
Eyal Kushilevitz
Rafail Ostrovsky
Efficient 3-Party Distributed ORAM.
706
2018
2018
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2018/706
db/journals/iacr/iacr2018.html#BunnKKO18
Shai Halevi
Yuval Ishai
Eyal Kushilevitz
Tal Rabin
Best Possible Information-Theoretic MPC.
913
2018
2018
IACR Cryptol. ePrint Arch.
https://eprint.iacr.org/2018/913
db/journals/iacr/iacr2018.html#HaleviIKR18
Amos Beimel
Yuval Ishai
Eyal Kushilevitz
Ad Hoc PSM Protocols: Secure Computation Without Coordination.
580-608
2017
EUROCRYPT (3)
https://doi.org/10.1007/978-3-319-56617-7_20
conf/eurocrypt/2017-3
db/conf/eurocrypt/eurocrypt2017-3.html#BeimelIK17
Benny Applebaum
Naama Haramaty
Yuval Ishai
Eyal Kushilevitz
Vinod Vaikuntanathan
Low-Complexity Cryptographic Hash Functions .
7:1-7:31
2017
ITCS
https://doi.org/10.4230/LIPIcs.ITCS.2017.7
conf/innovations/2017
db/conf/innovations/innovations2017.html#ApplebaumHIKV17
Itay Hazan
Eyal Kushilevitz
Two-Party Direct-Sum Questions Through the Lens of Multiparty Communication Complexity.
26:1-26:15
2017
DISC
https://doi.org/10.4230/LIPIcs.DISC.2017.26
conf/wdag/2017
db/conf/wdag/disc2017.html#HazanK17
Benny Applebaum
Naama Haramaty
Yuval Ishai
Eyal Kushilevitz
Vinod Vaikuntanathan
Low-Complexity Cryptographic Hash Functions.
TR17-008
2017
TR17
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2017/008
db/journals/eccc/eccc24.html#ApplebaumHIKV17
Benny Applebaum
Naama Haramaty
Yuval Ishai
Eyal Kushilevitz
Vinod Vaikuntanathan
Low-Complexity Cryptographic Hash Functions.
36
2017
2017
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2017/036
db/journals/iacr/iacr2017.html#ApplebaumHIKV17
Amos Beimel
Yuval Ishai
Eyal Kushilevitz
Ad Hoc PSM Protocols: Secure Computation Without Coordination.
147
2017
2017
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2017/147
db/journals/iacr/iacr2017.html#BeimelIK17
Yuval Ishai
Eyal Kushilevitz
Manoj Prabhakaran
Amit Sahai
Ching-Hua Yu
Secure Protocol Transformations.
430-458
2016
CRYPTO (2)
https://doi.org/10.1007/978-3-662-53008-5_15
conf/crypto/2016-2
db/conf/crypto/crypto2016-2.html#IshaiKPSY16
Yuval Ishai
Eyal Kushilevitz
Steve Lu 0001
Rafail Ostrovsky
Private Large-Scale Databases with Distributed Searchable Symmetric Encryption.
90-107
2016
CT-RSA
https://doi.org/10.1007/978-3-319-29485-8_6
conf/ctrsa/2016
db/conf/ctrsa/ctrsa2016.html#IshaiKLO16
Amos Beimel
Ariel Gabizon
Yuval Ishai
Eyal Kushilevitz
Distribution Design.
81-92
2016
ITCS
https://doi.org/10.1145/2840728.2840759
conf/innovations/2016
db/conf/innovations/innovations2016.html#BeimelGIK16
Shai Halevi
Yuval Ishai
Abhishek Jain 0002
Eyal Kushilevitz
Tal Rabin
Secure Multiparty Computation with General Interaction Patterns.
157-168
2016
ITCS
https://doi.org/10.1145/2840728.2840760
conf/innovations/2016
db/conf/innovations/innovations2016.html#HaleviIJKR16
Eyal Kushilevitz
Tal Malkin
Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I
TCC (A1)
Springer
2016
Lecture Notes in Computer Science
9562
978-3-662-49095-2
https://doi.org/10.1007/978-3-662-49096-9
db/conf/tcc/tcc2016a1.html
Eyal Kushilevitz
Tal Malkin
Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part II
TCC (A2)
Springer
2016
Lecture Notes in Computer Science
9563
978-3-662-49098-3
https://doi.org/10.1007/978-3-662-49099-0
db/conf/tcc/tcc2016a2.html
Yuval Ishai
Eyal Kushilevitz
Manoj Prabhakaran
Amit Sahai
Ching-Hua Yu
Secure Protocol Transformations.
456
2016
2016
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2016/456
db/journals/iacr/iacr2016.html#IshaiKPSY16
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
Brent Waters
Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys.
433-466
2015
44
SIAM J. Comput.
2
https://doi.org/10.1137/130929643
db/journals/siamcomp/siamcomp44.html#ApplebaumIKW15
Sanjam Garg
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Amit Sahai
Cryptography with One-Way Communication.
191-208
2015
CRYPTO (2)
https://doi.org/10.1007/978-3-662-48000-7_10
conf/crypto/2015-2
db/conf/crypto/crypto2015-2.html#GargIKOS15
Yuval Ishai
Ranjit Kumaresan
Eyal Kushilevitz
Anat Paskin-Cherniavsky
Secure Computation with Minimal Interaction, Revisited.
359-378
2015
CRYPTO (2)
https://doi.org/10.1007/978-3-662-48000-7_18
conf/crypto/2015-2
db/conf/crypto/crypto2015-2.html#IshaiKKP15
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
Minimizing Locality of One-Way Functions via Semi-Private Randomized Encodings.
TR15-045
2015
TR15
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2015/045
db/journals/eccc/eccc22.html#ApplebaumIK15
Shai Halevi
Yuval Ishai
Abhishek Jain 0002
Eyal Kushilevitz
Tal Rabin
Secure Multiparty Computation with General Interaction Patterns.
1173
2015
2015
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2015/1173
db/journals/iacr/iacr2015.html#HaleviIJKR15
Yuval Ishai
Eyal Kushilevitz
Steve Lu 0001
Rafail Ostrovsky
Private Large-Scale Databases with Distributed Searchable Symmetric Encryption.
1190
2015
2015
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2015/1190
db/journals/iacr/iacr2015.html#IshalKLO15
Amos Beimel
Sebastian Ben Daniel
Eyal Kushilevitz
Enav Weinreb
Choosing, Agreeing, and Eliminating in Communication Complexity.
1-42
2014
23
Comput. Complex.
1
https://doi.org/10.1007/s00037-013-0075-7
db/journals/cc/cc23.html#BeimelDKW14
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
How to Garble Arithmetic Circuits.
905-929
2014
43
SIAM J. Comput.
2
https://doi.org/10.1137/120875193
db/journals/siamcomp/siamcomp43.html#ApplebaumIK14
Amos Beimel
Ariel Gabizon
Yuval Ishai
Eyal Kushilevitz
Sigurd Meldgaard
Anat Paskin-Cherniavsky
Non-Interactive Secure Multiparty Computation.
387-404
2014
CRYPTO (2)
https://doi.org/10.1007/978-3-662-44381-1_22
conf/crypto/2014-2
db/conf/crypto/crypto2014-2.html#BeimelGIKMP14
Amos Beimel
Yuval Ishai
Ranjit Kumaresan
Eyal Kushilevitz
On the Cryptographic Complexity of the Worst Functions.
317-342
2014
TCC
https://doi.org/10.1007/978-3-642-54242-8_14
conf/tcc/2014
db/conf/tcc/tcc2014.html#BeimelIKK14
Eldar Aharoni
Eyal Kushilevitz
On the Power of Multiplexing in Number-on-the-Forehead Protocols.
2014
abs/1402.5311
CoRR
http://arxiv.org/abs/1402.5311
db/journals/corr/corr1402.html#AharoniK14
Sanjam Garg
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Amit Sahai
Cryptography with One-Way Communication.
914
2014
2014
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2014/914
db/journals/iacr/iacr2014.html#GargIKOS14
Amos Beimel
Ariel Gabizon
Yuval Ishai
Eyal Kushilevitz
Sigurd Meldgaard
Anat Paskin-Cherniavsky
Non-Interactive Secure Multiparty Computation.
960
2014
2014
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2014/960
db/journals/iacr/iacr2014.html#BeimelGIKMP14
Panganamala Ramana Kumar
Eyal Kushilevitz
D. Manjunath
Muriel Médard
Alon Orlitsky
R. Srikant 0001
Guest Editorial: In-Network Computation: Exploring the Fundamental Limits.
617-619
2013
31
IEEE J. Sel. Areas Commun.
4
https://doi.org/10.1109/JSAC.2013.130401
db/journals/jsac/jsac31.html#KumarKMMOS13
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
Brent Waters
Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys.
166-184
2013
CRYPTO (2)
https://doi.org/10.1007/978-3-642-40084-1_10
conf/crypto/2013-2
db/conf/crypto/crypto2013-2.html#ApplebaumIKW13
Yuval Ishai
Eyal Kushilevitz
Xin Li 0006
Rafail Ostrovsky
Manoj Prabhakaran
Amit Sahai
David Zuckerman
Robust Pseudorandom Generators.
576-588
2013
ICALP (1)
https://doi.org/10.1007/978-3-642-39206-1_49
conf/icalp/2013-1
db/conf/icalp/icalp2013-1.html#IshaiKLOPSZ13
Yuval Ishai
Eyal Kushilevitz
Omer Strulovich
Lossy Chains and Fractional Secret Sharing.
160-171
2013
STACS
https://doi.org/10.4230/LIPIcs.STACS.2013.160
conf/stacs/2013
db/conf/stacs/stacs2013.html#IshaiKS13
Yuval Ishai
Eyal Kushilevitz
Sigurd Meldgaard
Claudio Orlandi
Anat Paskin-Cherniavsky
On the Power of Correlated Randomness in Secure Computation.
600-620
2013
conf/tcc/2013
TCC
https://doi.org/10.1007/978-3-642-36594-2_34
db/conf/tcc/tcc2013.html#IshaiKMOP13
Yuval Ishai
Eyal Kushilevitz
Xin Li 0006
Rafail Ostrovsky
Manoj Prabhakaran
Amit Sahai
David Zuckerman
Robust Pseudorandom Generators.
TR13-143
2013
TR13
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2013/143
db/journals/eccc/eccc20.html#IshaiKLOPSZ13
Yuval Ishai
Eyal Kushilevitz
Omer Strulovich
Lossy Chains and Fractional Secret Sharing.
105
2013
2013
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2013/105
db/journals/iacr/iacr2013.html#IshaiKS13
Yuval Ishai
Eyal Kushilevitz
Xin Li 0006
Rafail Ostrovsky
Manoj Prabhakaran
Amit Sahai
David Zuckerman
Robust Pseudorandom Generators.
671
2013
2013
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2013/671
db/journals/iacr/iacr2013.html#IshaiKLOPSZ13
Amos Beimel
Yuval Ishai
Eyal Kushilevitz
Ilan Orlov
Share Conversion and Private Information Retrieval.
258-268
2012
CCC
https://doi.org/10.1109/CCC.2012.23
https://doi.ieeecomputersociety.org/10.1109/CCC.2012.23
conf/coco/2012
db/conf/coco/coco2012.html#BeimelIKO12
Yuval Ishai
Eyal Kushilevitz
Anat Paskin-Cherniavsky
From randomizing polynomials to parallel algorithms.
76-89
2012
ITCS
https://doi.org/10.1145/2090236.2090244
conf/innovations/2012
db/conf/innovations/innovations2012.html#IshaiKP12
Eyal Kushilevitz
Steve Lu 0001
Rafail Ostrovsky
On the (in)security of hash-based oblivious RAM and a new balancing scheme.
143-156
2012
SODA
https://doi.org/10.1137/1.9781611973099.13
https://dl.acm.org/citation.cfm?id=2095129
conf/soda/2012
db/conf/soda/soda2012.html#KushilevitzLO12
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
How to Garble Arithmetic Circuits.
TR12-058
2012
TR12
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2012/058
db/journals/eccc/eccc19.html#ApplebaumIK12
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
How to Garble Arithmetic Circuits.
255
2012
2012
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2012/255
db/journals/iacr/iacr2012.html#ApplebaumIK12
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
Brent Waters
Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits.
693
2012
2012
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2012/693
db/journals/iacr/iacr2012.html#ApplebaumIKW12
Yuval Ishai
Jonathan Katz
Eyal Kushilevitz
Yehuda Lindell
Erez Petrank
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.
122-141
2011
40
SIAM J. Comput.
1
https://doi.org/10.1137/100783224
db/journals/siamcomp/siamcomp40.html#IshaiKKLP11
Iftach Haitner
Yuval Ishai
Eyal Kushilevitz
Yehuda Lindell
Erez Petrank
Black-Box Constructions of Protocols for Secure Computation.
225-266
2011
40
SIAM J. Comput.
2
https://doi.org/10.1137/100790537
db/journals/siamcomp/siamcomp40.html#HaitnerIKLP11
Jan Draisma
Eyal Kushilevitz
Enav Weinreb
Partition arguments in multiparty communication complexity.
2611-2622
2011
412
Theor. Comput. Sci.
24
https://doi.org/10.1016/j.tcs.2010.01.018
db/journals/tcs/tcs412.html#DraismaKW11
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Manoj Prabhakaran
Amit Sahai
Jürg Wullschleger
Constant-Rate Oblivious Transfer from Noisy Channels.
667-684
2011
CRYPTO
https://doi.org/10.1007/978-3-642-22792-9_38
conf/crypto/2011
db/conf/crypto/crypto2011.html#IshaiKOPSW11
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Manoj Prabhakaran
Amit Sahai
Efficient Non-interactive Secure Computation.
406-425
2011
EUROCRYPT
https://doi.org/10.1007/978-3-642-20465-4_23
conf/eurocrypt/2011
db/conf/eurocrypt/eurocrypt2011.html#IshaiKOPS11
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
How to Garble Arithmetic Circuits.
120-129
2011
FOCS
https://doi.org/10.1109/FOCS.2011.40
https://doi.ieeecomputersociety.org/10.1109/FOCS.2011.40
conf/focs/2011
db/conf/focs/focs2011.html#ApplebaumIK11
Eyal Kushilevitz
Steve Lu 0001
Rafail Ostrovsky
On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme.
327
2011
2011
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2011/327
db/journals/iacr/iacr2011.html#KushilevitzLO11
Eyal Kushilevitz
Yehuda Lindell
Tal Rabin
Information-Theoretically Secure Protocols and Security under Composition.
2090-2112
2010
39
SIAM J. Comput.
5
https://doi.org/10.1137/090755886
db/journals/siamcomp/siamcomp39.html#KushilevitzLR10
Yuval Ishai
Eyal Kushilevitz
Anat Paskin
Secure Multiparty Computation with Minimal Interaction.
577-594
2010
CRYPTO
https://doi.org/10.1007/978-3-642-14623-7_31
conf/crypto/2010
db/conf/crypto/crypto2010.html#IshaiKP10
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
From Secrecy to Soundness: Efficient Verification via Secure Computation.
152-163
2010
ICALP (1)
https://doi.org/10.1007/978-3-642-14165-2_14
conf/icalp/2010-1
db/conf/icalp/icalp2010-1.html#ApplebaumIK10
Amos Beimel
Sebastian Ben Daniel
Eyal Kushilevitz
Enav Weinreb
Choosing, Agreeing, and Eliminating in Communication Complexity.
451-462
2010
ICALP (1)
https://doi.org/10.1007/978-3-642-14165-2_39
conf/icalp/2010-1
db/conf/icalp/icalp2010-1.html#BeimelDKW10
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
1-19
2010
ICS
http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/1.html
conf/innovations/2010
db/conf/innovations/innovations2010.html#ApplebaumIK10
Eyal Kushilevitz
Communication Complexity: From Two-Party to Multiparty.
1
2010
SIROCCO
https://doi.org/10.1007/978-3-642-13284-1_1
conf/sirocco/2010
db/conf/sirocco/sirocco2010.html#Kushilevitz10
Yuval Ishai
Jonathan Katz
Eyal Kushilevitz
Yehuda Lindell
Erez Petrank
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation.
29
2010
2010
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2010/029
db/journals/iacr/iacr2010.html#IshaiKKLP10
Iftach Haitner
Yuval Ishai
Eyal Kushilevitz
Yehuda Lindell
Erez Petrank
Black-Box Constructions of Protocols for Secure Computation.
164
2010
2010
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2010/164
db/journals/iacr/iacr2010.html#HaitnerIKLP10
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
Cryptography with Constant Input Locality.
429-469
2009
22
J. Cryptol.
4
https://doi.org/10.1007/s00145-009-9039-0
db/journals/joc/joc22.html#ApplebaumIK09
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Amit Sahai
Zero-Knowledge Proofs from Secure Multiparty Computation.
1121-1152
2009
39
SIAM J. Comput.
3
https://doi.org/10.1137/080725398
db/journals/siamcomp/siamcomp39.html#IshaiKOS09
Eyal Kushilevitz
Enav Weinreb
The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection.
63-72
2009
FOCS
https://doi.org/10.1109/FOCS.2009.15
https://doi.ieeecomputersociety.org/10.1109/FOCS.2009.15
conf/focs/2009
db/conf/focs/focs2009.html#KushilevitzW09
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Amit Sahai
Extracting Correlations.
261-270
2009
FOCS
https://doi.org/10.1109/FOCS.2009.56
https://doi.ieeecomputersociety.org/10.1109/FOCS.2009.56
conf/focs/2009
db/conf/focs/focs2009.html#IshaiKOS09
Jan Draisma
Eyal Kushilevitz
Enav Weinreb
Partition Arguments in Multiparty Communication Complexity.
390-402
2009
ICALP (1)
https://doi.org/10.1007/978-3-642-02927-1_33
conf/icalp/2009-1
db/conf/icalp/icalp2009-1.html#DraismaKW09
Eyal Kushilevitz
Enav Weinreb
On the complexity of communication complexity.
465-474
2009
STOC
https://doi.org/10.1145/1536414.1536479
conf/stoc/2009
db/conf/stoc/stoc2009.html#KushilevitzW09
Jan Draisma
Eyal Kushilevitz
Enav Weinreb
Partition Arguments in Multiparty Communication Complexity
http://arxiv.org/abs/0909.5684
2009
CoRR
abs/0909.5684
db/journals/corr/corr0909.html#abs-0909-5684
Eyal Kushilevitz
Yehuda Lindell
Tal Rabin
Information-Theoretically Secure Protocols and Security Under Composition.
630
2009
2009
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2009/630
db/journals/iacr/iacr2009.html#KushilevitzLR09
Shirley Halevy
Eyal Kushilevitz
Distribution-Free Connectivity Testing for Sparse Graphs.
24-48
2008
51
Algorithmica
1
https://doi.org/10.1007/s00453-007-9054-1
db/journals/algorithmica/algorithmica51.html#HalevyK08
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
On Pseudorandom Generators with Linear Stretch in NC0.
38-69
2008
17
Comput. Complex.
1
https://doi.org/10.1007/s00037-007-0237-6
db/journals/cc/cc17.html#ApplebaumIK08
Shirley Halevy
Eyal Kushilevitz
Testing monotonicity over graph products.
44-67
2008
33
Random Struct. Algorithms
1
https://doi.org/10.1002/rsa.20211
db/journals/rsa/rsa33.html#HalevyK08
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Amit Sahai
Cryptography with constant computational overhead.
433-442
2008
STOC
https://doi.org/10.1145/1374376.1374438
conf/stoc/2008
db/conf/stoc/stoc2008.html#IshaiKOS08
Danny Harnik
Yuval Ishai
Eyal Kushilevitz
Jesper Buus Nielsen
OT-Combiners via Secure Computation.
393-411
2008
TCC
https://doi.org/10.1007/978-3-540-78524-8_22
conf/tcc/2008
db/conf/tcc/tcc2008.html#HarnikIKN08
Amos Beimel
Francesco Bergadano
Nader H. Bshouty
Eyal Kushilevitz
Stefano Varricchio
Learning Automata.
2008
Encyclopedia of Algorithms
https://doi.org/10.1007/978-0-387-30162-4_194
reference/algo/2008
db/reference/algo/algo2008.html#BeimelBBKV08
Shirley Halevy
Eyal Kushilevitz
Distribution-Free Property-Testing.
1107-1138
2007
37
SIAM J. Comput.
4
https://doi.org/10.1137/050645804
db/journals/siamcomp/siamcomp37.html#HalevyK07
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Efficient Arguments without Short PCPs.
278-291
2007
conf/coco/2007
CCC
https://doi.org/10.1109/CCC.2007.10
https://doi.ieeecomputersociety.org/10.1109/CCC.2007.10
db/conf/coco/coco2007.html#IshaiKO07
Dan Boneh
Eyal Kushilevitz
Rafail Ostrovsky
William E. Skeith III
Public Key Encryption That Allows PIR Queries.
50-67
2007
conf/crypto/2007
CRYPTO
https://doi.org/10.1007/978-3-540-74143-5_4
db/conf/crypto/crypto2007.html#BonehKOS07
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
Cryptography with Constant Input Locality.
92-110
2007
conf/crypto/2007
CRYPTO
https://doi.org/10.1007/978-3-540-74143-5_6
db/conf/crypto/crypto2007.html#ApplebaumIK07
Danny Harnik
Yuval Ishai
Eyal Kushilevitz
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
284-302
2007
conf/crypto/2007
CRYPTO
https://doi.org/10.1007/978-3-540-74143-5_16
db/conf/crypto/crypto2007.html#HarnikIK07
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Amit Sahai
Zero-knowledge from secure multiparty computation.
21-30
2007
conf/stoc/2007
STOC
https://doi.org/10.1145/1250790.1250794
db/conf/stoc/stoc2007.html#IshaiKOS07
Dan Boneh
Eyal Kushilevitz
Rafail Ostrovsky
William E. Skeith III
Public Key Encryption that Allows PIR Queries.
73
2007
2007
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2007/073
db/journals/iacr/iacr2007.html#BonehKOS07
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
Computationally Private Randomizing Polynomials and Their Applications.
115-162
2006
15
Comput. Complex.
2
https://doi.org/10.1007/s00037-006-0211-8
db/journals/cc/cc15.html#ApplebaumIK06
Ran Canetti
Eyal Kushilevitz
Yehuda Lindell
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions.
135-167
2006
19
J. Cryptol.
2
https://doi.org/10.1007/s00145-005-0419-9
db/journals/joc/joc19.html#CanettiKL06
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
Cryptography in NC0.
845-888
2006
36
SIAM J. Comput.
4
https://doi.org/10.1137/S0097539705446950
db/journals/siamcomp/siamcomp36.html#ApplebaumIK06
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
On Pseudorandom Generators with Linear Stretch in NC0.
260-271
2006
conf/approx/2006
APPROX-RANDOM
https://doi.org/10.1007/11830924_25
db/conf/approx/approx2006.html#ApplebaumIK06
Yuval Ishai
Eyal Kushilevitz
Yehuda Lindell
Erez Petrank
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation.
483-500
2006
conf/crypto/2006
CRYPTO
https://doi.org/10.1007/11818175_29
db/conf/crypto/crypto2006.html#IshaiKLP06
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Amit Sahai
Cryptography from Anonymity.
239-248
2006
conf/focs/2006
FOCS
https://doi.org/10.1109/FOCS.2006.25
https://doi.ieeecomputersociety.org/10.1109/FOCS.2006.25
db/conf/focs/focs2006.html#IshaiKOS06
Yuval Ishai
Eyal Kushilevitz
Yehuda Lindell
Erez Petrank
Black-box constructions for secure computation.
99-108
2006
conf/stoc/2006
STOC
https://doi.org/10.1145/1132516.1132531
db/conf/stoc/stoc2006.html#IshaiKLP06
Eyal Kushilevitz
Yehuda Lindell
Tal Rabin
Information-theoretically secure protocols and security under composition.
109-118
2006
conf/stoc/2006
STOC
https://doi.org/10.1145/1132516.1132532
db/conf/stoc/stoc2006.html#KushilevitzLR06
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Amit Sahai
Cryptography from Anonymity.
84
2006
2006
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2006/084
db/journals/iacr/iacr2006.html#IshaiKOS06
Amos Beimel
Yuval Ishai
Eyal Kushilevitz
General constructions for information-theoretic private information retrieval.
213-247
2005
71
J. Comput. Syst. Sci.
2
https://doi.org/10.1016/j.jcss.2005.03.002
db/journals/jcss/jcss71.html#BeimelIK05
Eyal Kushilevitz
Yishay Mansour
Computation in Noisy Radio Networks.
96-108
2005
19
SIAM J. Discret. Math.
1
https://doi.org/10.1137/S0895480103434063
db/journals/siamdm/siamdm19.html#KushilevitzM05
Shirley Halevy
Eyal Kushilevitz
A Lower Bound for Distribution-Free Monotonicity Testing.
330-341
2005
conf/approx/2005
APPROX-RANDOM
https://doi.org/10.1007/11538462_28
db/conf/approx/approx2005.html#HalevyK05
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
Computationally Private Randomizing Polynomials and Their Applications.
260-274
2005
conf/coco/2005
CCC
https://doi.org/10.1109/CCC.2005.9
https://doi.ieeecomputersociety.org/10.1109/CCC.2005.9
db/conf/coco/coco2005.html#ApplebaumIK05
Haim Kaplan
Eyal Kushilevitz
Yishay Mansour
Learning with attribute costs.
356-365
2005
conf/stoc/2005
STOC
https://doi.org/10.1145/1060590.1060644
db/conf/stoc/stoc2005.html#KaplanKM05
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Sufficient Conditions for Collision-Resistant Hashing.
445-456
https://doi.org/10.1007/978-3-540-30576-7_24
https://www.wikidata.org/entity/Q56475327
2005
conf/tcc/2005
TCC
db/conf/tcc/tcc2005.html#IshaiKO05
Shirley Halevy
Eyal Kushilevitz
Distribution-Free Connectivity Testing.
393-404
https://doi.org/10.1007/978-3-540-27821-4_35
2004
conf/approx/2004
APPROX-RANDOM
db/conf/approx/approx2004.html#HalevyK04
Yuval Ishai
Eyal Kushilevitz
On the Hardness of Information-Theoretic Multiparty Computation.
439-455
https://doi.org/10.1007/978-3-540-24676-3_26
2004
conf/eurocrypt/2004
EUROCRYPT
db/conf/eurocrypt/eurocrypt2004.html#IshaiK04
Benny Applebaum
Yuval Ishai
Eyal Kushilevitz
Cryptography in NC0.
166-175
2004
conf/focs/2004
FOCS
https://doi.org/10.1109/FOCS.2004.20
https://doi.ieeecomputersociety.org/10.1109/FOCS.2004.20
db/conf/focs/focs2004.html#ApplebaumIK04
Shirley Halevy
Eyal Kushilevitz
Testing Monotonicity over Graph Products.
721-732
https://doi.org/10.1007/978-3-540-27836-8_61
2004
conf/icalp/2004
ICALP
db/conf/icalp/icalp2004.html#HalevyK04
Yuval Ishai
Eyal Kushilevitz
Rafail Ostrovsky
Amit Sahai
Batch codes and their applications.
262-271
2004
conf/stoc/2004
STOC
https://doi.org/10.1145/1007352.1007396
https://www.wikidata.org/entity/Q56475325
db/conf/stoc/stoc2004.html#IshaiKOS04
Ran Canetti
Eyal Kushilevitz
Yehuda Lindell
On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions.
116
2004
2004
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2004/116
db/journals/iacr/iacr2004.html#CanettiKL04
Eyal Kushilevitz
Rafail Ostrovsky
Adi Rosén
Amortizing Randomness in Private Multiparty Computations.
533-544
2003
16
SIAM J. Discret. Math.
4
https://doi.org/10.1137/S089548010135274X
db/journals/siamdm/siamdm16.html#KushilevitzOR03
József Balogh
János A. Csirik
Yuval Ishai
Eyal Kushilevitz
Private computation using a PEZ dispenser.
69-84
2003
306
Theor. Comput. Sci.
1-3
https://doi.org/10.1016/S0304-3975(03)00210-X
db/journals/tcs/tcs306.html#BaloghCIK03
Ran Canetti
Eyal Kushilevitz
Yehuda Lindell
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions.
68-86
2003
conf/eurocrypt/2003
EUROCRYPT
https://doi.org/10.1007/3-540-39200-9_5
db/conf/eurocrypt/eurocrypt2003.html#CanettiKL03
Ronald Cramer
Serge Fehr
Yuval Ishai
Eyal Kushilevitz
Efficient Multi-party Computation over Rings.
596-613
2003
conf/eurocrypt/2003
EUROCRYPT
https://doi.org/10.1007/3-540-39200-9_37
db/conf/eurocrypt/eurocrypt2003.html#CramerFIK03
Shirley Halevy
Eyal Kushilevitz
Distribution-Free Property Testing.
302-317
https://doi.org/10.1007/978-3-540-45198-3_26
2003
conf/random/2003
RANDOM-APPROX
db/conf/random/random2003.html#HalevyK03
William Aiello
Rafail Ostrovsky
Eyal Kushilevitz
Adi Rosén
Dynamic routing on networks with fixed-size buffers.
771-780
2003
conf/soda/2003
SODA
http://dl.acm.org/citation.cfm?id=644108.644236
db/conf/soda/soda2003.html#AielloOKR03
Ronald Cramer
Serge Fehr
Yuval Ishai
Eyal Kushilevitz
Efficient Multi-Party Computation over Rings.
30
2003
2003
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/2003/030
db/journals/iacr/iacr2003.html#CramerFIK03
Nader H. Bshouty
Nadav Eiron
Eyal Kushilevitz
PAC learning with nasty noise.
255-275
2002
288
Theor. Comput. Sci.
2
db/journals/tcs/tcs288.html#BshoutyEK02
https://doi.org/10.1016/S0304-3975(01)00403-0
Rosario Gennaro
Yuval Ishai
Eyal Kushilevitz
Tal Rabin
On 2-Round Secure Multiparty Computation.
178-193
2002
conf/crypto/2002
CRYPTO
https://doi.org/10.1007/3-540-45708-9_12
db/conf/crypto/crypto2002.html#GennaroIKR02
Amos Beimel
Yuval Ishai
Eyal Kushilevitz
Jean-François Raymond
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval.
261-270
2002
conf/focs/2002
FOCS
https://doi.org/10.1109/SFCS.2002.1181949
https://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181949
db/conf/focs/focs2002.html#BeimelIKR02
Yuval Ishai
Eyal Kushilevitz
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials.
244-256
2002
conf/icalp/2002
ICALP
https://doi.org/10.1007/3-540-45465-9_22
db/conf/icalp/icalp2002.html#IshaiK02
Eyal Kushilevitz
Some Applications of Polynomials for the Design of Cryptographic Protocols.
1-13
2002
conf/scn/2002
SCN
https://doi.org/10.1007/3-540-36413-7_1
db/conf/scn/scn2002.html#Kushilevitz02
Amos Beimel
Felix Geller
Eyal Kushilevitz
The Query Complexity of Finding Local Minima in the Lattice.
69-83
2001
171
Inf. Comput.
1
db/journals/iandc/iandc171.html#BeimelGK01
https://doi.org/10.1006/inco.2001.3065
Eyal Kushilevitz
Tal Rabin
Fair e-Lotteries and e-Casinos.
100-109
2001
conf/ctrsa/2001
CT-RSA
https://doi.org/10.1007/3-540-45353-9_9
db/conf/ctrsa/ctrsa2001.html#KushilevitzR01
Shai Halevi
Robert Krauthgamer
Eyal Kushilevitz
Kobbi Nissim
Private approximation of NP-hard functions.
550-559
2001
conf/stoc/2001
STOC
https://doi.org/10.1145/380752.380850
db/conf/stoc/stoc2001.html#HaleviKKN01
Rosario Gennaro
Yuval Ishai
Eyal Kushilevitz
Tal Rabin
The round complexity of verifiable secret sharing and secure multicast.
580-589
2001
conf/stoc/2001
STOC
https://doi.org/10.1145/380752.380853
db/conf/stoc/stoc2001.html#GennaroIKR01
Amos Beimel
Eyal Kushilevitz
Learning unions of high-dimensional boxes over the reals.
213-220
2000
73
Inf. Process. Lett.
5-6
db/journals/ipl/ipl73.html#BeimelK00
https://doi.org/10.1016/S0020-0190(00)00024-7
Amos Beimel
Francesco Bergadano
Nader H. Bshouty
Eyal Kushilevitz
Stefano Varricchio
Learning functions represented as multiplicity automata.
506-530
2000
47
J. ACM
3
https://doi.org/10.1145/337244.337257
db/journals/jacm/jacm47.html#BeimelBBKV00
William Aiello
Eyal Kushilevitz
Rafail Ostrovsky
Adi Rosén
Adaptive Packet Routing for Bursty Adversarial Traffic.
482-509
2000
60
J. Comput. Syst. Sci.
3
db/journals/jcss/jcss60.html#AielloKOR00
https://doi.org/10.1006/jcss.1999.1681
Yael Gertner
Yuval Ishai
Eyal Kushilevitz
Tal Malkin
Protecting Data Privacy in Private Information Retrieval Schemes.
592-629
2000
60
J. Comput. Syst. Sci.
3
db/journals/jcss/jcss60.html#GertnerIKM00
https://doi.org/10.1006/jcss.1999.1689
Ran Canetti
Eyal Kushilevitz
Rafail Ostrovsky
Adi Rosén
Randomness versus Fault-Tolerance.
107-142
2000
13
J. Cryptol.
1
https://doi.org/10.1007/s001459910005
db/journals/joc/joc13.html#CanettiKOR00
Joe Kilian
Eyal Kushilevitz
Silvio Micali
Rafail Ostrovsky
Reducibility and Completeness in Private Computations.
1189-1208
2000
29
SIAM J. Comput.
4
db/journals/siamcomp/siamcomp29.html#KilianKMO00
https://doi.org/10.1137/S0097539797321742
Eyal Kushilevitz
Rafail Ostrovsky
Yuval Rabani
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces.
457-474
2000
30
SIAM J. Comput.
2
db/journals/siamcomp/siamcomp30.html#KushilevitzOR00
https://doi.org/10.1137/S0097539798347177
Amos Beimel
Mike Burmester
Yvo Desmedt
Eyal Kushilevitz
Computing Functions of a Shared Secret.
324-345
2000
13
SIAM J. Discret. Math.
3
https://doi.org/10.1137/S0895480195288819
db/journals/siamdm/siamdm13.html#BeimelBDK00
Eyal Kushilevitz
Rafail Ostrovsky
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval.
104-121
2000
conf/eurocrypt/2000
EUROCRYPT
https://doi.org/10.1007/3-540-45539-6_9
db/conf/eurocrypt/eurocrypt2000.html#KushilevitzO00
Ran Canetti
Yevgeniy Dodis
Shai Halevi
Eyal Kushilevitz
Amit Sahai
Exposure-Resilient Functions and All-or-Nothing Transforms.
453-469
2000
conf/eurocrypt/2000
EUROCRYPT
https://doi.org/10.1007/3-540-45539-6_33
db/conf/eurocrypt/eurocrypt2000.html#CanettiDHKS00
Yuval Ishai
Eyal Kushilevitz
Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation.
294-304
2000
conf/focs/2000
FOCS
db/conf/focs/focs2000.html#IshaiK00
https://doi.org/10.1109/SFCS.2000.892118
https://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892118
Eyal Kushilevitz
Nathan Linial
Rafail Ostrovsky
The Linear-Array Conjecture in Communication Complexity Is False.
241-254
1999
19
Comb.
2
https://doi.org/10.1007/s004930050054
https://www.wikidata.org/entity/Q122887971
db/journals/combinatorica/combinatorica19.html#KushilevitzL99
Eyal Kushilevitz
Rafail Ostrovsky
Adi Rosén
Characterizing Linear Size Circuits in Terms of Pricacy.
129-136
1999
58
J. Comput. Syst. Sci.
1
db/journals/jcss/jcss58.html#KushilevitzOR99
https://doi.org/10.1006/jcss.1997.1544
Nader H. Bshouty
Nadav Eiron
Eyal Kushilevitz
PAC Learning with Nasty Noise.
206-218
https://doi.org/10.1007/3-540-46769-6_17
1999
conf/alt/1999
ALT
db/conf/alt/alt1999.html#BshoutyEK98
Yuval Ishai
Eyal Kushilevitz
Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract).
79-88
1999
conf/stoc/1999
STOC
https://doi.org/10.1145/301250.301275
db/conf/stoc/stoc1999.html#IshaiK99
Amos Beimel
Yuval Ishai
Eyal Kushilevitz
Tal Malkin
One-Way Functions Are Essential for Single-Server Private Information Retrieval.
89-98
1999
conf/stoc/1999
STOC
https://doi.org/10.1145/301250.301277
db/conf/stoc/stoc1999.html#BeimelIKM99
Amos Beimel
Eyal Kushilevitz
Learning Boxes in High Dimension.
76-90
1998
22
Algorithmica
1/2
db/journals/algorithmica/algorithmica22.html#BeimelK98
https://doi.org/10.1007/PL00013835
Benny Chor
Eyal Kushilevitz
Oded Goldreich 0001
Madhu Sudan 0001
Private Information Retrieval.
965-981
1998
45
J. ACM
6
https://doi.org/10.1145/293347.293350
https://www.wikidata.org/entity/Q55980348
db/journals/jacm/jacm45.html#ChorKGS98
Eyal Kushilevitz
Yishay Mansour
An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks.
702-712
1998
27
SIAM J. Comput.
3
db/journals/siamcomp/siamcomp27.html#KushilevitzM98
https://doi.org/10.1137/S0097539794279109
Howard Aizenstein
Avrim Blum
Roni Khardon
Eyal Kushilevitz
Leonard Pitt
Dan Roth
On Learning Read-k-Satisfy-j DNF.
1515-1530
1998
27
SIAM J. Comput.
6
https://doi.org/10.1137/S0097539794274398
db/journals/siamcomp/siamcomp27.html#AizensteinBKKPR98
Eyal Kushilevitz
Rafail Ostrovsky
Adi Rosén
Log-Space Polynomial End-to-End Communication.
1531-1549
1998
27
SIAM J. Comput.
6
https://doi.org/10.1137/S0097539795296760
db/journals/siamcomp/siamcomp27.html#KushilevitzOR98
Eyal Kushilevitz
Yishay Mansour
Michael O. Rabin
David Zuckerman
Lower Bounds for Randomized Mutual Exclusion.
1550-1563
1998
27
SIAM J. Comput.
6
https://doi.org/10.1137/S009753979426513X
db/journals/siamcomp/siamcomp27.html#KushilevitzMRZ98
Eyal Kushilevitz
Adi Rosén
A Randomness-Rounds Tradeoff in Private Computation.
61-80
1998
11
SIAM J. Discret. Math.
1
https://doi.org/10.1137/S089548019427634X
db/journals/siamdm/siamdm11.html#KushilevitzR98
Amos Beimel
Felix Geller
Eyal Kushilevitz
The Query Complexity of Finding Local Minima in the Lattice.
294-302
1998
conf/colt/1998
COLT
https://doi.org/10.1145/279943.280000
db/conf/colt/colt1998.html#BeimelGK98
Alex Biryukov
Eyal Kushilevitz
From Differential Cryptanalysis to Ciphertext-Only Attacks.
72-88
https://doi.org/10.1007/BFb0055721
1998
conf/crypto/1998
CRYPTO
db/conf/crypto/crypto98.html#BiryukovK98
Alex Biryukov
Eyal Kushilevitz
Improved Cryptanalysis of RC5.
85-99
https://doi.org/10.1007/BFb0054119
https://www.wikidata.org/entity/Q57229830
1998
conf/eurocrypt/98
EUROCRYPT
db/conf/eurocrypt/eurocrypt98.html#BiryukowK98
Eyal Kushilevitz
Rafail Ostrovsky
Adi Rosén
Amortizing Randomness in Private Multiparty Computations.
81-90
1998
conf/podc/1998
PODC
https://doi.org/10.1145/277697.277710
db/conf/podc/podc98.html#KushilevitzOR98
Eyal Kushilevitz
Yishay Mansour
Computation in Noisy Radio Networks.
236-243
1998
conf/soda/1998
SODA
db/conf/soda/soda98.html#KushilevitzM98
http://dl.acm.org/citation.cfm?id=314613.314709
Yael Gertner
Yuval Ishai
Eyal Kushilevitz
Tal Malkin
Protecting Data Privacy in Private Information Retrieval Schemes.
151-160
1998
conf/stoc/1998
STOC
https://doi.org/10.1145/276698.276723
db/conf/stoc/stoc1998.html#GertnerIKM98
William Aiello
Eyal Kushilevitz
Rafail Ostrovsky
Adi Rosén
Adaptive Packet Routing for Bursty Adversarial Traffic.
359-368
1998
conf/stoc/1998
STOC
https://doi.org/10.1145/276698.276788
db/conf/stoc/stoc1998.html#AielloKOR98
Eyal Kushilevitz
Rafail Ostrovsky
Yuval Rabani
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces.
614-623
1998
conf/stoc/1998
STOC
https://doi.org/10.1145/276698.276877
db/conf/stoc/stoc1998.html#KushilevitzOR98
Ran Canetti
Eyal Kushilevitz
Rafail Ostrovsky
Adi Rosén
Randomness versus Fault-Tolerance.
14
1998
1998
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/1998/014
db/journals/iacr/iacr1998.html#CanettiKOR98
Eyal Kushilevitz
Noam Nisan
Communication complexity.
I-XIII, 1-189
Cambridge University Press
1997
978-0-521-56067-2
Eyal Kushilevitz
Communication Complexity.
331-360
1997
44
Adv. Comput.
db/journals/ac/ac44.html#Kushilevitz97
https://doi.org/10.1016/S0065-2458(08)60342-3
Eyal Kushilevitz
A Simple Algorithm for Learning O (log n)-Term DNF.
289-292
1997
61
Inf. Process. Lett.
6
db/journals/ipl/ipl61.html#Kushilevitz97
https://doi.org/10.1016/S0020-0190(97)00026-4
Shai Ben-David
Eyal Kushilevitz
Yishay Mansour
Online Learning versus Offline Learning.
45-63
1997
29
Mach. Learn.
1
db/journals/ml/ml29.html#Ben-DavidKM97
https://doi.org/10.1023/A:1007465907571
https://www.wikidata.org/entity/Q60309063
Eyal Kushilevitz
Yishay Mansour
Randomness in Private Computations.
647-661
1997
10
SIAM J. Discret. Math.
4
https://doi.org/10.1137/S0895480196306130
db/journals/siamdm/siamdm10.html#KushilevitzM97
Amos Beimel
Eyal Kushilevitz
Learning Boxes in High Dimension.
3-15
1997
conf/eurocolt/1997
EuroCOLT
db/conf/eurocolt/eurocolt1997.html#BeimelK97
https://doi.org/10.1007/3-540-62685-9_2
Eyal Kushilevitz
Rafail Ostrovsky
Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval.
364-373
1997
conf/focs/1997
FOCS
https://doi.org/10.1109/SFCS.1997.646125
https://doi.ieeecomputersociety.org/10.1109/SFCS.1997.646125
https://www.wikidata.org/entity/Q56475321
db/conf/focs/focs97.html#KushilevitzO97
Yuval Ishai
Eyal Kushilevitz
Private Simultaneous Messages Protocols with Applications.
174-184
1997
conf/istcs/1997
ISTCS
https://doi.org/10.1109/ISTCS.1997.595170
https://doi.ieeecomputersociety.org/10.1109/ISTCS.1997.595170
db/conf/istcs/istcs1997.html#IshaiK97
Ran Canetti
Eyal Kushilevitz
Rafail Ostrovsky
Adi Rosén
Randomness vs. Fault-Tolerance.
35-44
1997
conf/podc/1997
PODC
db/conf/podc/podc97.html#CanettiKOR97
https://doi.org/10.1145/259380.259416
Shai Ben-David
Nader H. Bshouty
Eyal Kushilevitz
A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes.
324-333
1997
conf/stoc/1997
STOC
https://doi.org/10.1145/258533.258614
db/conf/stoc/stoc1997.html#Ben-DavidBK97
Yuval Ishai
Eyal Kushilevitz
Protecting Data Privacy in Private Information Retrieval Schemes.
6
1997
1997
IACR Cryptol. ePrint Arch.
http://eprint.iacr.org/1997/006
db/journals/iacr/iacr1997.html#IshaiK97
Eyal Kushilevitz
Nathan Linial
Yuri Rabinovich
Michael E. Saks
Witness Sets for Families of Binary Vectors.
376-380
1996
73
J. Comb. Theory, Ser. A
2
https://doi.org/10.1006/jcta.1996.0031
db/journals/jct/jcta73.html#KushilevitzLRS96
Eyal Kushilevitz
Dan Roth
On Learning Visual Concepts and DNF Formulae.
65-85
1996
24
Mach. Learn.
1
db/journals/ml/ml24.html#KushilevitzR96
https://doi.org/10.1007/BF00117833
Eyal Kushilevitz
A Simple Algorithm for Learning O(log n)-Term DNF.
266-269
1996
conf/colt/1996
COLT
https://doi.org/10.1145/238061.238115
db/conf/colt/colt1996.html#Kushilevitz96
Amos Beimel
Francesco Bergadano
Nader H. Bshouty
Eyal Kushilevitz
Stefano Varricchio
On the Applications of Multiplicity Automata in Learning.
349-358
1996
conf/focs/1996
FOCS
db/conf/focs/focs96.html#BeimelBBKV96
https://doi.org/10.1109/SFCS.1996.548494
https://doi.ieeecomputersociety.org/10.1109/SFCS.1996.548494
Eyal Kushilevitz
Yishay Mansour
Randomness in Private Computations.
181-190
1996
conf/podc/1996
PODC
db/conf/podc/podc96.html#KushilevitzM96
https://doi.org/10.1145/248052.248089
Eyal Kushilevitz
Nathan Linial
Rafail Ostrovsky
The Linear-Array Conjecture in Communication Complexity is False.
1-10
1996
conf/stoc/1996
STOC
https://doi.org/10.1145/237814.237817
db/conf/stoc/stoc1996.html#KushilevitzLO96
Eyal Kushilevitz
Rafail Ostrovsky
Adi Rosén
Characterizing Linear Size Circuits in Terms of Privacy.
541-550
1996
conf/stoc/1996
STOC
https://doi.org/10.1145/237814.238002
db/conf/stoc/stoc1996.html#KushilevitzOR96
Shai Ben-David
Nader H. Bshouty
Eyal Kushilevitz
A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes
Electron. Colloquium Comput. Complex.
1996
TR96-059
TR96
db/journals/eccc/eccc3.html#ECCC-TR96-059
https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-059/index.html
Learning by Distances
Shai Ben-David
Alon Itai
Eyal Kushilevitz
240-250
Inf. Comput.
March
1995
117
2
db/journals/iandc/iandc117.html#Ben-DavidIK95
https://doi.org/10.1006/inco.1995.1042
Benny Chor
Mihály Geréb-Graus
Eyal Kushilevitz
Private Computations over the Integers.
376-386
1995
24
SIAM J. Comput.
2
db/journals/siamcomp/siamcomp24.html#ChorGK95
https://doi.org/10.1137/S0097539791194999
Tomás Feder
Eyal Kushilevitz
Moni Naor
Noam Nisan
Amortized Communication Complexity.
736-750
1995
24
SIAM J. Comput.
4
db/journals/siamcomp/siamcomp24.html#FederKNN95
https://doi.org/10.1137/S0097539792235864
Mauricio Karchmer
Eyal Kushilevitz
Noam Nisan
Fractional Covers and Communication Complexity.
76-92
1995
8
SIAM J. Discret. Math.
1
https://doi.org/10.1137/S0895480192238482
db/journals/siamdm/siamdm8.html#KarchmerKN95
Eyal Kushilevitz
Yishay Mansour
Michael O. Rabin
On Lotteries with Unique Winners.
93-98
1995
8
SIAM J. Discret. Math.
1
https://doi.org/10.1137/S0895480194262795
db/journals/siamdm/siamdm8.html#KushilevitzMR95
Shai Ben-David
Nadav Eiron
Eyal Kushilevitz
On Self-Directed Learning.
136-143
1995
conf/colt/1995
COLT
https://doi.org/10.1145/225298.225314
db/conf/colt/colt1995.html#Ben-DavidEK95
Shai Ben-David
Eyal Kushilevitz
Yishay Mansour
Online learning versus offline learning.
38-52
1995
conf/eurocolt/1995
EuroCOLT
db/conf/eurocolt/eurocolt1995.html#Ben-DavidKM95
https://doi.org/10.1007/3-540-59119-2_167
Benny Chor
Oded Goldreich 0001
Eyal Kushilevitz
Madhu Sudan 0001
Private Information Retrieval.
41-50
1995
conf/focs/1995
FOCS
db/conf/focs/focs95.html#ChorGKS95
https://doi.org/10.1109/SFCS.1995.492461
https://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492461
Eyal Kushilevitz
Rafail Ostrovsky
Adi Rosén
Log-Space Polynomial End-to-End Communication (Abstract).
254
1995
conf/podc/1995
PODC
db/conf/podc/podc95.html#KushilevitzOR95
Eyal Kushilevitz
Rafail Ostrovsky
Adi Rosén
Log-space polynomial end-to-end communication.
559-568
1995
conf/stoc/STOC27
STOC
https://doi.org/10.1145/225058.225273
db/conf/stoc/stoc1995.html#KushilevitzOR95
Benny Chor
Mihály Geréb-Graus
Eyal Kushilevitz
On the Structure of the Privacy Hierarchy.
53-60
1994
7
J. Cryptol.
1
db/journals/joc/joc7.html#ChorGK94
https://doi.org/10.1007/BF00195209
Shai Ben-David
Mauricio Karchmer
Eyal Kushilevitz
On Ultrafilters and NP.
97-105
1994
conf/coco/1994
SCT
db/conf/coco/coco94.html#Ben-DavidKK94
https://doi.org/10.1109/SCT.1994.315813
https://doi.ieeecomputersociety.org/10.1109/SCT.1994.315813
Avrim Blum
Roni Khardon
Eyal Kushilevitz
Leonard Pitt
Dan Roth
On Learning Read-k-Satisfy-j DNF.
110-117
1994
conf/colt/1994
COLT
https://doi.org/10.1145/180139.181051
db/conf/colt/colt1994.html#BlumKKPR94
Eyal Kushilevitz
Adi Rosén
A Randomnesss-Rounds Tradeoff in Private Computation.
397-410
https://doi.org/10.1007/3-540-48658-5_36
1994
conf/crypto/1994
CRYPTO
db/conf/crypto/crypto94.html#KushilevitzR94
Reducibility and Completeness in Multi-Party Private Computations
Eyal Kushilevitz
Silvio Micali
Rafail Ostrovsky
478-489
conf/focs/FOCS35
1994
FOCS
db/conf/focs/focs94.html#KushilevitzMO94
https://doi.org/10.1109/SFCS.1994.365743
https://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365743
Benny Chor
Eyal Kushilevitz
A Communication-Privacy Tradeoff for Modular Addition.
205-210
1993
45
Inf. Process. Lett.
4
db/journals/ipl/ipl45.html#ChorK93
https://doi.org/10.1016/0020-0190(93)90120-X
Benny Chor
Eyal Kushilevitz
Secret Sharing Over Infinite Domains.
87-95
1993
6
J. Cryptol.
2
db/journals/joc/joc6.html#ChorK93
https://doi.org/10.1007/BF02620136
Oded Goldreich 0001
Eyal Kushilevitz
A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm.
97-116
1993
6
J. Cryptol.
2
db/journals/joc/joc6.html#GoldreichK93
https://doi.org/10.1007/BF02620137
Eyal Kushilevitz
Yishay Mansour
Learning Decision Trees Using the Fourier Spectrum.
1331-1348
1993
22
SIAM J. Comput.
6
db/journals/siamcomp/siamcomp22.html#KushilevitzM93
https://doi.org/10.1137/0222080
Reuven Bar-Yehuda
Benny Chor
Eyal Kushilevitz
Alon Orlitsky
Privacy, additional information and communication.
1930-1943
1993
39
IEEE Trans. Inf. Theory
6
db/journals/tit/tit39.html#Bar-YehudaCKO93
https://doi.org/10.1109/18.265501
Eyal Kushilevitz
Dan Roth
On Learning Visual Concepts and DNF Formulae.
317-326
1993
conf/colt/1993
COLT
https://doi.org/10.1145/168304.168362
db/conf/colt/colt1993.html#KushilevitzR93
Eyal Kushilevitz
Yishay Mansour
An Omega(D log(N/D)) Lower Bound for Broadcast in Radio Networks.
65-74
1993
conf/podc/1993
PODC
db/conf/podc/podc93.html#KushilevitzM92
https://doi.org/10.1145/164051.164059
Eyal Kushilevitz
Yishay Mansour
Michael O. Rabin
David Zuckerman
Lower bounds for randomized mutual exclusion.
154-163
1993
conf/stoc/STOC25
STOC
https://doi.org/10.1145/167088.167139
db/conf/stoc/stoc1993.html#KushilevitzMRZ93
Eyal Kushilevitz
Privacy and Communication Complexity.
273-284
1992
5
SIAM J. Discret. Math.
2
db/journals/siamdm/siamdm5.html#Kushilevitz92
https://doi.org/10.1137/0405021
Mauricio Karchmer
Eyal Kushilevitz
Noam Nisan
Fractional Covers and Communication Complexity.
262-274
1992
conf/coco/1992
SCT
db/conf/coco/coco92.html#KarchmerKN92
https://doi.org/10.1109/SCT.1992.215401
https://doi.ieeecomputersociety.org/10.1109/SCT.1992.215401
Eyal Kushilevitz
Michael O. Rabin
Randomized Mutual Exclusion Algorithms Revisited.
275-283
1992
conf/podc/1992
PODC
db/conf/podc/podc92.html#KushilevitzR92
https://doi.org/10.1145/135419.135468
Benny Chor
Eyal Kushilevitz
A Zero-One Law for Boolean Privacy.
36-47
1991
4
SIAM J. Discret. Math.
1
db/journals/siamdm/siamdm4.html#ChorK91
https://doi.org/10.1137/0404004
Amortized Communication Complexity (Preliminary Version)
Tomás Feder
Eyal Kushilevitz
Moni Naor
239-248
conf/focs/FOCS32
1991
FOCS
db/conf/focs/focs91.html#FederKN91
https://doi.org/10.1109/SFCS.1991.185374
https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185374
Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract)
Eyal Kushilevitz
Yishay Mansour
455-464
conf/stoc/STOC23
1991
STOC
db/conf/stoc/stoc91.html#KushilevitzM91
https://doi.org/10.1145/103418.103466
Reuven Bar-Yehuda
Benny Chor
Eyal Kushilevitz
Privacy, Additional Information, and Communication.
55-65
1990
conf/coco/1990
SCT
db/conf/coco/coco90.html#Bar-YehudaCK90
https://doi.org/10.1109/SCT.1990.113954
https://doi.ieeecomputersociety.org/10.1109/SCT.1990.113954
Shai Ben-David
Alon Itai
Eyal Kushilevitz
Learning by Distances.
232-245
1990
conf/colt/1990
COLT
http://dl.acm.org/citation.cfm?id=92644
db/conf/colt/colt1990.html#Ben-DavidIK90
Private Computations Over the Integers (Extended Abstract)
Benny Chor
Mihály Geréb-Graus
Eyal Kushilevitz
335-344
conf/focs/FOCS31a
1990
FOCS
db/conf/focs/focs90.html#ChorGK90
https://doi.org/10.1109/FSCS.1990.89552
https://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89552
Benny Chor
Eyal Kushilevitz
Secret Sharing Over Infinite Domains (Extended Abstract).
299-306
https://doi.org/10.1007/0-387-34805-0_27
1989
conf/crypto/1989
CRYPTO
db/conf/crypto/crypto89.html#ChorK89
Privacy and Communication Complexity
Eyal Kushilevitz
416-421
conf/focs/FOCS30
1989
FOCS
db/conf/focs/focs89.html#Kushilevitz89
https://doi.org/10.1109/SFCS.1989.63512
https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63512
A Zero-One Law for Boolean Privacy (extended abstract)
Benny Chor
Eyal Kushilevitz
62-72
conf/stoc/STOC21
1989
STOC
db/conf/stoc/stoc89.html#ChorK89
https://doi.org/10.1145/73007.73013
Oded Goldreich 0001
Eyal Kushilevitz
A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm.
57-70
https://doi.org/10.1007/0-387-34799-2_5
1988
conf/crypto/1988
CRYPTO
db/conf/crypto/crypto88.html#GoldreichK88
Damiano Abram
Shweta Agrawal
Eldar Aharoni
William Aiello
Howard Aizenstein
Benny Applebaum
József Balogh
Reuven Bar-Yehuda
Amos Beimel
Shai Ben-David
Fabrice Benhamouda
Francesco Bergadano
Alex Biryukov
Avrim Blum
Dan Boneh
Nader H. Bshouty
Paul Bunn
Mike Burmester
Ran Canetti
Benny Chor
Ronald Cramer
János A. Csirik
Sebastian Ben Daniel
Bernardo Machado DavidBernardo David
Giovanni Deligios
Yvo Desmedt
Yevgeniy Dodis
Jan Draisma
Nadav Eiron
Tomás Feder
Serge Fehr
Ariel Gabizon
Sanjam Garg
Felix Geller
Rosario Gennaro
Mihály Geréb-Graus
Yael Gertner
Riddhi Ghosal
Aarushi Goel
Oded Goldreich 0001
Iftach Haitner
Shai Halevi
Shirley Halevy
Naama Haramaty
Danny Harnik
Itay Hazan
Yuval Ishai
Alon Itai
Abhishek Jain 0002
Haim Kaplan
Mauricio Karchmer
Jonathan Katz
Roni Khardon
Joe Kilian
Anders Konring
Alexis Korb
Robert Krauthgamer
P. R. Kumar 0001Panganamala Ramana Kumar
Ranjit Kumaresan
Xin Li 0006
Yehuda Lindell
Nathan Linial
Tianren Liu
Chen-Da Liu-Zhang
Paul Lou
Steve Lu 0001
Nikolaos Makriyannis
Tal Malkin
D. Manjunath
Yishay Mansour
Muriel Médard
Sigurd Meldgaard
Silvio Micali
Prateek Mittal
Tamer Mour
Moni Naor
Varun Narayanan
Jesper Buus Nielsen
Noam Nisan
Kobbi Nissim
Pnina Nissim
Claudio Orlandi
Alon Orlitsky
Ilan Orlov
Rafail Ostrovsky
Anat Paskin-CherniavskyAnat Paskin
Erez Petrank
Leonard Pitt
Manoj Prabhakaran
Vinod M. Prabhakaran
Emmanuel Prouff
Yuval Rabani
Michael O. Rabin
Tal Rabin
Yuri Rabinovich
Jean-François Raymond
Adi Rosén
Alon Rosen
Dan Roth
Amit Sahai
Michael E. Saks
William E. Skeith III
R. Srikant 0001
Omer Strulovich
Madhu Sudan 0001
Adrian Thillard
Shruti Tople
Vinod Vaikuntanathan
Stefano Varricchio
Damien Vergnaud
Sameer Wagh
Brent Waters
Enav Weinreb
Jürg Wullschleger
Ching-Hua Yu
David Zuckerman