Yan-Cheng Chang, Chi-Jen Lu  Home/Search
Context Related
Links: ACM DBLP | sinica.edu.tw/~cjlu/pub/ope.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sinica.edu.tw/~cjlu/paper (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the problem of Oblivious Polynomial Evaluation (OPE). There are two parties, Alice who has a polynomial P , and Bob who has an input x. The goal is for Bob to compute P (x) in such way that Alice learns nothing about x and Bob learns only what can be inferred from P (x). Previously existing protocols are based on some intractability assumptions that have not been well studied, and these protocols are only applicable for polynomials over finite fields. In this paper, we propose... (Update)
Cited by: More
Cryptographically Private Support Vector Machines - Laur, Lipmaa, Mielikäinen (2006) (Correct)
Blind Vision - Avidan, Butman (2006) (Correct)
Privacy Preserving k means clustering over Vertically Partitioned .. - Vaidya (2003) (Correct)
Similar documents (at the sentence level):
43.0%: Oblivious Polynomial Evaluation and Oblivious Neural Learning - Chang (2001) (Correct)
Active bibliography (related documents): More All
0.1: Efficient Multi-Party Computation over Rings - Cramer, Fehr, Ishai, Kushilevitz (2002) (Correct)
0.1: On 2-Round Secure Multiparty Computation - Gennaro, Ishai, Kushilevitz, Rabin (2002) (Correct)
0.1: Perfect Constant-Round Secure Computation via Perfect.. - Ishai, Kushilevitz (2002) (Correct)
Similar documents based on text: More All
0.5: On the Impossibilities of Basing One-Way Permutations on.. - Chang, Hsiao (Correct)
0.4: Computationally Secure Oblivious Transfer - Naor, Pinkas (1999) (Correct)
0.3: An Exact Characterization of Symmetric Functions in qAC°[2] - Lu (Correct)
Related documents from co-citation: More All
4: Privacy preserving data mining - Lindell, Pinkas - 2000
3: How to exchange secrets by oblivious transfer (context) - Rabin - 1981
2: Principles of Data Mining (context) - Hand, Mannila et al.
BibTeX entry: (Update)
Y.-C. Chang and C.-J. Lu. Oblivious Polynomial Evaluation and Oblivious Neural Learning. Advances in Cryptology, Asiacrypt '01, Lecture Notes in Computer Science Vol. 2248, pages 369 - 384, 2001. http://citeseer.ist.psu.edu/article/chang01oblivious.html More
@article{ chang01oblivious,
author = "Yan-Cheng Chang and Chi-Jen Lu",
title = "Oblivious Polynomial Evaluation and Oblivious Neural Learning",
journal = "Lecture Notes in Computer Science",
volume = "2248",
pages = "369+",
year = "2001",
url = "citeseer.ist.psu.edu/article/chang01oblivious.html" }
Citations (may not include all citations):287 Multiparty unconditionally secure protocols (context) - Chaum, Crepeau et al. - 1988 ACM
196 Minimum disclosure proofs of knowledge (context) - Brassard, Chaum et al. - 1988 ACM DBLP
185 How to generate and exchange secrets (context) - Yao - 1986
140 How to play any mental game or a completeness theorem for pr.. (context) - Goldreich, Micali et al. - 1987 DBLP
122 How to recycle random bits - Impagliazzo, Zuckerman - 1989 DBLP
102 Oblivious transfer and polynomial evaluation (context) - Naor, Pinkas - 1999 ACM DBLP
100 Founding cryptography on oblivious transfer (context) - Kilian - 1988 DBLP
87 Decision Die-Hellman problem (context) - Boneh
86 Privacy preserving data mining - Lindell, Pinkas ACM DBLP
85 Construction of a pseudo-random generator from any one-way f.. - astad, Impagliazzo et al. - 1999
59 Non-interactive oblivious transfer and applications (context) - Bellare, Micali - 1990
53 A minimal model for secure computation - Feige, Kilian et al. - 1994
35 Non-interactive cryptocomputing for NC - Sander, Young et al. - 1999
21 Randomizing polynomials: a new representation with applicati.. - Ishai, Kushilevitz - 2000
20 Two party RSA key generation - Gilboa - 1999 ACM DBLP
17 Noisy polynomial interpolation and noisy chinese remainderin.. - Bleichenbacher, Nguyen DBLP
1 Information theoretical reductions among disclosure problems (context) - Brassard, Crepeau et al. - 1986
1 A Proof of Lemma 2 Let ` = jH jjS 2 j (context) - Zurada, Arti et al. - 1994
Documents on the same site (http://www.iis.sinica.edu.tw/~cjlu/paper.html): More
A Deterministic Approximation Algorithm for a Minmax Integer.. - Lu (1999) (Correct)
Deterministic Hypergraph Coloring and Its Applications - Lu (1998) (Correct)
Derandomizing Arthur-Merlin Games under Uniform Assumptions - Lu (2000) (Correct)
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