Skip to main content
SpringerLink
Log in

Secure multi-party computation protocol for sequencing problem

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

In the field of multi-party computation, an important problem is how to construct an efficient and secure multi-party computation protocol for certain specific problems. In the present study, we make use of a secret sharing scheme to construct an efficient and secure multi-party computation protocol for sequencing problems. Our protocols are perfectly secure against both a passive adversary that can corrupt at most t ⩽ (n − 1)/2 participants, and an active adversary that can corrupt at most t < n/3 participants. The simplest sequencing problem is the Millionaires’ problem.

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

Access this article

Log in via an institution

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

References

  1. Yao A C. Protocols for secure computations. In: Proceedings of the 23 rd Annual IEEE Symposium on Foundations of Computer Science, Chicago, 1982. 160–164

  2. Fagin R, Naor M, Winkler P. Comparing information without leaking it. Commun ACM, 1996, 39: 77–85

    Article  Google Scholar 

  3. Schoenmakers B, Tuyls P. Practical two-party computation based on the conditional gate. In: Advances in Cryptology-ASIACRYPT 2004: 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, 2004. 129–145

  4. Qin J, Zhang Z F, Feng D G. A protocol of comparing information without leaking. J Software, 2004, 15: 421–427

    MATH  Google Scholar 

  5. Blake I F, Kolesnikov V. Strong conditional oblivious transfer and computing on intervals. In: Advances in Cryptology-ASIACRYPT 2004: 10th International Conference on the Theory and Application of Cryptology and Information Security, Jeju Island, 2004. 122–135

  6. Ioannidis I, Grama A. An efficient protocol for Yao’s Millionaires’ problem. In: Proceedings of the 36 th Hawaii International Conference on System Sciences, Hawaii, 2003. Track 7

  7. Fischlin M. A cost-effective pay-per-multiplication comparison method for Millionaires. In: Topics in Cryptology—CT-RSA 2001: The Cryptographers’ Track at RSA Conference 2001, San Francisco, 2001. 457–471

  8. Lin H Y, Tzeng W G. An efficient solution to the millionaires problem based on homomorphic encryption. ASIACRYPT 2005, http://eprint.iacr.org/2005/043

  9. Cachin C. Efficient private bidding and auctions with an oblivious third party. In: Proceedings of the 6 th ACM Conference on Computer and Communications Security, New York: ACM, 1999. 120–127

    Chapter  Google Scholar 

  10. Luo Y L. Some key issues in secure multi-party computation and their applied research (Chinese). Dissertation of Doctoral Degree. University of Science and Technology of China, 2005

  11. Lindell Y, Pinkas B. A proof of Yao’s protocol for secure two-party computation. J Cryptology, 2009, 22: 161–188

    Article  MathSciNet  MATH  Google Scholar 

  12. Goldreich O, S. Micali S, Wigderson A. How to Play any Mental Game. In: Proceedings of the nineteenth annual ACM symposium on Theory of computing STOC’ 87, New York: ACM, 1987. 218–229

    Chapter  Google Scholar 

  13. Ben-Or M, Goldwasser S, Wigderson A. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the twentieth annual ACM symposium on Theory of computing STOC88, 1988. 1–10

  14. Chaum D, Crépeau C, Damgard I. Multiparty unconditionally secure protocols. In: Proceedings of the twentieth annual ACM symposium on Theory of computing STOC 88, New York: ACM, 1988. 11–19

    Chapter  Google Scholar 

  15. Cramer R, Damgard I, Maurer U. General secure multi-party computation from linear secret sharing scheme. In: Advances in Cryptology—EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques, Bruges, 2000. 316–334

  16. Shamir A. How to share a secret. Commun ACM, 1979, 22: 612–613

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Information Science, Guangzhou University, Guangzhou, 510006, China

    ChunMing Tang & GuiHua Shi

  2. State Key Laboratory of Information Security, Institute of Software Science, Chinese Academy of Sciences, Beijing, 100080, China

    ChunMing Tang

  3. School of Mathematics and Computational Science, Sun Yat-Sen University, Guangzhou, 510275, China

    ZhengAn Yao

Authors
  1. ChunMing Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. GuiHua Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. ZhengAn Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to ChunMing Tang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tang, C., Shi, G. & Yao, Z. Secure multi-party computation protocol for sequencing problem. Sci. China Inf. Sci. 54, 1654–1662 (2011). https://doi.org/10.1007/s11432-011-4272-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-011-4272-1

Keywords

Search

Navigation