{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:49:20Z","timestamp":1772808560855,"version":"3.50.1"},"reference-count":38,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2018]]},"DOI":"10.3934\/amc.2018002","type":"journal-article","created":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T23:52:21Z","timestamp":1523490741000},"page":"17-47","source":"Crossref","is-referenced-by-count":1,"title":["Private set-intersection with common set-up"],"prefix":"10.3934","volume":"12","author":[{"given":"Sanjit","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chethan","family":"Kamath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vikas","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2018002-1","doi-asserted-by":"crossref","unstructured":"<p>M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev and M. Ohkubo, Structure-preserving signatures and commitments to group elements, in <i>Advances in Cryptology -CRYPTO 2010<\/i>, Springer, 2010,209-236.<\/p>","DOI":"10.1007\/978-3-642-14623-7_12"},{"key":"key-10.3934\/amc.2018002-2","doi-asserted-by":"crossref","unstructured":"<p>G. Ateniese, E. De Cristofaro and G. Tsudik, (If) Size matters: Size-hiding private set intersection, in <i>Public Key Cryptography -PKC 2011<\/i>, Springer, 2011,156-173.<\/p>","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"key-10.3934\/amc.2018002-3","doi-asserted-by":"crossref","unstructured":"<p>P. Baldi, R. Baronio, E. De Cristofaro, P. Gasti and G. Tsudik, Countering gattaca: Efficient and secure testing of fully-sequenced human genomes, in <i>Proc. 18th ACM Conf. Comp. Commun. Secur. -CCS'11<\/i>, ACM, New York, 2011,691-702.<\/p>","DOI":"10.1145\/2046707.2046785"},{"key":"key-10.3934\/amc.2018002-4","doi-asserted-by":"crossref","unstructured":"<p>M. Bellare, R. Canetti and H. Krawczyk, A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract), in <i>Proc. 30th Ann. ACM Symp. Theory Comp. -STOC'98<\/i>, ACM, New York, 1998,419-428.<\/p>","DOI":"10.1145\/276698.276854"},{"key":"key-10.3934\/amc.2018002-5"},{"key":"key-10.3934\/amc.2018002-6","doi-asserted-by":"crossref","unstructured":"<p>M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, in <i>Proc. 1st ACM Conf. Comp. Commun. Secur. -CCS '93<\/i>, ACM, New York, 1993, 62-73.<\/p>","DOI":"10.1145\/168588.168596"},{"key":"key-10.3934\/amc.2018002-7","doi-asserted-by":"crossref","unstructured":"<p>M. Bellare and P. Rogaway, The exact security of digital signatures -how to sign with RSA and Rabin, in <i>Advances in Cryptology -EUROCRYPT 1996<\/i>, Springer, 1996,399-416.<\/p>","DOI":"10.1007\/3-540-68339-9_34"},{"key":"key-10.3934\/amc.2018002-8","doi-asserted-by":"crossref","unstructured":"<p>A. Boldyreva, Threshold signatures, multisignatures and blind signatures based on the gapDiffie-Hellman group signature scheme, in <i>Public Key Cryptography -PKC 2003<\/i>, Springer, 2002, 31-46.<\/p>","DOI":"10.1007\/3-540-36288-6_3"},{"key":"key-10.3934\/amc.2018002-9","doi-asserted-by":"crossref","unstructured":"<p>E. Bursztein, M. Hamburg, J. Lagarenne and D. Boneh, Openconflict: Preventing real time map hacks in online games, in <i>Proc. 32nd IEEE Symp. Secur. Privacy<\/i>, IEEE Comp. Soc., Berkeley, 2011,506-520.<\/p>","DOI":"10.1109\/SP.2011.28"},{"key":"key-10.3934\/amc.2018002-10","doi-asserted-by":"crossref","unstructured":"<p>J. Camenisch and G. M. Zaverucha, Private intersection of certified sets, in <i>Financial Cryptography and Data Security<\/i>, Springer, 2009,108-127.<\/p>","DOI":"10.1007\/978-3-642-03549-4_7"},{"key":"key-10.3934\/amc.2018002-11"},{"key":"key-10.3934\/amc.2018002-12","doi-asserted-by":"crossref","unstructured":"<p>R. Canetti and H. Krawczyk, Analysis of key-exchange protocols and their use for building secure channels, in <i>Advances in Cryptology -EUROCRYPT 2001<\/i>, Springer, 2001,453-474.<\/p>","DOI":"10.1007\/3-540-44987-6_28"},{"key":"key-10.3934\/amc.2018002-13","doi-asserted-by":"crossref","unstructured":"<p>R. Canetti and H. Krawczyk, Universally composable notions of key exchange and secure channels, in <i>Advances in Cryptology -EUROCRYPT 2002, Springer, 2002<\/i>, 337-351.<\/p>","DOI":"10.1007\/3-540-46035-7_22"},{"key":"key-10.3934\/amc.2018002-14","doi-asserted-by":"crossref","unstructured":"<p>R. Canetti and T. Rabin, Universal composition with joint state, in <i>Advances in Cryptology -CRYPTO 2003<\/i>, Springer, 2003,265-281.<\/p>","DOI":"10.1007\/978-3-540-45146-4_16"},{"key":"key-10.3934\/amc.2018002-15","doi-asserted-by":"crossref","unstructured":"<p>D. Chaum, Blind signatures for untraceable payments, in <i>Advances in Cryptology -Proc. CRYPTO '82<\/i>, Plenum Press, New York, 1982,199-203.<\/p>","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"key-10.3934\/amc.2018002-16"},{"key":"key-10.3934\/amc.2018002-17","doi-asserted-by":"crossref","unstructured":"<p>J. -S. Coron, On the exact security of full domain hash, in <i>Advances in Cryptology -CRYPTO 2000<\/i>, Springer, 2000,229-235.<\/p>","DOI":"10.1007\/3-540-44598-6_14"},{"key":"key-10.3934\/amc.2018002-18"},{"key":"key-10.3934\/amc.2018002-19","doi-asserted-by":"crossref","unstructured":"<p>E. De Cristofaro, J. Kim and G. Tsudik, Linear-complexity private set intersection protocols secure in malicious model, in <i>Advances in Cryptology -ASIACRYPT 2010<\/i>, Springer, 2010,213-231.<\/p>","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"key-10.3934\/amc.2018002-20","doi-asserted-by":"crossref","unstructured":"<p>E. De Cristofaro and G. Tsudik, Practical private set intersection protocols with linear complexity, in <i>Financial Cryptography and Data Security<\/i>, Springer, 2010,143-159.<\/p>","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"key-10.3934\/amc.2018002-21","doi-asserted-by":"crossref","unstructured":"<p>E. De Cristofaro and G. Tsudik, Experimenting with fast private set intersection, in <i>Trust and Trustworthy Computing<\/i>, Springer, 2012, 55-73.<\/p>","DOI":"10.1007\/978-3-642-30921-2_4"},{"key":"key-10.3934\/amc.2018002-22","doi-asserted-by":"crossref","unstructured":"<p>C. Dong, L. Chen and Z. Wen, When private set intersection meets big data: an efficient and scalable protocol, in <i>Proc. 2013 ACM SIGSAC Conf. Comp. Commun. Secur. -CCS '13<\/i>, ACM, New York, 2013,789-800.<\/p>","DOI":"10.1145\/2508859.2516701"},{"key":"key-10.3934\/amc.2018002-23","doi-asserted-by":"crossref","unstructured":"<p>M. Freedman, K. Nissim and B. Pinkas, Efficient private matching and set intersection, in <i>Advances in Cryptology -EUROCRYPT 2004<\/i>, Springer, 2004, 1-19.<\/p>","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"key-10.3934\/amc.2018002-24","unstructured":"<p>O. Goldreich, <i>The Foundations of Cryptography -Volume 2, Basic Applications<\/i>, Cambridge Univ. Press, 2004.<\/p>"},{"key":"key-10.3934\/amc.2018002-25","doi-asserted-by":"crossref","unstructured":"<p>S. Goldwasser and S. Micali, Probabilistic encryption &amp; how to play mental poker keeping secret all partial information, in <i>Proc. 14th Ann. ACM Symp. Theory Comp. STOC '82<\/i>, ACM, New York, 1982,365-377.<\/p>","DOI":"10.1145\/800070.802212"},{"key":"key-10.3934\/amc.2018002-26","doi-asserted-by":"crossref","unstructured":"<p>C. Hazey, Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs, In <i>Proc. 12th Theory Crypt. Conf. -TCC 2015<\/i>, Springer, 90-120.<\/p>","DOI":"10.1007\/978-3-662-46497-7_4"},{"key":"key-10.3934\/amc.2018002-27","doi-asserted-by":"crossref","unstructured":"<p>C. Hazay and Y. Lindell, Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries, in <i>Theory of Cryptography<\/i>, Springer, 2008,155-175.<\/p>","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"key-10.3934\/amc.2018002-28"},{"key":"key-10.3934\/amc.2018002-29","doi-asserted-by":"crossref","unstructured":"<p>C. Hazay and K. Nissim, Efficient set operations in the presence of malicious adversaries, in <i>Public Key Cryptography -PKC 2010, Springer, 2010<\/i>, 312-331.<\/p>","DOI":"10.1007\/978-3-642-13013-7_19"},{"key":"key-10.3934\/amc.2018002-30","unstructured":"<p>Y. Huang, D. Evans and J. Katz, Private set intersection: Are garbled circuits better than custom protocols?, in <i>19th Ann. Network Distrib. System Secur. Symp. 2012<\/i>, San Diego, California, 2012.<\/p>"},{"key":"key-10.3934\/amc.2018002-31","doi-asserted-by":"crossref","unstructured":"<p>S. Jarecki and X. Liu, Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection, in <i>Theory of Cryptography<\/i>, Springer, 2009,577-594.<\/p>","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"key-10.3934\/amc.2018002-32","doi-asserted-by":"crossref","unstructured":"<p>S. Jarecki and X. Liu, Fast secure computation of set intersection, in <i>Security and Cryptography for Networks<\/i>, Springer, 2010,418-435.<\/p>","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"key-10.3934\/amc.2018002-33","doi-asserted-by":"crossref","unstructured":"<p>A. Juels, M. Luby and R. Ostrovsky, Security of blind digital signatures, in <i>Advances in Cryptology -CRYPTO '97<\/i>, Springer, 1997,150-164.<\/p>","DOI":"10.1007\/BFb0052233"},{"key":"key-10.3934\/amc.2018002-34","doi-asserted-by":"crossref","unstructured":"<p>L. Kissner and D. Song, Privacy-preserving set operations, in <i>Advances in Cryptology -CRYPTO 2005<\/i> (ed. V. Shoup), Springer, 2005,241-257.<\/p>","DOI":"10.1007\/11535218_15"},{"key":"key-10.3934\/amc.2018002-35"},{"key":"key-10.3934\/amc.2018002-36","unstructured":"<p>A. Menezes, P. van Oorschot and S. Vanstone, <i>Handbook of Applied Cryptography<\/i>, CRC, 1996.<\/p>"},{"key":"key-10.3934\/amc.2018002-37","unstructured":"<p>B. Pinkas, T. Schneider and M. Zohner, Faster private set intersection based on ot extension, in <i>Proc. 23rd USENIX Secur. Symp<\/i>., 797-812, 2014.<\/p>"},{"key":"key-10.3934\/amc.2018002-38","doi-asserted-by":"crossref","unstructured":"<p>E. Stefanov, E. Shi and D. Song, Policy-enhanced private set intersection: Sharing information while enforcing privacy policies, in <i>Public Key Cryptography -PKC 2012<\/i> (M. Fischlin, J. Buchmann and M. Manulis), Springer, 2012,413-430.<\/p>","DOI":"10.1007\/978-3-642-30057-8_25"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2018_1_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:05:56Z","timestamp":1772791556000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2018002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2018002","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}