| 2013 | ||
|---|---|---|
| c79 | Joshua Baron, Yuval Ishai, Rafail Ostrovsky: On Linear-Size Pseudorandom Generators and Hardcore Functions. COCOON 2013: 169-181 | |
| c78 | Yuval Ishai, Eyal Kushilevitz, Omer Strulovich: Lossy Chains and Fractional Secret Sharing. STACS 2013: 160-171 | |
| c77 | Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth: Succinct Non-interactive Arguments via Linear Interactive Proofs. TCC 2013: 315-333 | |
| c76 | Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, Anat Paskin-Cherniavsky: On the Power of Correlated Randomness in Secure Computation. TCC 2013: 600-620 | |
| i22 | Yuval Ishai, Eyal Kushilevitz, Omer Strulovich: Lossy Chains and Fractional Secret Sharing. IACR Cryptology ePrint Archive 2013: 105 (2013) | |
| 2012 | ||
| c75 | Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Ilan Orlov: Share Conversion and Private Information Retrieval. IEEE Conference on Computational Complexity 2012: 258-268 | |
| c74 | Yuval Ishai, Eyal Kushilevitz, Anat Paskin-Cherniavsky: From randomizing polynomials to parallel algorithms. ITCS 2012: 76-89 | |
| c73 | Yuval Ishai, Rafail Ostrovsky, Hakan Seyalioglu: Identifying Cheaters without an Honest Majority. TCC 2012: 21-38 | |
| c72 | ||
| i21 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: How to Garble Arithmetic Circuits. Electronic Colloquium on Computational Complexity (ECCC) 19: 58 (2012) | |
| i20 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: How to Garble Arithmetic Circuits. IACR Cryptology ePrint Archive 2012: 255 (2012) | |
| i19 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters: Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits. IACR Cryptology ePrint Archive 2012: 693 (2012) | |
| i18 | Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth: Succinct Non-Interactive Arguments via Linear Interactive Proofs. IACR Cryptology ePrint Archive 2012: 718 (2012) | |
| 2011 | ||
| j20 | 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) | |
| j19 | 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) | |
| c71 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, Jürg Wullschleger: Constant-Rate Oblivious Transfer from Noisy Channels. CRYPTO 2011: 667-684 | |
| c70 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai: Efficient Non-interactive Secure Computation. EUROCRYPT 2011: 406-425 | |
| c69 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: How to Garble Arithmetic Circuits. FOCS 2011: 120-129 | |
| c68 | ||
| c67 | Benny Applebaum, Danny Harnik, Yuval Ishai: Semantic Security under Related-Key Attacks and Applications. ICS 2011: 45-60 | |
| e1 | Yuval Ishai (Ed.): Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings. Lecture Notes in Computer Science 6597, Springer 2011, isbn 978-3-642-19570-9 | |
| 2010 | ||
| j18 | Omer Barkol, Yuval Ishai, Enav Weinreb: On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR. Algorithmica 58(4): 831-859 (2010) | |
| j17 | Omer Barkol, Yuval Ishai, Enav Weinreb: On d-Multiplicative Secret Sharing. J. Cryptology 23(4): 580-593 (2010) | |
| c66 | Yuval Ishai, Abishek Kumarasubramanian, Claudio Orlandi, Amit Sahai: On Invertible Sampling and Adaptive Security. ASIACRYPT 2010: 466-482 | |
| c65 | Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit Sahai: Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. CRYPTO 2010: 173-190 | |
| c64 | Yuval Ishai, Eyal Kushilevitz, Anat Paskin: Secure Multiparty Computation with Minimal Interaction. CRYPTO 2010: 577-594 | |
| c63 | Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai: Bounded Key-Dependent Message Security. EUROCRYPT 2010: 423-444 | |
| c62 | Ivan Damgård, Yuval Ishai, Mikkel Krøigaard: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography. EUROCRYPT 2010: 445-465 | |
| c61 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: From Secrecy to Soundness: Efficient Verification via Secure Computation. ICALP (1) 2010: 152-163 | |
| c60 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? ICS 2010: 1-19 | |
| c59 | ||
| c58 | S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostrovsky, Amit Sahai: On Complete Primitives for Fairness. TCC 2010: 91-108 | |
| c57 | Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, Akshay Wadia: Founding Cryptography on Tamper-Proof Hardware Tokens. TCC 2010: 308-326 | |
| i17 | Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit Sahai: Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. Electronic Colloquium on Computational Complexity (ECCC) 17: 20 (2010) | |
| i16 | Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. IACR Cryptology ePrint Archive 2010: 29 (2010) | |
| i15 | Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit Sahai: Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. IACR Cryptology ePrint Archive 2010: 89 (2010) | |
| i14 | Ivan Damgård, Yuval Ishai, Mikkel Krøigaard: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography. IACR Cryptology ePrint Archive 2010: 106 (2010) | |
| i13 | Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, Akshay Wadia: Founding Cryptography on Tamper-Proof Hardware Tokens. IACR Cryptology ePrint Archive 2010: 153 (2010) | |
| i12 | Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-Box Constructions of Protocols for Secure Computation. IACR Cryptology ePrint Archive 2010: 164 (2010) | |
| i11 | Benny Applebaum, Danny Harnik, Yuval Ishai: Semantic Security Under Related-Key Attacks and Applications. IACR Cryptology ePrint Archive 2010: 544 (2010) | |
| 2009 | ||
| j16 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography with Constant Input Locality. J. Cryptology 22(4): 429-469 (2009) | |
| j15 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Zero-Knowledge Proofs from Secure Multiparty Computation. SIAM J. Comput. 39(3): 1121-1152 (2009) | |
| j14 | Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright: Private multiparty sampling and approximation of vector combinations. Theor. Comput. Sci. 410(18): 1730-1745 (2009) | |
| c56 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Extracting Correlations. FOCS 2009: 261-270 | |
| c55 | Yuval Ishai, Manoj Prabhakaran, Amit Sahai: Secure Arithmetic Computation with No Honest Majority. TCC 2009: 294-314 | |
| i10 | Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval Ishai: Bounded Key-Dependent Message Security. IACR Cryptology ePrint Archive 2009: 511 (2009) | |
| 2008 | ||
| j13 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: On Pseudorandom Generators with Linear Stretch in NC0. Computational Complexity 17(1): 38-69 (2008) | |
| c54 | Ivan Damgård, Yuval Ishai, Mikkel Krøigaard, Jesper Buus Nielsen, Adam Smith: Scalable Multiparty Computation with Nearly Optimal Work and Resilience. CRYPTO 2008: 241-261 | |
| c53 | Yuval Ishai, Manoj Prabhakaran, Amit Sahai: Founding Cryptography on Oblivious Transfer - Efficiently. CRYPTO 2008: 572-591 | |
| c52 | Jens Groth, Yuval Ishai: Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle. EUROCRYPT 2008: 379-396 | |
| c51 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Cryptography with constant computational overhead. STOC 2008: 433-442 | |
| c50 | Omer Barkol, Yuval Ishai, Enav Weinreb: Communication in the presence of replication. STOC 2008: 661-670 | |
| c49 | Eli Biham, Yaron J. Goren, Yuval Ishai: Basing Weak Public-Key Cryptography on Strong One-Way Functions. TCC 2008: 55-72 | |
| c48 | Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen: OT-Combiners via Secure Computation. TCC 2008: 393-411 | |
| i9 | Yuval Ishai, Manoj Prabhakaran, Amit Sahai: Secure Arithmetic Computation with No Honest Majority. CoRR abs/0811.0475 (2008) | |
| i8 | Yuval Ishai, Manoj Prabhakaran, Amit Sahai: Secure Arithmetic Computation with No Honest Majority. IACR Cryptology ePrint Archive 2008: 465 (2008) | |
| 2007 | ||
| j12 | Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh: Communication vs. Computation. Computational Complexity 16(1): 1-33 (2007) | |
| c47 | Omer Barkol, Yuval Ishai, Enav Weinreb: On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR. APPROX-RANDOM 2007: 311-325 | |
| c46 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky: Efficient Arguments without Short PCPs. IEEE Conference on Computational Complexity 2007: 278-291 | |
| c45 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography with Constant Input Locality. CRYPTO 2007: 92-110 | |
| c44 | Danny Harnik, Yuval Ishai, Eyal Kushilevitz: How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? CRYPTO 2007: 284-302 | |
| c43 | Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright: Private Multiparty Sampling and Approximation of Vector Combinations. ICALP 2007: 243-254 | |
| c42 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Zero-knowledge from secure multiparty computation. STOC 2007: 21-30 | |
| c41 | ||
| 2006 | ||
| j11 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Computationally Private Randomizing Polynomials and Their Applications. Computational Complexity 15(2): 115-162 (2006) | |
| j10 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography in NC0. SIAM J. Comput. 36(4): 845-888 (2006) | |
| j9 | Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright: Secure multiparty computation of approximations. ACM Transactions on Algorithms 2(3): 435-472 (2006) | |
| c40 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: On Pseudorandom Generators with Linear Stretch in NC0. APPROX-RANDOM 2006: 260-271 | |
| c39 | Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. CRYPTO 2006: 483-500 | |
| c38 | ||
| c37 | Yuval Ishai, Manoj Prabhakaran, Amit Sahai, David Wagner: Private Circuits II: Keeping Secrets in Tamperable Circuits. EUROCRYPT 2006: 308-327 | |
| c36 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Cryptography from Anonymity. FOCS 2006: 239-248 | |
| c35 | Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-box constructions for secure computation. STOC 2006: 99-108 | |
| c34 | ||
| i7 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Cryptography from Anonymity. IACR Cryptology ePrint Archive 2006: 84 (2006) | |
| 2005 | ||
| j8 | Amos Beimel, Yuval Ishai, Eyal Kushilevitz: General constructions for information-theoretic private information retrieval. J. Comput. Syst. Sci. 71(2): 213-247 (2005) | |
| c33 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Computationally Private Randomizing Polynomials and Their Applications. IEEE Conference on Computational Complexity 2005: 260-274 | |
| c32 | Ivan Damgård, Yuval Ishai: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. CRYPTO 2005: 378-394 | |
| c31 | Omer Barkol, Yuval Ishai: Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems. CRYPTO 2005: 395-411 | |
| c30 | Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold: Keyword Search and Oblivious Pseudorandom Functions. TCC 2005: 303-324 | |
| c29 | Ronald Cramer, Ivan Damgård, Yuval Ishai: Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. TCC 2005: 342-362 | |
| c28 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky: Sufficient Conditions for Collision-Resistant Hashing. TCC 2005: 445-456 | |
| i6 | Ivan Damgård, Yuval Ishai: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. IACR Cryptology ePrint Archive 2005: 262 (2005) | |
| 2004 | ||
| j7 | Amos Beimel, Yuval Ishai, Tal Malkin: Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing. J. Cryptology 17(2): 125-151 (2004) | |
| j6 | Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin: Adaptive versus Non-Adaptive Security of Multi-Party Protocols. J. Cryptology 17(3): 153-207 (2004) | |
| c27 | Yuval Ishai, Eyal Kushilevitz: On the Hardness of Information-Theoretic Multiparty Computation. EUROCRYPT 2004: 439-455 | |
| c26 | ||
| c25 | Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh: Communication Versus Computation. ICALP 2004: 745-756 | |
| c24 | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Batch codes and their applications. STOC 2004: 262-271 | |
| 2003 | ||
| j5 | 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) | |
| c23 | Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank: Extending Oblivious Transfers Efficiently. CRYPTO 2003: 145-161 | |
| c22 | Yuval Ishai, Amit Sahai, David Wagner: Private Circuits: Securing Hardware against Probing Attacks. CRYPTO 2003: 463-481 | |
| c21 | Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz: Efficient Multi-party Computation over Rings. EUROCRYPT 2003: 596-613 | |
| i5 | Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz: Efficient Multi-Party Computation over Rings. IACR Cryptology ePrint Archive 2003: 30 (2003) | |
| 2002 | ||
| c20 | Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin: On 2-Round Secure Multiparty Computation. CRYPTO 2002: 178-193 | |
| c19 | 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 | |
| c18 | Yuval Ishai, Eyal Kushilevitz: Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. ICALP 2002: 244-256 | |
| 2001 | ||
| j4 | ||
| j3 | Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky: Universal Service-Providers for Private Information Retrieval. J. Cryptology 14(1): 37-74 (2001) | |
| c17 | Amos Beimel, Yuval Ishai: On the Power of Nonlinear Secrect-Sharing. IEEE Conference on Computational Complexity 2001: 188-202 | |
| c16 | William Aiello, Yuval Ishai, Omer Reingold: Priced Oblivious Transfer: How to Sell Digital Goods. EUROCRYPT 2001: 119-135 | |
| c15 | Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin: On Adaptive vs. Non-adaptive Security of Multiparty Protocols. EUROCRYPT 2001: 262-279 | |
| c14 | Amos Beimel, Yuval Ishai: Information-Theoretic Private Information Retrieval: A Unified Construction. ICALP 2001: 912-926 | |
| c13 | Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright: Secure Multiparty Computation of Approximations. ICALP 2001: 927-938 | |
| c12 | Ran Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright: Selective private function evaluation with applications to private statistics. PODC 2001: 293-304 | |
| c11 | Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin: The round complexity of verifiable secret sharing and secure multicast. STOC 2001: 580-589 | |
| i4 | Amos Beimel, Yuval Ishai: Information-Theoretic Private Information Retrieval: A Unified Construction. Electronic Colloquium on Computational Complexity (ECCC) 8(15) (2001) | |
| i3 | Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin: On adaptive vs. non-adaptive security of multiparty protocols. IACR Cryptology ePrint Archive 2001: 17 (2001) | |
| i2 | Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright: Secure Multiparty Computation of Approximations. IACR Cryptology ePrint Archive 2001: 24 (2001) | |
| i1 | Amos Beimel, Yuval Ishai: On the Power of Nonlinear Secret-Sharing. IACR Cryptology ePrint Archive 2001: 30 (2001) | |
| 2000 | ||
| j2 | 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) | |
| c10 | Amos Beimel, Yuval Ishai, Tal Malkin: Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing. CRYPTO 2000: 55-73 | |
| c9 | Yuval Ishai, Eyal Kushilevitz: Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. FOCS 2000: 294-304 | |
| 1999 | ||
| c8 | ||
| c7 | Yuval Ishai, Eyal Kushilevitz: Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract). STOC 1999: 79-88 | |
| c6 | Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin: One-Way Functions Are Essential for Single-Server Private Information Retrieval. STOC 1999: 89-98 | |
| 1998 | ||
| c5 | Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky: Universal Service-Providers for Database Private Information Retrieval (Extended Abstract). PODC 1998: 91-100 | |
| c4 | Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky: Non-Interactive and Non-Malleable Commitment. STOC 1998: 141-150 | |
| c3 | Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin: Protecting Data Privacy in Private Information Retrieval Schemes. STOC 1998: 151-160 | |
| 1997 | ||
| c2 | Yuval Ishai, Eyal Kushilevitz: Private Simultaneous Messages Protocols with Applications. ISTCS 1997: 174-184 | |
| 1996 | ||
| j1 | Martin Anthony, Peter L. Bartlett, Yuval Ishai, John Shawe-Taylor: Valid Generalisation from Approximate Interpolation. Combinatorics, Probability & Computing 5: 191-214 (1996) | |
| c1 | ||
Colors in the list of coauthors
Last update Wed May 22 23:38:21 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page