{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T22:32:39Z","timestamp":1648593159972},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,11,1]],"date-time":"2007-11-01T00:00:00Z","timestamp":1193875200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2007,11]]},"DOI":"10.1007\/s11390-007-9098-3","type":"journal-article","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T22:02:53Z","timestamp":1195250573000},"page":"822-829","source":"Crossref","is-referenced-by-count":0,"title":["A Protocol for a Private Set-Operation"],"prefix":"10.1007","volume":"22","author":[{"given":"Rong-Hua","family":"Li","sequence":"first","affiliation":[]},{"given":"Chuan-Kun","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,17]]},"reference":[{"key":"9098_CR1","first-page":"245","volume-title":"Proc. 31st Annual ACM Symposium on Theory of Computing","author":"M Naor","year":"1999","unstructured":"Naor M, Pinkas B. Oblivious transfer and polynomial evaluation. In Proc. 31st Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, USA, ACM Press, 1999, pp.245\u2013254."},{"key":"9098_CR2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/336992.337012","volume-title":"Proc. First ACM Conference on Electronic Commerce","author":"B A Huberman","year":"1999","unstructured":"Huberman B A, Franklin M, Hogg T. Enhancing privacy and trust in electronic communities. In Proc. First ACM Conference on Electronic Commerce, Denver, Colorado, USA, ACM Press, 1999, pp.78\u201386."},{"key":"9098_CR3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/872757.872771","volume-title":"Proc. 2003 ACM SIGMOD International Conference on Management of Data","author":"R Agrawal","year":"2003","unstructured":"Agrawal R, Evfimievski A, Srikant R. Information sharing across private databases. In Proc. 2003 ACM SIGMOD International Conference on Management of Data, San Diego, California, USA, ACM Press, 2003, pp.86\u201397."},{"key":"9098_CR4","first-page":"1","volume-title":"Proc. Advances in Cryptology \u2014EUROCRYPT 2004, LNCS 3027","author":"M J Freedman","year":"May 2\u20136, 2004","unstructured":"Freedman M J, Nissim K, Pinkas B. Efficient private matching and set intersection. In Proc. Advances in Cryptology \u2014EUROCRYPT 2004, LNCS 3027, Berlin: Springer, May 2\u20136, 2004, pp.1\u201319."},{"key":"9098_CR5","first-page":"241","volume-title":"Proc. Advances in Cryptology \u2014 CRYPTO 2005, Santa Barbara, California, USA, August 14\u201318, LNCS 3621","author":"L Kissner","year":"2005","unstructured":"Kissner L, Song D. Privacy-preserving set operations. In Proc. Advances in Cryptology \u2014 CRYPTO 2005, Santa Barbara, California, USA, August 14\u201318, LNCS 3621, Berlin: Springer, 2005, pp.241\u2013257."},{"key":"9098_CR6","first-page":"162","volume-title":"Proc. 27th Annual Symposium on Foundations of Computer Science","author":"A C Yao","year":"1986","unstructured":"Yao A C. How to generate and exchange secrets. In Proc. 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, California: IEEE Computer Society Press, 1986, pp.162\u2013167."},{"key":"9098_CR7","first-page":"218","volume-title":"Proc. 19th Annual ACM Symposium on Theory of Computing","author":"O Goldreich","year":"1987","unstructured":"Goldreich O, Micali S, Wigderson A. How to play any mental game or a completeness theorem for protocols with honest majority. In Proc. 19th Annual ACM Symposium on Theory of Computing, New York, USA, ACM Press, 1987, pp.218\u2013229."},{"key":"9098_CR8","doi-asserted-by":"crossref","unstructured":"Kissner L, Song D. Private and threshold set-intersection. Technical Report, CMU\u2013CS\u201305\u2013113, Carnegie Mellon University, 2005.","DOI":"10.21236\/ADA461119"},{"key":"9098_CR9","unstructured":"Goldreich O. Secure multi-party computation. [EB\/OL] 1998, revised 2002. Available at: http:\/\/www.wisdom.weizmann.ac.il\/\u223coded\/pp.html"},{"issue":"11","key":"9098_CR10","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. Communications of the ACM, 1979, 22(11): 612\u2013613.","journal-title":"Communications of the ACM"},{"key":"9098_CR11","first-page":"1","volume-title":"Proc. 20th Annual ACM Symposium on Theory of Computing","author":"M Ben-Or","year":"May 2\u20134 1988","unstructured":"Ben-Or M, Goldwasser S, Wigderson A. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, May 2\u20134, ACM Press, 1988, pp.1\u201310."},{"issue":"2","key":"9098_CR12","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser S, Micali S. Probabilistic encryption. Journal of Computer and System Sciences, 1984, 28(2): 270\u2013299.","journal-title":"Journal of Computer and System Sciences"},{"key":"9098_CR13","unstructured":"Goldwasser S, Bellare M. Lecture notes on cryptography. [EB\/OL] 2001. Available at: http:\/\/www.cs.ucsd.edu\/use-rs\/mihir\/papers\/gb.pdf ."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9098-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9098-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9098-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:32:39Z","timestamp":1559385159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9098-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,11]]}},"alternative-id":["9098"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9098-3","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11]]}}}