{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:47:33Z","timestamp":1772808453029,"version":"3.50.1"},"reference-count":53,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2021]]},"DOI":"10.3934\/amc.2020071","type":"journal-article","created":{"date-parts":[[2020,4,13]],"date-time":"2020-04-13T04:41:41Z","timestamp":1586752901000},"page":"365-386","source":"Crossref","is-referenced-by-count":22,"title":["Secure and efficient multiparty private set intersection cardinality"],"prefix":"10.3934","volume":"15","author":[{"given":"Sumit Kumar","family":"Debnath","sequence":"first","affiliation":[]},{"given":"Pantelimon","family":"St\u01cenic\u01ce","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Naval Postgraduate School, Monterey, CA 93943, USA"}]},{"given":"Nibedita","family":"Kundu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, The LNM Institute of Information Technology, Jaipur-302031, India"}]},{"given":"Tanmay","family":"Choudhury","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National Institute of Technology Jamshedpur, Jamshedpur-831014, India"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020071-1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872771"},{"key":"key-10.3934\/amc.2020071-2","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"key-10.3934\/amc.2020071-3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054851"},{"key":"key-10.3934\/amc.2020071-4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.05.018"},{"key":"key-10.3934\/amc.2020071-5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"key-10.3934\/amc.2020071-6","unstructured":"<p>J. Camenisch and M. Stadler, <i>Proof Systems for General Statements about Discrete Logarithms<\/i>, 1997. <a href=\"http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.56.1208\" target=\"_blank\">http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.56.1208<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2020071-7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_7"},{"key":"key-10.3934\/amc.2020071-8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93387-0_15"},{"key":"key-10.3934\/amc.2020071-9","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"key-10.3934\/amc.2020071-10","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E95.A.1366"},{"key":"key-10.3934\/amc.2020071-11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0"},{"key":"key-10.3934\/amc.2020071-12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21554-4_8"},{"key":"key-10.3934\/amc.2020071-13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59870-3_15"},{"key":"key-10.3934\/amc.2020071-14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"key-10.3934\/amc.2020071-15"},{"key":"key-10.3934\/amc.2020071-16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"key-10.3934\/amc.2020071-17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30921-2_4"},{"key":"key-10.3934\/amc.2020071-18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26059-4_18"},{"key":"key-10.3934\/amc.2020071-19"},{"key":"key-10.3934\/amc.2020071-20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50011-9_34"},{"key":"key-10.3934\/amc.2020071-21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-53177-9_14"},{"key":"key-10.3934\/amc.2020071-22"},{"key":"key-10.3934\/amc.2020071-23","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1450"},{"key":"key-10.3934\/amc.2020071-24"},{"key":"key-10.3934\/amc.2020071-25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39256-6_9"},{"key":"key-10.3934\/amc.2020071-26","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"key-10.3934\/amc.2020071-27","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2721360"},{"key":"key-10.3934\/amc.2020071-28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"key-10.3934\/amc.2020071-29","unstructured":"<p>B. H. Falk, D. Noble and R. Ostrovsky, Private set intersection with linear communication from general assumptions, (2018).<\/p>"},{"key":"key-10.3934\/amc.2020071-30","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"key-10.3934\/amc.2020071-31","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9190-0"},{"key":"key-10.3934\/amc.2020071-32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"key-10.3934\/amc.2020071-33"},{"key":"key-10.3934\/amc.2020071-34","unstructured":"<p>O. Goldreich, <i>Foundations of Cryptography: Volume 2, Basic Applications<\/i>, Cambridge University Press, 2009.<\/p>"},{"key":"key-10.3934\/amc.2020071-35","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"key-10.3934\/amc.2020071-36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46497-7_4"},{"key":"key-10.3934\/amc.2020071-37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"key-10.3934\/amc.2020071-38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_19"},{"key":"key-10.3934\/amc.2020071-39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54365-8_8"},{"key":"key-10.3934\/amc.2020071-40","doi-asserted-by":"publisher","DOI":"10.1007\/11957454_16"},{"key":"key-10.3934\/amc.2020071-41","unstructured":"<p>Y. Huang, D. Evans and J. Katz, Private set intersection: Are garbled circuits better than custom protocols, <i>Network and Distributed System Security Symposium (NDSS), The Internet Society<\/i>, (2012).<\/p>"},{"key":"key-10.3934\/amc.2020071-42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"key-10.3934\/amc.2020071-43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"key-10.3934\/amc.2020071-44","doi-asserted-by":"publisher","DOI":"10.1145\/2414456.2414506"},{"key":"key-10.3934\/amc.2020071-45","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0044"},{"key":"key-10.3934\/amc.2020071-46","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_15"},{"key":"key-10.3934\/amc.2020071-47","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134065"},{"key":"key-10.3934\/amc.2020071-48","unstructured":"<p>D. Many, M. Burkhart and X. Dimitropoulos, Fast private set operations with sepia, <i>Technical Report 345, Mar, Tech. Rep.<\/i>, (2012).<\/p>"},{"key":"key-10.3934\/amc.2020071-49"},{"key":"key-10.3934\/amc.2020071-50","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134044"},{"key":"key-10.3934\/amc.2020071-51","doi-asserted-by":"publisher","DOI":"10.1109\/PDCAT.2007.59"},{"key":"key-10.3934\/amc.2020071-52"},{"key":"key-10.3934\/amc.2020071-53","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.07.071"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"http:\/\/aimsciences.org\/\/article\/doi\/10.3934\/amc.2020071?viewType=html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:05:28Z","timestamp":1772791528000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2020071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2020071","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}