- On 2-Round Secure Multiparty Computation Rosario Gennaro 1 , Yuval Ishai 2? , Eyal Kushilevitz 3?? , and Tal Rabin 1
- Randomizing Polynomials: A New Representation with Applications to RoundEfficient Secure Computation
- Private Circuits: Securing Hardware against Probing Attacks
- Recall that a strong simulator S 0 for an adversary A 0 attacking protocol P 0 proceeds as follows. On input a T ; z T it first outputs a uniformly random x T
- Share conversion, pseudorandom secretsharing and applications to secure computation
- Communication vs. Computation Prahladh Harsha # Yuval Ishai + Joe Kilian # Kobbi Nissim S. Venkatesh
- Priced Oblivious Transfer: How to Sell Digital Goods
- Selective Private Function Evaluation with Applications to Private Statistics
- On the Hardness of Information-Theoretic Multiparty Computation Yuval Ishai Eyal Kushilevitz
- Batch Codes and Their Applications Yuval Ishai
- Extending Oblivious Transfers Eciently Yuval Ishai 1 , Joe Kilian 2 , Kobbi Nissim 2? , and Erez Petrank 1??
- On adaptive vs. nonadaptive security of multiparty protocols
- The Round Complexity of Verifiable Secret Sharing and Secure Multicast
- Perfect ConstantRound Secure Computation via Perfect Randomizing Polynomials
- Su#cient Conditions for CollisionResistant Hashing
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- InformationTheoretic Private Information Retrieval: A Unified Construction
- E#cient MultiParty Computation over Rings Ronald Cramer 1 , Serge Fehr 1 , Yuval Ishai 2 , and Eyal Kushilevitz 2
- General Constructions for Information-Theoretic
- Secure Multiparty Computation of Approximations
- Cryptography in NC0 Benny Applebaum Yuval Ishai Eyal Kushilevitz
- On Privacy and Partition Arguments 1 Benny Chor 2 and Yuval Ishai 3
- Computationally Private Randomizing Polynomials and Their Applications #
- Reducing the Servers' Computation in Private Information Retrieval: PIR with Preprocessing
- Breaking the O(n 1=(2k\Gamma1) ) Barrier for
- Communication vs. Computation Prahladh Harsha
- Keyword Search and Oblivious Pseudorandom Functions
- Private Computation Using a PEZ Dispenser Jozsef Balogh # Janos A. Csirik + Yuval Ishai # Eyal Kushilevitz
- Priced Oblivious Transfer: How to Sell Digital Goods
- [73] P. Pudl'ak and V. Rodl. Modified ranks of tensors and the size of circuits. In Proc. of the 25th Annu. ACM Symp. on the Theory of Computing, pages 523--531, 1993.
- Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems ?
- On the Power of Nonlinear SecretSharing Amos Beimel
- ffl P 1 reconstructs all messages m i and uses them to re construct f .
