Oblivious polynomial evaluation

Authors:
Hong-Da Li;Dong-Yao Ji;Deng-Guo Feng;Bao Li
Affiliations:
State Key Lab of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100039 P.R. China;State Key Lab of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100039 P.R. China;State Key Lab of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100039 P.R. China;State Key Lab of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100039 P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2004

Citing 8
Cited 0

Adaptively secure multi-party computation

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Oblivious transfer and polynomial evaluation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
General Adversaries in Unconditional Multi-party Computation

ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Efficient 1-Out-n Oblivious Transfer Schemes

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
The relationship between public key encryption and oblivious transfer

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A study of secure database access and general two-party computation

A study of secure database access and general two-party computation
Noisy polynomial interpolation and noisy chinese remaindering

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of two-party oblivious polynomial evaluation (OPE) is studied, where one party (Alice) has a polynomial P(x) and the other party (Bob) with an input x wants to learn P(x) in such an oblivious way that Bob obtains P(x) without learning any additional information about P except what is implied by P(x) and Alice does not know Bob's input x. The former OPE protocols are based on an intractability assumption except for OT protocols. In fact, evaluating P(x) is equivalent to computing the product of the coefficient vectors (a0,..., an) and (1,..., xn). Using this idea, an efficient scale product protocol of two vectors is proposed first and then two OPE protocols are presented which do not need any other cryptographic assumption except for OT protocol. Compared with the existing OPE protocol, another characteristic of the proposed protocols is the degree of the polynomial is private. Another OPE protocol works in case of existence of untrusted third party.