{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:26:16Z","timestamp":1726413976469},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T00:00:00Z","timestamp":1308268800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s11432-011-4272-1","type":"journal-article","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T02:08:53Z","timestamp":1308362933000},"page":"1654-1662","source":"Crossref","is-referenced-by-count":5,"title":["Secure multi-party computation protocol for sequencing problem"],"prefix":"10.1007","volume":"54","author":[{"given":"ChunMing","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GuiHua","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZhengAn","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,17]]},"reference":[{"key":"4272_CR1","doi-asserted-by":"crossref","unstructured":"Yao A C. Protocols for secure computations. In: Proceedings of the 23 rd Annual IEEE Symposium on Foundations of Computer Science, Chicago, 1982. 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"key":"4272_CR2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R. Fagin","year":"1996","unstructured":"Fagin R, Naor M, Winkler P. Comparing information without leaking it. Commun ACM, 1996, 39: 77\u201385","journal-title":"Commun ACM"},{"key":"4272_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013145","DOI":"10.1007\/978-3-540-30539-2_10"},{"key":"4272_CR4","first-page":"421","volume":"15","author":"J. Qin","year":"2004","unstructured":"Qin J, Zhang Z F, Feng D G. A protocol of comparing information without leaking. J Software, 2004, 15: 421\u2013427","journal-title":"J Software"},{"key":"4272_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013135","DOI":"10.1007\/978-3-540-30539-2_36"},{"key":"4272_CR6","doi-asserted-by":"crossref","unstructured":"Ioannidis I, Grama A. An efficient protocol for Yao\u2019s Millionaires\u2019 problem. In: Proceedings of the 36 th Hawaii International Conference on System Sciences, Hawaii, 2003. Track 7","DOI":"10.1109\/HICSS.2003.1174464"},{"key":"4272_CR7","doi-asserted-by":"crossref","unstructured":"Fischlin M. A cost-effective pay-per-multiplication comparison method for Millionaires. In: Topics in Cryptology\u2014CT-RSA 2001: The Cryptographers\u2019 Track at RSA Conference 2001, San Francisco, 2001. 457\u2013471","DOI":"10.1007\/3-540-45353-9_33"},{"key":"4272_CR8","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/11496137_31"},{"key":"4272_CR9","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/319709.319726","volume-title":"Proceedings of the 6 th ACM Conference on Computer and Communications Security","author":"C. Cachin","year":"1999","unstructured":"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\u2013127"},{"key":"4272_CR10","unstructured":"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"},{"key":"4272_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y. Lindell","year":"2009","unstructured":"Lindell Y, Pinkas B. A proof of Yao\u2019s protocol for secure two-party computation. J Cryptology, 2009, 22: 161\u2013188","journal-title":"J Cryptology"},{"key":"4272_CR12","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/28395.28420","volume-title":"Proceedings of the nineteenth annual ACM symposium on Theory of computing STOC\u2019 87","author":"O. Goldreich","year":"1987","unstructured":"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\u2019 87, New York: ACM, 1987. 218\u2013229"},{"key":"4272_CR13","doi-asserted-by":"crossref","unstructured":"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\u201310","DOI":"10.1145\/62212.62213"},{"key":"4272_CR14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/62212.62214","volume-title":"Proceedings of the twentieth annual ACM symposium on Theory of computing STOC 88","author":"D. Chaum","year":"1988","unstructured":"Chaum D, Cr\u00e9peau 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\u201319"},{"key":"4272_CR15","doi-asserted-by":"crossref","unstructured":"Cramer R, Damgard I, Maurer U. General secure multi-party computation from linear secret sharing scheme. In: Advances in Cryptology\u2014EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques, Bruges, 2000. 316\u2013334","DOI":"10.1007\/3-540-45539-6_22"},{"key":"4272_CR16","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir A. How to share a secret. Commun ACM, 1979, 22: 612\u2013613","journal-title":"Commun ACM"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4272-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-011-4272-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4272-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T23:48:02Z","timestamp":1560296882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-011-4272-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,17]]},"references-count":16,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["4272"],"URL":"https:\/\/doi.org\/10.1007\/s11432-011-4272-1","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"type":"print","value":"1674-733X"},{"type":"electronic","value":"1869-1919"}],"subject":[],"published":{"date-parts":[[2011,6,17]]}}}