{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:37:46Z","timestamp":1763642266804,"version":"3.37.3"},"reference-count":32,"publisher":"Wiley","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61272435","61373020","2016TS061","201706870028","2017MS0602","NJZY17164"],"award-info":[{"award-number":["61272435","61373020","2016TS061","201706870028","2017MS0602","NJZY17164"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61272435","61373020","2016TS061","201706870028","2017MS0602","NJZY17164"],"award-info":[{"award-number":["61272435","61373020","2016TS061","201706870028","2017MS0602","NJZY17164"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["61272435","61373020","2016TS061","201706870028","2017MS0602","NJZY17164"],"award-info":[{"award-number":["61272435","61373020","2016TS061","201706870028","2017MS0602","NJZY17164"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Foundation Fund of China","award":["61272435","61373020","2016TS061","201706870028","2017MS0602","NJZY17164"],"award-info":[{"award-number":["61272435","61373020","2016TS061","201706870028","2017MS0602","NJZY17164"]}]},{"DOI":"10.13039\/501100004763","name":"Natural Science Foundation of Inner Mongolia","doi-asserted-by":"publisher","award":["61272435","61373020","2016TS061","201706870028","2017MS0602","NJZY17164"],"award-info":[{"award-number":["61272435","61373020","2016TS061","201706870028","2017MS0602","NJZY17164"]}],"id":[{"id":"10.13039\/501100004763","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University Scientific Research Project of Inner Mongolia","award":["61272435","61373020","2016TS061","201706870028","2017MS0602","NJZY17164"],"award-info":[{"award-number":["61272435","61373020","2016TS061","201706870028","2017MS0602","NJZY17164"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2017]]},"abstract":"<jats:p>Secure subset problem is important in secure multiparty computation, which is a vital field in cryptography. Most of the existing protocols for this problem can only keep the elements of one set private, while leaking the elements of the other set. In other words, they cannot solve the secure subset problem perfectly. While a few studies have addressed actual secure subsets, these protocols were mainly based on the oblivious polynomial evaluations with inefficient computation. In this study, we first design an efficient secure subset protocol for sets whose elements are drawn from a known set based on a new encoding method and homomorphic encryption scheme. If the elements of the sets are taken from a large domain, the existing protocol is inefficient. Using the Bloom filter and homomorphic encryption scheme, we further present an efficient protocol with linear computational complexity in the cardinality of the large set, and this is considered to be practical for inputs consisting of a large number of data. However, the second protocol that we design may yield a false positive. This probability can be rapidly decreased by reexecuting the protocol with different hash functions. Furthermore, we present the experimental performance analyses of these protocols.<\/jats:p>","DOI":"10.1155\/2017\/9717580","type":"journal-article","created":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T21:01:44Z","timestamp":1503954104000},"page":"1-11","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Secure Multiparty Subset Computation"],"prefix":"10.1155","volume":"2017","author":[{"given":"Sufang","family":"Zhou","sequence":"first","affiliation":[{"name":"School of Computer Science, Shaanxi Normal University, Xi\u2019an 710062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8345-2955","authenticated-orcid":true,"given":"Shundong","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science, Shaanxi Normal University, Xi\u2019an 710062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Dou","sequence":"additional","affiliation":[{"name":"School of Mathematic and Information Science, Shaanxi Normal University, Xi\u2019an 710062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaling","family":"Geng","sequence":"additional","affiliation":[{"name":"School of Computer Science, Shaanxi Normal University, Xi\u2019an 710062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3450-3808","authenticated-orcid":true,"given":"Xin","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Shaanxi Normal University, Xi\u2019an 710062, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"first-page":"629","volume-title":"Tightly-secure authenticated key exchange","year":"2015","key":"3"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010-9082-x"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/sec.823"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_5"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_29"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511546891"},{"issue":"3","key":"11","doi-asserted-by":"crossref","first-page":"425","DOI":"10.36045\/bbms\/1378314507","volume":"20","year":"2013","journal-title":"Bulletin of the Belgian Mathematical Society. Simon Stevin"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.07.015"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.04.004"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/229459.229469"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E96.A.68"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0177-2"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_15"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9190-0"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.4134\/BKMS.2013.50.6.1799"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2562123"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89255-7_15"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_5"},{"first-page":"174","volume-title":"Proofs of partial knowledge and simplified design of witness hiding protocols","year":"1994","key":"23"},{"first-page":"234","volume-title":"Efficient protocols for set membership and range proofs","year":"2008","key":"24"},{"first-page":"295","volume-title":"Dynamic universal accumulators for DDH groups and their application to attribute-based anonymous credential systems","year":"2009","key":"25"},{"first-page":"219","volume-title":"Membership encryption and its applications","year":"2013","key":"26"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2322257"},{"first-page":"223","volume-title":"Public-key cryptosystems based on composite degree residuosity classes","year":"1999","key":"28"},{"first-page":"347","volume-title":"Distributed private matching and set operations","year":"2008","key":"29"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/1609956.1609965"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-015-0301-1"},{"first-page":"10","volume-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","year":"1984","key":"33"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1145\/1159892.1159900"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.07.024"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.05.018"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2017\/9717580.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2017\/9717580.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2017\/9717580.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T12:19:46Z","timestamp":1602850786000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2017\/9717580\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":32,"alternative-id":["9717580","9717580"],"URL":"https:\/\/doi.org\/10.1155\/2017\/9717580","relation":{},"ISSN":["1939-0114","1939-0122"],"issn-type":[{"type":"print","value":"1939-0114"},{"type":"electronic","value":"1939-0122"}],"subject":[],"published":{"date-parts":[[2017]]}}}