102 citations found. Retrieving documents...
Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proc. 31st Annual ACM Symposium on Theory of Computing, pages 245--254, Atlanta, Georgia, May 1999.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Keyword Search and Oblivious Pseudorandom Functions - Freedman, Ishai, Pinkas.. (2005)   (3 citations)  Self-citation (Pinkas)   (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proc. 31st ACM STOC, Atlanta, GA, May 1999.


Efficient Private Matching and Set Intersection - Freedman, Nissim, Pinkas (2004)   (1 citation)  Self-citation (Pinkas)   (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proc. 31st Annual ACM Symposium on Theory of Computing, pages 245--254, Atlanta, Georgia, May 1999.


Efficient Private Matching and Set Intersection - Freedman, Nissim, Pinkas (2004)   (1 citation)  Self-citation (Pinkas)   (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proc. 31st Annual ACM Symposium on Theory of Computing, pages 245--254, Atlanta, Georgia, May 1999.


Testing Disjointness of Private Datasets - Aggelos Kiayias And (2005)   (2 citations)  (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proc. 31st Annual ACM Symposium on Theory of Computing, pages 245--254, Atlanta, Georgia, May 1999.


Invited Survey Paper - Directions In Polynomial   (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Tom Leighton, editor, 31st Annual pages 245--254, Atlanta, USA, 1999. ACM PRess.


On Security of Sublinear Oblivious Transfer - Laur, Lipmaa (2006)   (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious Transfer and Polynomial Evaluation. In Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing, pages 245--254, Atlanta, Georgia, USA, May 1--4, 1999. ACM Press.


Fast Three-Party Shared Generation of RSA Keys without.. - Ibrahim, Ibrahim.. (2004)   (Correct)

No context found.

Noar, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In Proc. of stat. Stoc. (1999) 245--254.


Two-Party Private Vector Dominance: The All-Or-Nothing Deal - Maged Hamada Ibrahim   (Correct)

No context found.

M. Noar and B. Pinkas, "Oblivious transfer and polynomial evaluation," In Proc. of stat. Stoc., 1999, pp. 245--254.


Private Searching On Streaming Data - Rafail Ostrovsky William (2005)   (4 citations)  (Correct)

No context found.

M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. Proc. 31st STOC, pp. 245--254, 1999.


Cryptography from Anonymity - Ishai, Kushilevitz, Ostrovsky, Sahai (2006)   (Correct)

No context found.

M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. Proc. of 31st STOC, pp. 245-- 254, 1999.


Privacy-Preserving Set Operations - Lea Kissner Dawn (2005)   (1 citation)  (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proc. ACM Symposium on Theory of Computing, pages 245--54, 1999.


Private Searching On Streaming Data - Rafail Ostrovsky William (2005)   (4 citations)  (Correct)

No context found.

M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. Proc. 31st STOC, pp. 245--254, 1999.


Achieving Fairness in Private Contract - Negotiation Keith Frikken   (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proceedings of the thirty-first annual ACM symposium on Theory of computing, pages 245--254. ACM Press, 1999.


Testing Disjointness of Private Datasets - Aggelos Kiayias And (2005)   (2 citations)  (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proc. 31st Annual ACM Symposium on Theory of Computing, pages 245--254, Atlanta, Georgia, May 1999.


Fast Fully-Distributed and Threshold RSA Function Sharing - Ibrahim, Ibrahim, El-Sawy (2004)   (Correct)

No context found.

Noar, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In Proc. of stat. Stoc. (1999) 245--254.


Fast Three-Party Shared Generation of RSA Keys without.. - Ibrahim, Ibrahim.. (2004)   (Correct)

No context found.

Noar, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In Proc. of stat. Stoc. (1999) 245--254.


One-way Trapdoor Permutations Are Sufficient for.. - Kushilevitz, Ostrovsky (2000)   (1 citation)  (Correct)

No context found.

M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In Proc. of the 31th Annu. ACM Symp. on the Theory of Computing, pages 245--254, 1999.


Single Database Private Information Retrieval Implies .. - Di Crescenzo.. (2000)   (16 citations)  (Correct)

No context found.

M. Naor and B. Pinkas. Oblivious Transfer and Polynomial Evaluation. In Proc. of 31st STOC, 1999.


Session-Key Generation Using Human Passwords Only - Goldreich, Lindell (2005)   (24 citations)  (Correct)

No context found.

M. Naor and B. Pinkas. Oblivious Transfer and Polynomial Evaluation. In the 31st ACM Symposium on the Theory of Computing, pages 245-254, 1999.


Efficient k-out-of-n Oblivious Transfer Schemes with Adaptive.. - Chu, Tzeng (2004)   (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proceedings of the 31th Annual ACM Symposium on the Theory of Computing (STOC '99), pages 245--254. ACM, 1999.


Testing Disjointness of Private Datasets - Kiayias, Mitrofanova (2005)   (2 citations)  (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proc. 31st Annual ACM Symposium on Theory of Computing, pages 245--254, Atlanta, Georgia, May 1999.


Private and Threshold Set-Intersection - Kissner, Song (2004)   (1 citation)  (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proc. ACM Symposium on Theory of Computing, pages 245--54, 1999.


Cryptanalysis of the Repaired Public-key Encryption Scheme Based.. - Coron (2003)   (1 citation)  (Correct)

No context found.

M. Naor and B. Pinkas, Oblivious transfer and polynomial evaluation. In ACM, editor, STOC 99, pp 245-254, 1999.


Privacy Preserving k means clustering over Vertically Partitioned .. - Vaidya (2003)   (2 citations)  (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proceedings of the Thirty-first annual ACM symposium on Theory of computing, pages 245--254, Atlanta, GA, 1999. ACM Press.


An Oblivious Transfer Protocol with Log-Squared Communication - Lipmaa (2005)   (7 citations)  (Correct)

No context found.

Moni Naor and Benny Pinkas. Oblivious Transfer and Polynomial Evaluation. In Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing, pages 245--254, Atlanta, Georgia, USA, 1--4 May 1999. ACM Press.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC