default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEyal Kushilevitz
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c126]Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Tal Rabin:
Additive Randomized Encodings and Their Applications. CRYPTO (1) 2023: 203-235- [c125]Bernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushilevitz, Chen-Da Liu-Zhang, Varun Narayanan:
Perfect MPC over Layered Graphs. CRYPTO (1) 2023: 360-392 - [c124]Riddhi Ghosal, Yuval Ishai, Alexis Korb
, Eyal Kushilevitz, Paul Lou, Amit Sahai:
Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness. STOC 2023: 1243-1256 - [c123]Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. STOC 2023: 1553-1566 - [c122]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
Anonymous Permutation Routing. TCC (3) 2023: 33-61 - [c121]Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan:
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. TCC (1) 2023: 286-315 - [i46]Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. Electron. Colloquium Comput. Complex. TR23 (2023) - [i45]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. Electron. Colloquium Comput. Complex. TR23 (2023) - [i44]Bernardo David, Anders Konring, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan:
Perfect MPC over Layered Graphs. IACR Cryptol. ePrint Arch. 2023: 330 (2023) - [i43]Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Tal Rabin:
Additive Randomized Encodings and Their Applications. IACR Cryptol. ePrint Arch. 2023: 870 (2023) - [i42]Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. IACR Cryptol. ePrint Arch. 2023: 955 (2023) - [i41]Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan:
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. IACR Cryptol. ePrint Arch. 2023: 1929 (2023) - [i40]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. IACR Cryptol. ePrint Arch. 2023: 1972 (2023) - 2022
- [c120]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
CNF-FSS and Its Applications. Public Key Cryptography (1) 2022: 283-314 - [c119]Shai Halevi, Eyal Kushilevitz:
Random-Index Oblivious RAM. TCC (3) 2022: 33-59 - [i39]Shai Halevi, Eyal Kushilevitz:
Random-Index Oblivious RAM. IACR Cryptol. ePrint Arch. 2022: 982 (2022) - [i38]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
Anonymous Permutation Routing. IACR Cryptol. ePrint Arch. 2022: 1353 (2022) - 2021
- [j62]Sameer Wagh, Shruti Tople, Fabrice Benhamouda, Eyal Kushilevitz, Prateek Mittal, Tal Rabin:
Falcon: Honest-Majority Maliciously Secure Framework for Private Deep Learning. Proc. Priv. Enhancing Technol. 2021(1): 188-208 (2021) - [j61]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. SIAM J. Discret. Math. 35(1): 465-484 (2021) - [c118]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. CRYPTO (2) 2021: 124-154 - [i37]Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky:
CNF-FSS and its Applications. IACR Cryptol. ePrint Arch. 2021: 163 (2021) - 2020
- [c117]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. ASIACRYPT (3) 2020: 653-685 - [c116]Paul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky:
Efficient 3-Party Distributed ORAM. SCN 2020: 215-232 - [i36]Sameer Wagh, Shruti Tople, Fabrice Benhamouda, Eyal Kushilevitz, Prateek Mittal, Tal Rabin:
FALCON: Honest-Majority Maliciously Secure Framework for Private Deep Learning. CoRR abs/2004.02229 (2020)
2010 – 2019
- 2019
- [c115]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptographic Sensing. CRYPTO (3) 2019: 583-604 - [c114]Eyal Kushilevitz, Tamer Mour:
Sub-logarithmic Distributed Oblivious RAM with Small Block Size. Public Key Cryptography (1) 2019: 3-33 - [c113]Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Nikolaos Makriyannis, Tal Rabin:
On Fully Secure MPC with Solitary Output. TCC (1) 2019: 312-340 - [c112]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. TCC (2) 2019: 386-406 - [i35]Eyal Kushilevitz, Tamer Mour:
Sub-logarithmic Distributed Oblivious RAM with Small Block Size. IACR Cryptol. ePrint Arch. 2019: 48 (2019) - [i34]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptographic Sensing. IACR Cryptol. ePrint Arch. 2019: 637 (2019) - [i33]Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Nikolaos Makriyannis, Tal Rabin:
On Fully Secure MPC with Solitary Output. IACR Cryptol. ePrint Arch. 2019: 1032 (2019) - 2018
- [j60]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings. J. Cryptol. 31(1): 1-22 (2018) - [c111]Amos Beimel, Eyal Kushilevitz, Pnina Nissim:
The Complexity of Multiparty PSM Protocols and Related Models. EUROCRYPT (2) 2018: 287-318 - [c110]Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Tal Rabin:
Best Possible Information-Theoretic MPC. TCC (2) 2018: 255-281 - [i32]Eyal Kushilevitz, Tamer Mour:
Sub-logarithmic Distributed Oblivious RAM with Small Block Size. CoRR abs/1802.05145 (2018) - [i31]Amos Beimel, Eyal Kushilevitz, Pnina Nissim:
The Complexity of Multiparty PSM Protocols and Related Models. IACR Cryptol. ePrint Arch. 2018: 148 (2018) - [i30]Paul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky:
Efficient 3-Party Distributed ORAM. IACR Cryptol. ePrint Arch. 2018: 706 (2018) - [i29]Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Tal Rabin:
Best Possible Information-Theoretic MPC. IACR Cryptol. ePrint Arch. 2018: 913 (2018) - 2017
- [c109]Amos Beimel, Yuval Ishai, Eyal Kushilevitz:
Ad Hoc PSM Protocols: Secure Computation Without Coordination. EUROCRYPT (3) 2017: 580-608 - [c108]Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan:
Low-Complexity Cryptographic Hash Functions . ITCS 2017: 7:1-7:31 - [c107]Itay Hazan, Eyal Kushilevitz:
Two-Party Direct-Sum Questions Through the Lens of Multiparty Communication Complexity. DISC 2017: 26:1-26:15 - [i28]Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan:
Low-Complexity Cryptographic Hash Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - [i27]Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan:
Low-Complexity Cryptographic Hash Functions. IACR Cryptol. ePrint Arch. 2017: 36 (2017) - [i26]Amos Beimel, Yuval Ishai, Eyal Kushilevitz:
Ad Hoc PSM Protocols: Secure Computation Without Coordination. IACR Cryptol. ePrint Arch. 2017: 147 (2017) - 2016
- [c106]Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, Amit Sahai, Ching-Hua Yu:
Secure Protocol Transformations. CRYPTO (2) 2016: 430-458 - [c105]Yuval Ishai, Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky:
Private Large-Scale Databases with Distributed Searchable Symmetric Encryption. CT-RSA 2016: 90-107 - [c104]Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz:
Distribution Design. ITCS 2016: 81-92 - [c103]Shai Halevi, Yuval Ishai, Abhishek Jain, Eyal Kushilevitz, Tal Rabin:
Secure Multiparty Computation with General Interaction Patterns. ITCS 2016: 157-168 - [e2]Eyal Kushilevitz, Tal Malkin:
Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I. Lecture Notes in Computer Science 9562, Springer 2016, ISBN 978-3-662-49095-2 [contents] - [e1]Eyal Kushilevitz, Tal Malkin:
Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part II. Lecture Notes in Computer Science 9563, Springer 2016, ISBN 978-3-662-49098-3 [contents] - [i25]Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, Amit Sahai, Ching-Hua Yu:
Secure Protocol Transformations. IACR Cryptol. ePrint Arch. 2016: 456 (2016) - 2015
- [j59]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters:
Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys. SIAM J. Comput. 44(2): 433-466 (2015) - [c102]Sanjam Garg, Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography with One-Way Communication. CRYPTO (2) 2015: 191-208 - [c101]Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz, Anat Paskin-Cherniavsky:
Secure Computation with Minimal Interaction, Revisited. CRYPTO (2) 2015: 359-378 - [i24]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Minimizing Locality of One-Way Functions via Semi-Private Randomized Encodings. Electron. Colloquium Comput. Complex. TR15 (2015) - [i23]Shai Halevi, Yuval Ishai, Abhishek Jain, Eyal Kushilevitz, Tal Rabin:
Secure Multiparty Computation with General Interaction Patterns. IACR Cryptol. ePrint Arch. 2015: 1173 (2015) - [i22]Yuval Ishai, Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky:
Private Large-Scale Databases with Distributed Searchable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2015: 1190 (2015) - 2014
- [j58]Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb:
Choosing, Agreeing, and Eliminating in Communication Complexity. Comput. Complex. 23(1): 1-42 (2014) - [j57]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
How to Garble Arithmetic Circuits. SIAM J. Comput. 43(2): 905-929 (2014) - [c100]Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky:
Non-Interactive Secure Multiparty Computation. CRYPTO (2) 2014: 387-404 - [c99]Amos Beimel, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz:
On the Cryptographic Complexity of the Worst Functions. TCC 2014: 317-342 - [i21]Eldar Aharoni, Eyal Kushilevitz:
On the Power of Multiplexing in Number-on-the-Forehead Protocols. CoRR abs/1402.5311 (2014) - [i20]Sanjam Garg, Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography with One-Way Communication. IACR Cryptol. ePrint Arch. 2014: 914 (2014) - [i19]Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky:
Non-Interactive Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 960 (2014) - 2013
- [j56]Panganamala Ramana Kumar, Eyal Kushilevitz, D. Manjunath, Muriel Médard, Alon Orlitsky, R. Srikant:
Guest Editorial: In-Network Computation: Exploring the Fundamental Limits. IEEE J. Sel. Areas Commun. 31(4): 617-619 (2013) - [c98]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters:
Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys. CRYPTO (2) 2013: 166-184 - [c97]Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman:
Robust Pseudorandom Generators. ICALP (1) 2013: 576-588 - [c96]Yuval Ishai, Eyal Kushilevitz, Omer Strulovich:
Lossy Chains and Fractional Secret Sharing. STACS 2013: 160-171 - [c95]Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, Anat Paskin-Cherniavsky:
On the Power of Correlated Randomness in Secure Computation. TCC 2013: 600-620 - [i18]Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman:
Robust Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR13 (2013) - [i17]Yuval Ishai, Eyal Kushilevitz, Omer Strulovich:
Lossy Chains and Fractional Secret Sharing. IACR Cryptol. ePrint Arch. 2013: 105 (2013) - [i16]Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman:
Robust Pseudorandom Generators. IACR Cryptol. ePrint Arch. 2013: 671 (2013) - 2012
- [c94]Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Ilan Orlov:
Share Conversion and Private Information Retrieval. CCC 2012: 258-268 - [c93]Yuval Ishai, Eyal Kushilevitz, Anat Paskin-Cherniavsky:
From randomizing polynomials to parallel algorithms. ITCS 2012: 76-89 - [c92]Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky:
On the (in)security of hash-based oblivious RAM and a new balancing scheme. SODA 2012: 143-156 - [i15]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
How to Garble Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR12 (2012) - [i14]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
How to Garble Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2012: 255 (2012) - [i13]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters:
Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits. IACR Cryptol. ePrint Arch. 2012: 693 (2012) - 2011
- [j55]Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. SIAM J. Comput. 40(1): 122-141 (2011) - [j54]Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
Black-Box Constructions of Protocols for Secure Computation. SIAM J. Comput. 40(2): 225-266 (2011) - [j53]Jan Draisma, Eyal Kushilevitz, Enav Weinreb:
Partition arguments in multiparty communication complexity. Theor. Comput. Sci. 412(24): 2611-2622 (2011) - [c91]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, Jürg Wullschleger:
Constant-Rate Oblivious Transfer from Noisy Channels. CRYPTO 2011: 667-684 - [c90]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai:
Efficient Non-interactive Secure Computation. EUROCRYPT 2011: 406-425 - [c89]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
How to Garble Arithmetic Circuits. FOCS 2011: 120-129 - [i12]Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky:
On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme. IACR Cryptol. ePrint Arch. 2011: 327 (2011) - 2010
- [j52]Eyal Kushilevitz, Yehuda Lindell, Tal Rabin:
Information-Theoretically Secure Protocols and Security under Composition. SIAM J. Comput. 39(5): 2090-2112 (2010) - [c88]Yuval Ishai, Eyal Kushilevitz, Anat Paskin:
Secure Multiparty Computation with Minimal Interaction. CRYPTO 2010: 577-594 - [c87]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
From Secrecy to Soundness: Efficient Verification via Secure Computation. ICALP (1) 2010: 152-163 - [c86]Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb:
Choosing, Agreeing, and Eliminating in Communication Complexity. ICALP (1) 2010: 451-462 - [c85]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? ICS 2010: 1-19 - [c84]Eyal Kushilevitz:
Communication Complexity: From Two-Party to Multiparty. SIROCCO 2010: 1 - [i11]Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2010: 29 (2010) - [i10]Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
Black-Box Constructions of Protocols for Secure Computation. IACR Cryptol. ePrint Arch. 2010: 164 (2010)
2000 – 2009
- 2009
- [j51]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Cryptography with Constant Input Locality. J. Cryptol. 22(4): 429-469 (2009) - [j50]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Zero-Knowledge Proofs from Secure Multiparty Computation. SIAM J. Comput. 39(3): 1121-1152 (2009) - [c83]Eyal Kushilevitz, Enav Weinreb:
The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection. FOCS 2009: 63-72 - [c82]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Extracting Correlations. FOCS 2009: 261-270 - [c81]Jan Draisma, Eyal Kushilevitz, Enav Weinreb:
Partition Arguments in Multiparty Communication Complexity. ICALP (1) 2009: 390-402 - [c80]Eyal Kushilevitz, Enav Weinreb:
On the complexity of communication complexity. STOC 2009: 465-474 - [i9]Jan Draisma, Eyal Kushilevitz, Enav Weinreb:
Partition Arguments in Multiparty Communication Complexity. CoRR abs/0909.5684 (2009) - [i8]Eyal Kushilevitz, Yehuda Lindell, Tal Rabin:
Information-Theoretically Secure Protocols and Security Under Composition. IACR Cryptol. ePrint Arch. 2009: 630 (2009) - 2008
- [j49]Shirley Halevy, Eyal Kushilevitz:
Distribution-Free Connectivity Testing for Sparse Graphs. Algorithmica 51(1): 24-48 (2008) - [j48]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
On Pseudorandom Generators with Linear Stretch in NC0. Comput. Complex. 17(1): 38-69 (2008) - [j47]Shirley Halevy, Eyal Kushilevitz:
Testing monotonicity over graph products. Random Struct. Algorithms 33(1): 44-67 (2008) - [c79]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography with constant computational overhead. STOC 2008: 433-442 - [c78]Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen:
OT-Combiners via Secure Computation. TCC 2008: 393-411 - [r1]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio:
Learning Automata. Encyclopedia of Algorithms 2008 - 2007
- [j46]Shirley Halevy, Eyal Kushilevitz:
Distribution-Free Property-Testing. SIAM J. Comput. 37(4): 1107-1138 (2007) - [c77]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky:
Efficient Arguments without Short PCPs. CCC 2007: 278-291 - [c76]Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III:
Public Key Encryption That Allows PIR Queries. CRYPTO 2007: 50-67 - [c75]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Cryptography with Constant Input Locality. CRYPTO 2007: 92-110 - [c74]Danny Harnik, Yuval Ishai, Eyal Kushilevitz:
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? CRYPTO 2007: 284-302 - [c73]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Zero-knowledge from secure multiparty computation. STOC 2007: 21-30 - [i7]Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III:
Public Key Encryption that Allows PIR Queries. IACR Cryptol. ePrint Arch. 2007: 73 (2007) - 2006
- [j45]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Computationally Private Randomizing Polynomials and Their Applications. Comput. Complex. 15(2): 115-162 (2006) - [j44]Ran Canetti, Eyal Kushilevitz, Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. J. Cryptol. 19(2): 135-167 (2006) - [j43]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Cryptography in NC0. SIAM J. Comput. 36(4): 845-888 (2006) - [c72]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
On Pseudorandom Generators with Linear Stretch in NC0. APPROX-RANDOM 2006: 260-271 - [c71]Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. CRYPTO 2006: 483-500 - [c70]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography from Anonymity. FOCS 2006: 239-248 - [c69]Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank:
Black-box constructions for secure computation. STOC 2006: 99-108 - [c68]Eyal Kushilevitz, Yehuda Lindell, Tal Rabin:
Information-theoretically secure protocols and security under composition. STOC 2006: 109-118 - [i6]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography from Anonymity. IACR Cryptol. ePrint Arch. 2006: 84 (2006) - 2005
- [j42]Amos Beimel, Yuval Ishai, Eyal Kushilevitz:
General constructions for information-theoretic private information retrieval. J. Comput. Syst. Sci. 71(2): 213-247 (2005) - [j41]Eyal Kushilevitz, Yishay Mansour:
Computation in Noisy Radio Networks. SIAM J. Discret. Math. 19(1): 96-108 (2005) - [c67]Shirley Halevy, Eyal Kushilevitz:
A Lower Bound for Distribution-Free Monotonicity Testing. APPROX-RANDOM 2005: 330-341 - [c66]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Computationally Private Randomizing Polynomials and Their Applications. CCC 2005: 260-274 - [c65]Haim Kaplan, Eyal Kushilevitz, Yishay Mansour:
Learning with attribute costs. STOC 2005: 356-365 - [c64]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky:
Sufficient Conditions for Collision-Resistant Hashing. TCC 2005: 445-456 - 2004
- [c63]Shirley Halevy, Eyal Kushilevitz:
Distribution-Free Connectivity Testing. APPROX-RANDOM 2004: 393-404 - [c62]Yuval Ishai, Eyal Kushilevitz:
On the Hardness of Information-Theoretic Multiparty Computation. EUROCRYPT 2004: 439-455 - [c61]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Cryptography in NC0. FOCS 2004: 166-175 - [c60]Shirley Halevy, Eyal Kushilevitz:
Testing Monotonicity over Graph Products. ICALP 2004: 721-732 - [c59]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Batch codes and their applications. STOC 2004: 262-271 - [i5]Ran Canetti, Eyal Kushilevitz, Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions. IACR Cryptol. ePrint Arch. 2004: 116 (2004) - 2003
- [j40]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Amortizing Randomness in Private Multiparty Computations. SIAM J. Discret. Math. 16(4): 533-544 (2003) - [j39]József Balogh, János A. Csirik, Yuval Ishai, Eyal Kushilevitz:
Private computation using a PEZ dispenser. Theor. Comput. Sci. 306(1-3): 69-84 (2003) - [c58]Ran Canetti, Eyal Kushilevitz, Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. EUROCRYPT 2003: 68-86 - [c57]Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz:
Efficient Multi-party Computation over Rings. EUROCRYPT 2003: 596-613 - [c56]Shirley Halevy, Eyal Kushilevitz:
Distribution-Free Property Testing. RANDOM-APPROX 2003: 302-317 - [c55]William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén:
Dynamic routing on networks with fixed-size buffers. SODA 2003: 771-780 - [i4]Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz:
Efficient Multi-Party Computation over Rings. IACR Cryptol. ePrint Arch. 2003: 30 (2003) - 2002
- [j38]Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz:
PAC learning with nasty noise. Theor. Comput. Sci. 288(2): 255-275 (2002) - [c54]Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin:
On 2-Round Secure Multiparty Computation. CRYPTO 2002: 178-193 - [c53]Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond:
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. FOCS 2002: 261-270 - [c52]Yuval Ishai, Eyal Kushilevitz:
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. ICALP 2002: 244-256 - [c51]Eyal Kushilevitz:
Some Applications of Polynomials for the Design of Cryptographic Protocols. SCN 2002: 1-13 - 2001
- [j37]Amos Beimel, Felix Geller, Eyal Kushilevitz:
The Query Complexity of Finding Local Minima in the Lattice. Inf. Comput. 171(1): 69-83 (2001) - [c50]Eyal Kushilevitz, Tal Rabin:
Fair e-Lotteries and e-Casinos. CT-RSA 2001: 100-109 - [c49]Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim:
Private approximation of NP-hard functions. STOC 2001: 550-559 - [c48]Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin:
The round complexity of verifiable secret sharing and secure multicast. STOC 2001: 580-589 - 2000
- [j36]Amos Beimel, Eyal Kushilevitz:
Learning unions of high-dimensional boxes over the reals. Inf. Process. Lett. 73(5-6): 213-220 (2000) - [j35]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio:
Learning functions represented as multiplicity automata. J. ACM 47(3): 506-530 (2000) - [j34]William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Adaptive Packet Routing for Bursty Adversarial Traffic. J. Comput. Syst. Sci. 60(3): 482-509 (2000) - [j33]Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin:
Protecting Data Privacy in Private Information Retrieval Schemes. J. Comput. Syst. Sci. 60(3): 592-629 (2000) - [j32]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness versus Fault-Tolerance. J. Cryptol. 13(1): 107-142 (2000) - [j31]Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky:
Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000) - [j30]Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani:
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. SIAM J. Comput. 30(2): 457-474 (2000) - [j29]Amos Beimel, Mike Burmester, Yvo Desmedt, Eyal Kushilevitz:
Computing Functions of a Shared Secret. SIAM J. Discret. Math. 13(3): 324-345 (2000) - [c47]Eyal Kushilevitz, Rafail Ostrovsky:
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval. EUROCRYPT 2000: 104-121 - [c46]Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai:
Exposure-Resilient Functions and All-or-Nothing Transforms. EUROCRYPT 2000: 453-469 - [c45]Yuval Ishai, Eyal Kushilevitz:
Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. FOCS 2000: 294-304
1990 – 1999
- 1999
- [j28]Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky:
The Linear-Array Conjecture in Communication Complexity Is False. Comb. 19(2): 241-254 (1999) - [j27]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Characterizing Linear Size Circuits in Terms of Pricacy. J. Comput. Syst. Sci. 58(1): 129-136 (1999) - [c44]Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz:
PAC Learning with Nasty Noise. ALT 1999: 206-218 - [c43]Yuval Ishai, Eyal Kushilevitz:
Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract). STOC 1999: 79-88 - [c42]Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin:
One-Way Functions Are Essential for Single-Server Private Information Retrieval. STOC 1999: 89-98 - 1998
- [j26]Amos Beimel, Eyal Kushilevitz:
Learning Boxes in High Dimension. Algorithmica 22(1/2): 76-90 (1998) - [j25]Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan:
Private Information Retrieval. J. ACM 45(6): 965-981 (1998) - [j24]Eyal Kushilevitz, Yishay Mansour:
An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks. SIAM J. Comput. 27(3): 702-712 (1998) - [j23]Howard Aizenstein, Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth:
On Learning Read-k-Satisfy-j DNF. SIAM J. Comput. 27(6): 1515-1530 (1998) - [j22]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Log-Space Polynomial End-to-End Communication. SIAM J. Comput. 27(6): 1531-1549 (1998) - [j21]Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman:
Lower Bounds for Randomized Mutual Exclusion. SIAM J. Comput. 27(6): 1550-1563 (1998) - [j20]Eyal Kushilevitz, Adi Rosén:
A Randomness-Rounds Tradeoff in Private Computation. SIAM J. Discret. Math. 11(1): 61-80 (1998) - [c41]Amos Beimel, Felix Geller, Eyal Kushilevitz:
The Query Complexity of Finding Local Minima in the Lattice. COLT 1998: 294-302 - [c40]Alex Biryukov, Eyal Kushilevitz:
From Differential Cryptanalysis to Ciphertext-Only Attacks. CRYPTO 1998: 72-88 - [c39]Alex Biryukov, Eyal Kushilevitz:
Improved Cryptanalysis of RC5. EUROCRYPT 1998: 85-99 - [c38]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Amortizing Randomness in Private Multiparty Computations. PODC 1998: 81-90 - [c37]Eyal Kushilevitz, Yishay Mansour:
Computation in Noisy Radio Networks. SODA 1998: 236-243 - [c36]Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin:
Protecting Data Privacy in Private Information Retrieval Schemes. STOC 1998: 151-160 - [c35]William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Adaptive Packet Routing for Bursty Adversarial Traffic. STOC 1998: 359-368 - [c34]Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani:
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. STOC 1998: 614-623 - [i3]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness versus Fault-Tolerance. IACR Cryptol. ePrint Arch. 1998: 14 (1998) - 1997
- [b1]Eyal Kushilevitz, Noam Nisan:
Communication complexity. Cambridge University Press 1997, ISBN 978-0-521-56067-2, pp. I-XIII, 1-189 - [j19]Eyal Kushilevitz:
Communication Complexity. Adv. Comput. 44: 331-360 (1997) - [j18]Eyal Kushilevitz:
A Simple Algorithm for Learning O (log n)-Term DNF. Inf. Process. Lett. 61(6): 289-292 (1997) - [j17]Shai Ben-David, Eyal Kushilevitz, Yishay Mansour:
Online Learning versus Offline Learning. Mach. Learn. 29(1): 45-63 (1997) - [j16]Eyal Kushilevitz, Yishay Mansour:
Randomness in Private Computations. SIAM J. Discret. Math. 10(4): 647-661 (1997) - [c33]Amos Beimel, Eyal Kushilevitz:
Learning Boxes in High Dimension. EuroCOLT 1997: 3-15 - [c32]Eyal Kushilevitz, Rafail Ostrovsky:
Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. FOCS 1997: 364-373 - [c31]Yuval Ishai, Eyal Kushilevitz:
Private Simultaneous Messages Protocols with Applications. ISTCS 1997: 174-184 - [c30]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Randomness vs. Fault-Tolerance. PODC 1997: 35-44 - [c29]Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz:
A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. STOC 1997: 324-333 - [i2]Yuval Ishai, Eyal Kushilevitz:
Protecting Data Privacy in Private Information Retrieval Schemes. IACR Cryptol. ePrint Arch. 1997: 6 (1997) - 1996
- [j15]Eyal Kushilevitz, Nathan Linial, Yuri Rabinovich, Michael E. Saks:
Witness Sets for Families of Binary Vectors. J. Comb. Theory A 73(2): 376-380 (1996) - [j14]Eyal Kushilevitz, Dan Roth:
On Learning Visual Concepts and DNF Formulae. Mach. Learn. 24(1): 65-85 (1996) - [c28]Eyal Kushilevitz:
A Simple Algorithm for Learning O(log n)-Term DNF. COLT 1996: 266-269 - [c27]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio:
On the Applications of Multiplicity Automata in Learning. FOCS 1996: 349-358 - [c26]Eyal Kushilevitz, Yishay Mansour:
Randomness in Private Computations. PODC 1996: 181-190 - [c25]Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky:
The Linear-Array Conjecture in Communication Complexity is False. STOC 1996: 1-10 - [c24]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Characterizing Linear Size Circuits in Terms of Privacy. STOC 1996: 541-550 - [i1]Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz:
A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j13]Shai Ben-David, Alon Itai, Eyal Kushilevitz:
Learning by Distances. Inf. Comput. 117(2): 240-250 (1995) - [j12]Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz:
Private Computations over the Integers. SIAM J. Comput. 24(2): 376-386 (1995) - [j11]Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan:
Amortized Communication Complexity. SIAM J. Comput. 24(4): 736-750 (1995) - [j10]Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan:
Fractional Covers and Communication Complexity. SIAM J. Discret. Math. 8(1): 76-92 (1995) - [j9]Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin:
On Lotteries with Unique Winners. SIAM J. Discret. Math. 8(1): 93-98 (1995) - [c23]Shai Ben-David, Nadav Eiron, Eyal Kushilevitz:
On Self-Directed Learning. COLT 1995: 136-143 - [c22]Shai Ben-David, Eyal Kushilevitz, Yishay Mansour:
Online learning versus offline learning. EuroCOLT 1995: 38-52 - [c21]Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan:
Private Information Retrieval. FOCS 1995: 41-50 - [c20]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Log-Space Polynomial End-to-End Communication (Abstract). PODC 1995: 254 - [c19]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Log-space polynomial end-to-end communication. STOC 1995: 559-568 - 1994
- [j8]Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz:
On the Structure of the Privacy Hierarchy. J. Cryptol. 7(1): 53-60 (1994) - [c18]Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz:
On Ultrafilters and NP. SCT 1994: 97-105 - [c17]Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth:
On Learning Read-k-Satisfy-j DNF. COLT 1994: 110-117 - [c16]Eyal Kushilevitz, Adi Rosén:
A Randomnesss-Rounds Tradeoff in Private Computation. CRYPTO 1994: 397-410 - [c15]Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky:
Reducibility and Completeness in Multi-Party Private Computations. FOCS 1994: 478-489 - 1993
- [j7]Benny Chor, Eyal Kushilevitz:
A Communication-Privacy Tradeoff for Modular Addition. Inf. Process. Lett. 45(4): 205-210 (1993) - [j6]Benny Chor, Eyal Kushilevitz:
Secret Sharing Over Infinite Domains. J. Cryptol. 6(2): 87-95 (1993) - [j5]Oded Goldreich, Eyal Kushilevitz:
A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm. J. Cryptol. 6(2): 97-116 (1993) - [j4]Eyal Kushilevitz, Yishay Mansour:
Learning Decision Trees Using the Fourier Spectrum. SIAM J. Comput. 22(6): 1331-1348 (1993) - [j3]Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky:
Privacy, additional information and communication. IEEE Trans. Inf. Theory 39(6): 1930-1943 (1993) - [c14]Eyal Kushilevitz, Dan Roth:
On Learning Visual Concepts and DNF Formulae. COLT 1993: 317-326 - [c13]Eyal Kushilevitz, Yishay Mansour:
An Omega(D log(N/D)) Lower Bound for Broadcast in Radio Networks. PODC 1993: 65-74 - [c12]Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman:
Lower bounds for randomized mutual exclusion. STOC 1993: 154-163 - 1992
- [j2]Eyal Kushilevitz:
Privacy and Communication Complexity. SIAM J. Discret. Math. 5(2): 273-284 (1992) - [c11]Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan:
Fractional Covers and Communication Complexity. SCT 1992: 262-274 - [c10]Eyal Kushilevitz, Michael O. Rabin:
Randomized Mutual Exclusion Algorithms Revisited. PODC 1992: 275-283 - 1991
- [j1]Benny Chor, Eyal Kushilevitz:
A Zero-One Law for Boolean Privacy. SIAM J. Discret. Math. 4(1): 36-47 (1991) - [c9]Tomás Feder, Eyal Kushilevitz, Moni Naor:
Amortized Communication Complexity (Preliminary Version). FOCS 1991: 239-248 - [c8]Eyal Kushilevitz, Yishay Mansour:
Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract). STOC 1991: 455-464 - 1990
- [c7]Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz:
Privacy, Additional Information, and Communication. SCT 1990: 55-65 - [c6]Shai Ben-David, Alon Itai, Eyal Kushilevitz:
Learning by Distances. COLT 1990: 232-245 - [c5]Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz:
Private Computations Over the Integers (Extended Abstract). FOCS 1990: 335-344
1980 – 1989
- 1989
- [c4]Benny Chor, Eyal Kushilevitz:
Secret Sharing Over Infinite Domains (Extended Abstract). CRYPTO 1989: 299-306 - [c3]Eyal Kushilevitz:
Privacy and Communication Complexity. FOCS 1989: 416-421 - [c2]Benny Chor, Eyal Kushilevitz:
A Zero-One Law for Boolean Privacy (extended abstract). STOC 1989: 62-72 - 1988
- [c1]Oded Goldreich, Eyal Kushilevitz:
A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm. CRYPTO 1988: 57-70
Coauthor Index
[c126] [c125] [c124] [c123] [c121] [i46] [i45] [i44] [i43] [i42] [i41] [i40] [c118] [c117] [c115] [c113] [i34] [i33] [j60] [c110] [i29] [c109] [c108] [i28] [i27] [i26] [c106] [c105] [c104] [c103] [i25] [j59] [c102] [c101] [i24] [i23] [i22] [j57] [c100] [c99] [i20] [i19] [c98] [c97] [c96] [c95] [i18] [i17] [i16] [c94] [c93] [i15] [i14] [i13] [j55] [j54] [c91] [c90] [c89] [c88] [c87] [c85] [i11] [i10] [j51] [j50] [c82] [j48] [c79] [c78] [c77] [c75] [c74] [c73] [j45] [j43] [c72] [c71] [c70] [c69] [i6] [j42] [c66] [c64] [c62] [c61] [c59] [j39] [c57] [i4] [c54] [c53] [c52] [c48] [j33] [c45] [c43] [c42] [c36] [c31] [i2]
[c122] [c120] [i38] [j61] [i37] [c116] [c115] [c112] [i34] [i30] [c105] [c102] [i22] [i20] [c97] [i18] [i16] [c92] [c91] [c90] [i12] [j50] [c82] [c79] [c77] [c76] [c73] [i7] [c70] [i6] [c64] [c59] [j40] [c55] [j34] [j32] [j31] [j30] [c47] [j28] [j27] [j22] [c38] [c35] [c34] [i3] [c32] [c30] [c25] [c24] [c20] [c19] [c15]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
