{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:57:00Z","timestamp":1648702620592},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2008,7,3]],"date-time":"2008-07-03T00:00:00Z","timestamp":1215043200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Ser. F-Inf. Sci."],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s11432-008-0112-3","type":"journal-article","created":{"date-parts":[[2008,7,3]],"date-time":"2008-07-03T00:51:57Z","timestamp":1215046317000},"page":"1231-1238","source":"Crossref","is-referenced-by-count":0,"title":["Comparing two sets without disclosing them"],"prefix":"10.1007","volume":"51","author":[{"given":"ShunDong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YiQi","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DaoShun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,3]]},"reference":[{"key":"112_CR1","first-page":"160","volume-title":"Proceeding of the 23th IEEE Annual Symposium on Foundations of Computer Science","author":"A. Yao","year":"1982","unstructured":"Yao A. Protocols for secure computations. In: Proceeding of the 23th IEEE Annual Symposium on Foundations of Computer Science. Los Alamitos: IEEE Computer Society Press, 1982. 160\u2013164"},{"key":"112_CR2","first-page":"218","volume-title":"Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing","author":"O. Goldreich","year":"1987","unstructured":"Goldreich O, Micali S, Wigderson A. How to play ANY mental game. In: Alfred V A, ed. Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing. New York: ACM Press, 1987. 218\u2013229"},{"key":"112_CR3","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1017\/CBO9780511721656.004","volume-title":"Foundations of Cryptography: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich O. Foundations of Cryptography: Basic Applications. London: Cambridge University Press, 2004. 599\u2013729"},{"key":"112_CR4","first-page":"21","volume-title":"Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing","author":"S. Goldwasser","year":"1997","unstructured":"Goldwasser S. Multi-party computations: past and present. In: James E B, Hagit A, eds. Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing. New York: ACM Press, 1997. 21\u201324"},{"key":"112_CR5","first-page":"13","volume-title":"Proceedings of New Security Paradigms Workshop 2001","author":"W. L. Du","year":"2001","unstructured":"Du W L, Atallah M J. Secure multiparty computation problems and their applications: A review and open problems. In: Raskin V, Greenwald S J, Timmerman B, et al. eds. Proceedings of New Security Paradigms Workshop 2001. New York: ACM Press, 2001. 13\u201322"},{"key":"112_CR6","first-page":"1","volume-title":"Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques","author":"C. Cachin","year":"2004","unstructured":"Cachin C, ed. Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques. New York: Springer-Verlag (LNCS3027), 2004. 1\u201355, 419\u2013473"},{"key":"112_CR7","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-48969-X_2","volume-title":"Lectures on Data Security-Modern Cryptology in Theory and Practice","author":"R. Cramer","year":"1999","unstructured":"Cramer R. Introduction to secure computation. In: Damgaard I, ed. Lectures on Data Security-Modern Cryptology in Theory and Practice. London: Springer-Verlag, 1999. 16\u201362"},{"issue":"3","key":"112_CR8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s11432-007-0037-2","volume":"50","author":"C. X. Shen","year":"2007","unstructured":"Shen C X, Zhang H G, Feng D G, et al. Survey of information security. Sci China Ser F-Inf Sci, 2007, 50(3): 273\u2013298","journal-title":"Sci China Ser F-Inf Sci"},{"issue":"12","key":"112_CR9","first-page":"1254","volume":"35","author":"Z. F. Cao","year":"2005","unstructured":"Cao Z F, Zhu H J, Lu R X. Robust threshold partial signature with provable security. Sci China Ser E-Inf Sci (in Chinese), 2005, 35(12): 1254\u20131265","journal-title":"Sci China Ser E-Inf Sci"},{"issue":"8","key":"112_CR10","first-page":"25","volume":"40","author":"S. D. Li","year":"2006","unstructured":"Li S D, Jia X L, Dou J W. Secure multi-party computation of set-intersection problem. J Xi\u2019an Jiaotong Univ, 2006, 40 (8): 25\u201328","journal-title":"J Xi\u2019an Jiaotong Univ"},{"issue":"4","key":"112_CR11","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/0405044","volume":"5","author":"B. Kalyanasundaram","year":"1992","unstructured":"Kalyanasundaram B, Schnitger G. The probabilistic communication complexity of set intersection. SIAM J Discrete Math, 1992, 5(4): 545\u2013557","journal-title":"SIAM J Discrete Math"},{"key":"112_CR12","first-page":"1","volume-title":"Proceedings of Intal Conference on the Theory and Applications of Cryptographic Techniques","author":"M. J. Freedman","year":"2004","unstructured":"Freedman M J, Nissim K, Pinkas B. Efficient private matching and set intersection. In: Cachin C, ed. Proceedings of Intal Conference on the Theory and Applications of Cryptographic Techniques. New York: Springer-Verlag, 2004. 1\u201319"},{"issue":"5","key":"112_CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R. Fagin","year":"1996","unstructured":"Fagin R, Naor M, Einkler P. Comparing information without leaking it. Commun ACM, 1996, 39(5): 77\u201385","journal-title":"Commun ACM"},{"key":"112_CR14","first-page":"34","volume-title":"Computability, Complexity and Language","author":"M. D. Davis","year":"1983","unstructured":"Davis M D, Weyuker E J. Computability, Complexity and Language. New York: Academic Press Inc. 1983. 34\u201380"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-008-0112-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-008-0112-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-008-0112-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:35:56Z","timestamp":1559388956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-008-0112-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,3]]},"references-count":14,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["112"],"URL":"https:\/\/doi.org\/10.1007\/s11432-008-0112-3","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,3]]}}}