[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Oblivious polynomial evaluation

  • Information Security
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The problem of two-party oblivious polynomial evaluation (OPE) is studied, where one party (Alice) has a polynomialP(z) and the other party (Bob) with an inputx wants to learnP(x) in such an oblivious way that Bob obtainsP(x) without learning any additional information aboutP except what is implied byP(x) and Alice does not know Bob's inputx. The former OPE protocols are based on an intractability assumption except for OT protocols. In fact, evaluatingP(x) is equivalent to computing the product of the coefficient vectors (a 0,...,a n ) and (1, …,x n). 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Andrew C Yao. Protocols for secure computations. InProc. 23rd FOCS, New York, 1982, pp.160–164.

  2. Canetti R. Security and composition of multi-party cryptographic protocols.Journal of Cryptology, 2000, 13(1): 143–202.

    Article  MATH  MathSciNet  Google Scholar 

  3. Canetti R. Universally composable security: A new paradigm for cryptographic protocols. http://eprint. iacr. org/2000/067.

  4. Canetti R. Studies on secure multi-party computation and applications [Dissertation]. ftp://theory.lcs. mit.edu/pub/tcryptol/B03/thesis.ps.Z.

  5. Canetti R, Feige U, Goldreich O, Naor M. Adaptively secure multi-party computation. InProc. 28th ACM Symp. Theory of Computing, Pennsylvania, USA, 1996, pp.639–648.

  6. Canetti R. Security and composition of multi-party cryptographic protocols.Journal of Cryptology, 2000, 13(1): 9–30.

    Article  MathSciNet  Google Scholar 

  7. Canetti R, Damgård I, Dziembowski Set al. On adaptive vs. non-adaptive security of multiparty protocols.Advances in Cryptology-EUROCRYPT 2001, Innsbruek, Austria. Springer-Verlag,LNCS 2045, pp. 262–279.

  8. Cramer R, Damgård I. Multiparty computation, an introduction. http://www.daimi.au.dk/~ivan/CPT.html.

  9. Goldreich O. Secure multi-party computation (working draft). http://www.wisdom.weizmann.ac.il.

  10. Hirt M, Maurer U. Player simulation and general adversary structures in perfect multiparty computation.Journal of Cryptology, 2000, 13(1): 31–60.

    Article  MATH  MathSciNet  Google Scholar 

  11. Hirt M, Maurer U. Robustness for free in unconditional multi-party computation.Advances in Cryptology — CRYPTO'01, 2001, California, USA. Springer-Verlag,LNCS 2139, 2001, pp. 101–118.

  12. Fitzi M, Gisin N, Maure Uet al. Unconditional Byzantine agreement and multi-party computation secure against dishonest minorities from scratch. InProc. Eurocrypt'02, Amsterdam, Holland, Springer-Verlag,LNCS 2332, 2002, pp.482–501.

  13. Fitzi M, Hirt M, Maurer U. General adversaries in unconditional multi-party computation.Advances in Cryptology — ASIACRYPT'99, Singapore, Springer-Verlag,LNCS 1716, 1999, pp.232–246.

  14. M. Fitzi, Juan A Garay, U Maurer, R Ostrovsky. Minimal complete primitives for secure multi-party computation. http://citeseer.nj.nec.com/447998.html.

  15. Tal G Malkin. A study of secure database access and general two-party computation [Dissertation]. http://citeseer.nj.nec.com/correct/

  16. Cramer R, Damgård I. Secure distributed linear algebra in a constant number of rounds.Advances in Cryptology — CRYPTO 2001, Santa Barbara, California, USA, Springer-Verlag,LNCS 2139, 2001, pp.119–136.

  17. Atallah M J, Du Wenliang. A Multi-dimensional Yao's millionaire protocol. https://www.cerias.purdue.edu/papers/archive/2001-09.pdf.

  18. Boudot F, Schoenmakers B, Traoré J. A fair and efficient solution to the socialist millionaire's problem.Discrete Applied Mathematics, 111: 23–36.

  19. Naor M, Pinkas B. Oblivious transfer and polynomial evaluation. InProc. 31st STOC, ACM, Atlanta, USA, 1999, pp.245–254.

  20. Daniel Bleichenbaccher, Phong Q Nguyen. Noisy polynomial interpolation and noisy Chinese remaindering. InProc. 19th Eurocrypt'2000, Bruges, Belgium. Springer-Verlag,LNCS 1807, 2000, pp.53–69.

  21. Naor M, Pinkas B. Distributed oblivious transfer.Advance in Cryptology-ASIACRYPT 2000, Kyoto, Japan. Springer-Verlag,LNCS 1976, 2000, pp.205–219.

  22. Naor M, Pinkas B. Efficient oblivious transfer protocols. http://www.wisdom.weizmann.ac.il/mathusers/naor/topic.html.

  23. Wen-Guey Tzeng. Efficient 1-Out-n Oblivious Transfer Schemes. InProc. 2001 International Workshop on Practive and Theory in Public-Key Cryptography (PKC 02), 2002, Paris, France. Springer-Verlag,LNCS 2274, 2002, pp.159–171.

  24. Gertner Y, Kannan S, Malkin T,et al. The relation between public key encryption and oblivious transfer. InProc. IEEE 41st Annual Symposium on Foundations of Computer Science. California, USA, 2000, pp.314–324.

Download references

Author information

Authors and Affiliations

  1. State Key Lab of Information Security, Graduate School of Chinese Academy of Sciences, 100039, Beijing, P.R. China

    Hong-Da Li, Dong-Yao Ji, Deng-Guo Feng & Bao Li

Authors
  1. Hong-Da Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dong-Yao Ji
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Deng-Guo Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hong-Da Li.

Additional information

Supported by the National High Technology Research and Development 863 Program of China (Grant No. 2001AA144040).

Hong-Da Li, male, born in 1960, received the Ph.D. degree from Northwestern Polytechnical University in 2001. His current research interests are cryptology and cryptographic protocol. E-mail: lihongda@is.ac.cn;hdli@gscas.ac.cn

Dong-Yao Ji, male, born in 1962, received the Ph.D. degree from Xidian University in 2001. His current research interests are cryptology and cryptographic protocol.

Deng-Guo Feng, male, born in 1963. He is a professor and Ph.D. supervisor. His research interests focus on information security.

Bao Li, male, born in 1965, received his Ph.D. degree in cryptography in 1995 from Xidian University. His research interests include cryptographic protocols and public key cryptosystems.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, HD., Ji, DY., Feng, DG. et al. Oblivious polynomial evaluation. J. Compt. Sci. & Technol. 19, 550–554 (2004). https://doi.org/10.1007/BF02944757

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02944757

Keywords

Search

Navigation