The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Yuval Ishai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    On Pseudorandom Generators with Linear Stretch in NC0. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:260-271 [Conf]
  2. Amos Beimel, Yuval Ishai
    On the Power of Nonlinear Secrect-Sharing. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:188-202 [Conf]
  3. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    Computationally Private Randomizing Polynomials and Their Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:260-274 [Conf]
  4. Omer Barkol, Yuval Ishai
    Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2005, pp:395-411 [Conf]
  5. Amos Beimel, Yuval Ishai, Tal Malkin
    Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:55-73 [Conf]
  6. Ivan Damgård, Yuval Ishai
    Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2005, pp:378-394 [Conf]
  7. Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin
    On 2-Round Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:178-193 [Conf]
  8. Niv Gilboa, Yuval Ishai
    Compressing Cryptographic Resources. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:591-608 [Conf]
  9. Yuval Ishai, Joe Kilian, Kobbi Nissim, Erez Petrank
    Extending Oblivious Transfers Efficiently. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:145-161 [Conf]
  10. Yuval Ishai, Amit Sahai, David Wagner
    Private Circuits: Securing Hardware against Probing Attacks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2003, pp:463-481 [Conf]
  11. Ivan Damgård, Yuval Ishai
    Scalable Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:501-520 [Conf]
  12. Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
    On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:483-500 [Conf]
  13. William Aiello, Yuval Ishai, Omer Reingold
    Priced Oblivious Transfer: How to Sell Digital Goods. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:119-135 [Conf]
  14. Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin
    On Adaptive vs. Non-adaptive Security of Multiparty Protocols. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:262-279 [Conf]
  15. Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz
    Efficient Multi-party Computation over Rings. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:596-613 [Conf]
  16. Yuval Ishai, Eyal Kushilevitz
    On the Hardness of Information-Theoretic Multiparty Computation. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:439-455 [Conf]
  17. Yuval Ishai, Manoj Prabhakaran, Amit Sahai, David Wagner
    Private Circuits II: Keeping Secrets in Tamperable Circuits. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:308-327 [Conf]
  18. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    Cryptography in NC0. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:166-175 [Conf]
  19. Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond
    Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:261-270 [Conf]
  20. Yuval Ishai, Eyal Kushilevitz
    Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:294-304 [Conf]
  21. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
    Cryptography from Anonymity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:239-248 [Conf]
  22. Amos Beimel, Yuval Ishai
    Information-Theoretic Private Information Retrieval: A Unified Construction. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:912-926 [Conf]
  23. Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright
    Secure Multiparty Computation of Approximations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:927-938 [Conf]
  24. Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
    Communication Versus Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:745-756 [Conf]
  25. Yuval Ishai, Eyal Kushilevitz
    Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:244-256 [Conf]
  26. Benny Chor, Yuval Ishai
    On Privacy and Partition Arguments. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:191-194 [Conf]
  27. Yuval Ishai, Eyal Kushilevitz
    Private Simultaneous Messages Protocols with Applications. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:174-184 [Conf]
  28. Ran Canetti, Yuval Ishai, Ravi Kumar, Michael K. Reiter, Ronitt Rubinfeld, Rebecca N. Wright
    Selective private function evaluation with applications to private statistics. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:293-304 [Conf]
  29. Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky
    Universal Service-Providers for Database Private Information Retrieval (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:91-100 [Conf]
  30. Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin
    One-Way Functions Are Essential for Single-Server Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:89-98 [Conf]
  31. Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky
    Non-Interactive and Non-Malleable Commitment. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:141-150 [Conf]
  32. Bella Dubrov, Yuval Ishai
    On the randomness complexity of efficient sampling. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:711-720 [Conf]
  33. Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin
    The round complexity of verifiable secret sharing and secure multicast. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:580-589 [Conf]
  34. Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin
    Protecting Data Privacy in Private Information Retrieval Schemes. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:151-160 [Conf]
  35. Yuval Ishai, Eyal Kushilevitz
    Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:79-88 [Conf]
  36. Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank
    Black-box constructions for secure computation. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:99-108 [Conf]
  37. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
    Batch codes and their applications. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:262-271 [Conf]
  38. Ronald Cramer, Ivan Damgård, Yuval Ishai
    Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:342-362 [Conf]
  39. Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold
    Keyword Search and Oblivious Pseudorandom Functions. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:303-324 [Conf]
  40. Yuval Ishai, Anat Paskin
    Evaluating Branching Programs on Encrypted Data. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:575-594 [Conf]
  41. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
    Sufficient Conditions for Collision-Resistant Hashing. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:445-456 [Conf]
  42. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    Computationally Private Randomizing Polynomials and Their Applications. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:2, pp:115-162 [Journal]
  43. Martin Anthony, Peter L. Bartlett, Yuval Ishai, John Shawe-Taylor
    Valid Generalisation from Approximate Interpolation. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:191-214 [Journal]
  44. Amos Beimel, Yuval Ishai
    Information-Theoretic Private Information Retrieval: A Unified Construction [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:15, pp:- [Journal]
  45. Benny Chor, Yuval Ishai
    On Privacy and Partition Arguments. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:167, n:1, pp:2-9 [Journal]
  46. Amos Beimel, Yuval Ishai, Eyal Kushilevitz
    General constructions for information-theoretic private information retrieval. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:2, pp:213-247 [Journal]
  47. Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin
    Protecting Data Privacy in Private Information Retrieval Schemes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:3, pp:592-629 [Journal]
  48. Amos Beimel, Yuval Ishai, Tal Malkin
    Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2004, v:17, n:2, pp:125-151 [Journal]
  49. Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin
    Adaptive versus Non-Adaptive Security of Multi-Party Protocols. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2004, v:17, n:3, pp:153-207 [Journal]
  50. Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky
    Universal Service-Providers for Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2001, v:14, n:1, pp:37-74 [Journal]
  51. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    Cryptography in NC0. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:845-888 [Journal]
  52. Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright
    Secure multiparty computation of approximations. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:3, pp:435-472 [Journal]
  53. József Balogh, János A. Csirik, Yuval Ishai, Eyal Kushilevitz
    Private computation using a PEZ dispenser. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:69-84 [Journal]
  54. Omer Barkol, Yuval Ishai, Enav Weinreb
    On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:311-325 [Conf]
  55. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
    Efficient Arguments without Short PCPs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:278-291 [Conf]
  56. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
    Cryptography with Constant Input Locality. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:92-110 [Conf]
  57. Danny Harnik, Yuval Ishai, Eyal Kushilevitz
    How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:284-302 [Conf]
  58. Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright
    Private Multiparty Sampling and Approximation of Vector Combinations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:243-254 [Conf]
  59. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
    Zero-knowledge from secure multiparty computation. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:21-30 [Conf]
  60. Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
    Communication vs. Computation. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2007, v:16, n:1, pp:1-33 [Journal]

  61. Founding Cryptography on Oblivious Transfer - Efficiently. [Citation Graph (, )][DBLP]


  62. Scalable Multiparty Computation with Nearly Optimal Work and Resilience. [Citation Graph (, )][DBLP]


  63. Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. [Citation Graph (, )][DBLP]


  64. Secure Multiparty Computation with Minimal Interaction. [Citation Graph (, )][DBLP]


  65. Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle. [Citation Graph (, )][DBLP]


  66. Bounded Key-Dependent Message Security. [Citation Graph (, )][DBLP]


  67. Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography. [Citation Graph (, )][DBLP]


  68. Extracting Correlations. [Citation Graph (, )][DBLP]


  69. From Secrecy to Soundness: Efficient Verification via Secure Computation. [Citation Graph (, )][DBLP]


  70. Cryptography with constant computational overhead. [Citation Graph (, )][DBLP]


  71. Communication in the presence of replication. [Citation Graph (, )][DBLP]


  72. OT-Combiners via Secure Computation. [Citation Graph (, )][DBLP]


  73. Basing Weak Public-Key Cryptography on Strong One-Way Functions. [Citation Graph (, )][DBLP]


  74. Secure Arithmetic Computation with No Honest Majority. [Citation Graph (, )][DBLP]


  75. Secure Computation and Its Diverse Applications. [Citation Graph (, )][DBLP]


  76. On Complete Primitives for Fairness. [Citation Graph (, )][DBLP]


  77. Founding Cryptography on Tamper-Proof Hardware Tokens. [Citation Graph (, )][DBLP]


  78. Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? [Citation Graph (, )][DBLP]


  79. On Pseudorandom Generators with Linear Stretch in NC0. [Citation Graph (, )][DBLP]


  80. Secure Arithmetic Computation with No Honest Majority [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002