{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:21:49Z","timestamp":1772806909382,"version":"3.50.1"},"reference-count":41,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2017]]},"DOI":"10.3934\/amc.2017040","type":"journal-article","created":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T10:06:45Z","timestamp":1504087605000},"page":"481-502","source":"Crossref","is-referenced-by-count":2,"title":["Private set intersection: New generic constructions and feasibility results"],"prefix":"10.3934","volume":"11","author":[{"given":"Paolo","family":"D'Arco","sequence":"first","affiliation":[]},{"given":"Mar\u00eda Isabel","family":"Gonz\u00e1lez Vasco","sequence":"additional","affiliation":[{"name":"MACIMTE, Area de Matem\u00e1tica Aplicada, U. Rey Juan Carlos, c\/ Tulip\u00e1n, s\/n, 28933, M\u00f3stoles, Madrid, Spain"}]},{"given":"Angel L.","family":"P\u00e9rez del Pozo","sequence":"additional","affiliation":[{"name":"MACIMTE, Area de Matem\u00e1tica Aplicada, U. Rey Juan Carlos, c\/ Tulip\u00e1n, s\/n, 28933, M\u00f3stoles, Madrid, Spain"}]},{"given":"Claudio","family":"Soriente","sequence":"additional","affiliation":[{"name":"Telef\u00f3nica Research, Barcelona, Spain"}]},{"given":"Rainer","family":"Steinwandt","sequence":"additional","affiliation":[{"name":"Florida Atlantic University (FAU), 777 Glades Rd, Boca Raton, FL 33431, USA"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2017040-1","doi-asserted-by":"publisher","unstructured":"M. Abdalla, F. Benhamouda, O. Blazy, C. Chevalier and D. Pointcheval, SPHF-friendly noninteractive commitments, in <i>Adv. Crypt. \u2013 ASIACRYPT 2013<\/i>, Springer, 2013,214\u2013234.","DOI":"10.1007\/978-3-642-42033-7_12"},{"key":"key-10.3934\/amc.2017040-2","doi-asserted-by":"publisher","unstructured":"F. Armknecht, D. Augot, L. Perret and A. -R. Sadeghi, On constructing homomorphic encryption schemes from coding theory, in <i>Crypt. Coding<\/i> (ed. L. Chen), Springer, 2011, 23\u201340.","DOI":"10.1007\/978-3-642-25516-8_3"},{"key":"key-10.3934\/amc.2017040-3","doi-asserted-by":"publisher","unstructured":"G. Ateniese, E. De Cristofaro and G. Tsudik, (If) size matters: size-hiding private set intersection, in <i>Publ. Key Crypt. \u2013 PKC 2011<\/i> (eds. D. Catalano et al), Springer, 2011,156\u2013173.","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"key-10.3934\/amc.2017040-4","doi-asserted-by":"crossref","unstructured":"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>ACM Conference on Computerand Communications Security \u2013 CCS 2011<\/i> (eds. Y. Chen ea al), ACM, 2011,691\u2013702.","DOI":"10.1145\/2046707.2046785"},{"key":"key-10.3934\/amc.2017040-5","doi-asserted-by":"crossref","unstructured":"J. Camenisch and G. M. Zaverucha, Private intersection of certified sets, in <i>Financial Crypt. Data Sec. \u2013 FC 2009<\/i> (eds. R. Dingledine et al), IFCA, Springer, 2009,108\u2013127.","DOI":"10.1007\/978-3-642-03549-4_7"},{"key":"key-10.3934\/amc.2017040-6","doi-asserted-by":"publisher","unstructured":"M. Chase and I. Visconti, Secure database commitments and universal arguments of quasi knowledge, in <i>Advances in Cryptology \u2013 CRYPTO 2012<\/i>(eds. R. Safavi-Naini et al), Springer, 2012,236\u2013254.","DOI":"10.1007\/978-3-642-32009-5_15"},{"key":"key-10.3934\/amc.2017040-7","doi-asserted-by":"publisher","unstructured":"H. Chen and R. Cramer, Algebraic geometric secret sharing schemes and secure multi-party computations over small fields, in <i>Adv. Crypt. \u2013 CRYPTO 2006<\/i>(ed. C. Dwork), Springer, 2006,521\u2013536.","DOI":"10.1007\/11818175_31"},{"key":"key-10.3934\/amc.2017040-8","doi-asserted-by":"publisher","unstructured":"R. Cramer, Introduction to secure computation, in <i>Lect. Data Sec. <\/i> (ed. \u2160. Damg\u00e5rd), Springer, 1999, 16\u201362.","DOI":"10.1007\/3-540-48969-X"},{"key":"key-10.3934\/amc.2017040-9","doi-asserted-by":"publisher","unstructured":"R. Cramer and V. Shoup, Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption, in <i>Adv. Crypt. \u2013 EUROCRYPT 2002<\/i>(ed. L. R. Knudsen), Springer, 2002, 45\u201364.","DOI":"10.1007\/3-540-46035-7_4"},{"key":"key-10.3934\/amc.2017040-10","doi-asserted-by":"crossref","unstructured":"E. De Cristofaro, S. Faber and G. Tsudik, Secure genomic testing with size-and positionhiding private substring matching, in <i>ACM Workshop Priv. Electr. Soc. \u2013 WPES'13<\/i>(eds. A. -R. Sadeghi et al), ACM, 2013,107\u2013118.","DOI":"10.1145\/2517840.2517849"},{"key":"key-10.3934\/amc.2017040-11","doi-asserted-by":"crossref","unstructured":"E. De Cristofaro, S. Jarecki, J. Kim and G. Tsudik, Privacy-preserving policy-based information transfer, in <i>Priv. Enhanc. Techn. \u2013 PETS 2009<\/i>(eds. \u2160. Goldberg et al), Springer, 2009,164\u2013184.","DOI":"10.1007\/978-3-642-03168-7_10"},{"key":"key-10.3934\/amc.2017040-12","doi-asserted-by":"crossref","unstructured":"E. De Cristofaro, J. Kim and G. Tsudik, Linear-complexity private set intersection protocols secure in malicious model, in <i>Adv. Crypt. \u2013 ASIACRYPT 2010<\/i>(ed. M. Abe), Springer, 2010,213\u2013231.","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"key-10.3934\/amc.2017040-13","doi-asserted-by":"crossref","unstructured":"E. De Cristofaro and G. Tsudik, Practical private set intersection protocols with linear complexity, in <i>Financial Crypt. Data Sec. \u2013 FC 2010<\/i>(ed. R. Sion), IFCA, Springer, 2010,143\u2013 159.","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"key-10.3934\/amc.2017040-14","doi-asserted-by":"publisher","unstructured":"D. Dachman-Soled, T. Malkin, M. Raykova and M. Yung, Efficient robust private set intersection, in <i>Appl. Crypt. Netw. Sec. \u2013 ACNS 2009<\/i>(eds. M. Abdalla et al), Springer, 2009,125\u2013142.","DOI":"10.1504\/IJACT.2012.048080"},{"key":"key-10.3934\/amc.2017040-15","doi-asserted-by":"crossref","unstructured":"D. Dachman-Soled, T. Malkin, M. Raykova and M. Yung, Secure efficient multiparty computing of multivariate polynomials and applications, in <i>Applied Cryptography and Network Security \u2013 ACNS 2011<\/i>(eds. J. Lopez et al), Springer, 2011,130\u2013146.","DOI":"10.1007\/978-3-642-21554-4_8"},{"key":"key-10.3934\/amc.2017040-16","doi-asserted-by":"publisher","unstructured":"P. D'Arco, M. I. Gonz\u00e1lez Vasco, A. L. P\u00e9rez del Pozo and C. Soriente, Size-hiding in private set intersection: existential results and constructions, in <i>Progr. Crypt. \u2013 AFRICACRYPT 2012<\/i>(eds. A. Mitrokotsa et al), Springer, 2012,378\u2013394.","DOI":"10.1007\/978-3-642-31410-0_23"},{"key":"key-10.3934\/amc.2017040-17","doi-asserted-by":"crossref","unstructured":"C. Dong, L. Chen and Z. Wen, When private set intersection meets big data: an efficient and scalable protocol, in <i>ACM SIGSAC Conf. Comp. Commun. Sec. \u2013 CCS 2013<\/i>(eds. A. -R. Sadeghi et al), ACM, 2013,789\u2013800.","DOI":"10.1145\/2508859.2516701"},{"key":"key-10.3934\/amc.2017040-18","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"key-10.3934\/amc.2017040-19","doi-asserted-by":"publisher","unstructured":"M. J. Freedman, Y. Ishai, B. Pinkas and O. Reingold, Keyword search and oblivious pseudorandom functions, in <i>Theory Crypt. \u2013 TCC 2005<\/i>(ed. J. Kilian), Springer, 2005,303\u2013324.","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"key-10.3934\/amc.2017040-20","doi-asserted-by":"publisher","unstructured":"M. J. Freedman, K. Nissim and B. Pinkas, Efficient private matching and set intersection, in <i>Adv. Crypt. \u2013 EUROCRYPT 2004<\/i>(eds. C. Cachin et al), Springer, 2004, 1\u201319.","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"key-10.3934\/amc.2017040-21","doi-asserted-by":"crossref","unstructured":"K. Frikken, Privacy-preserving set union, in <i>Applied Crypt. Netw. Sec. \u2013 ACNS 2007<\/i>(eds. J. Katz et al), Springer, 2007,237\u2013252.","DOI":"10.1007\/978-3-540-72738-5_16"},{"key":"key-10.3934\/amc.2017040-22","doi-asserted-by":"publisher","unstructured":"R. Gennaro and Y. Lindell, A framework for password-based authenticated key exchange (extended abstract), in <i>Adv. Crypt. \u2013 EUROCRYPT 2003<\/i>(ed. E. Biham), Springer, 2003,524\u2013543.","DOI":"10.1007\/3-540-39200-9_33"},{"key":"key-10.3934\/amc.2017040-23","doi-asserted-by":"publisher","unstructured":"O. Goldreich,  <i>Foundations of Cryptography, Volume \u2161. Basic Applications<\/i> Cambridge Press, 2004.","DOI":"10.1017\/CBO9780511721656.002"},{"key":"key-10.3934\/amc.2017040-24","doi-asserted-by":"crossref","unstructured":"C. Hazay and Y. Lindell, Constructions of truly practical secure protocols using standard smartcards, in <i>Proc. 15th ACM Conf. Comp. Commun. Sec. <\/i>, ACM, 2008,491\u2013500.","DOI":"10.1145\/1455770.1455832"},{"key":"key-10.3934\/amc.2017040-25","doi-asserted-by":"publisher","unstructured":"C. Hazay and Y. Lindell, Efficient protocols for set intersection and pattern matching with security against malicious an covert adversaries, in <i>Theory Crypt. \u2013 TCC 2008<\/i>(ed. R. Canetti), Springer, 2008,155\u2013175.","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"key-10.3934\/amc.2017040-26","unstructured":"Y. Huang, D. Evans and J. Katz, Private set intersection: Are garbled circuits better than custom protocols? in <i>Network and Distributed System Security Symposium (NDSS)<\/i> The Internet Soc. , 2012."},{"key":"key-10.3934\/amc.2017040-27","doi-asserted-by":"publisher","unstructured":"S. Jarecki and X. Liu, Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection, in <i>Theory Crypt. \u2013 TCC 2009<\/i>(ed. O. Reingold), Springer, 2009,577\u2013594.","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"key-10.3934\/amc.2017040-28","doi-asserted-by":"crossref","unstructured":"S. Jarecki and X. Liu, Fast secure computation of set intersection, in <i>Sec. Crypt. Netw. \u2013 SCN 2010<\/i>(eds. J. A. Garay et al), Springer, 2010,418\u2013435.","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"key-10.3934\/amc.2017040-29","unstructured":"J. Katz and Y. Lindell, Introduction to modern cryptography in <i>Cryptography and Network Security Series<\/i> Chapman &amp; Hall\/CRC, 2007."},{"key":"key-10.3934\/amc.2017040-30","doi-asserted-by":"crossref","unstructured":"F. Kerschbaum, Outsourced private set intersection using homomorphic encryption, in <i>ACM Symp. Inf. Comp. Commun. Sec. \u2013 ASIACCS 2012<\/i>, ACM, 2012, 85\u201386.","DOI":"10.1145\/2414456.2414506"},{"key":"key-10.3934\/amc.2017040-31","doi-asserted-by":"publisher","unstructured":"L. Kissner and D. Song, Privacy-preserving set operations, in <i>Adv. Crypt. \u2013 CRYPTO 2005<\/i>(ed. \u2164. Shoup), Springer, 2005,241\u2013257.","DOI":"10.1007\/11535218_15"},{"key":"key-10.3934\/amc.2017040-32","doi-asserted-by":"publisher","unstructured":"Y. Lindell, K. Nissim and C. Orlandi, Hiding the input-size in secure two-party computation, in <i>Adv. Crypt. \u2013 ASIACRYPT 2013<\/i>(eds. K. Sako et al), Springer, 2013,421\u2013440.","DOI":"10.1007\/978-3-642-42045-0_22"},{"key":"key-10.3934\/amc.2017040-33","doi-asserted-by":"publisher","unstructured":"R. Miranda,  <i>Algebraic Curves and Riemann Surfaces<\/i> volume 5,1995.","DOI":"10.1090\/gsm\/005"},{"key":"key-10.3934\/amc.2017040-34","doi-asserted-by":"publisher","unstructured":"C. Moreno,  <i>Algebraic Curves over Finite Fields<\/i> Cambridge Univ. Press, 1991.","DOI":"10.1017\/CBO9780511608766"},{"key":"key-10.3934\/amc.2017040-35","doi-asserted-by":"publisher","DOI":"10.1145\/972639.972643"},{"key":"key-10.3934\/amc.2017040-36"},{"key":"key-10.3934\/amc.2017040-37","doi-asserted-by":"publisher","unstructured":"P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, in <i>Adv. Crypt. \u2013 EUROCRYPT'99<\/i>(ed. J. Stern), Springer, 1999,223\u2013238.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"key-10.3934\/amc.2017040-38","unstructured":"B. Pinkas, T. Schneider, G. Segev and M. Zohner, Phasing: private set intersection using permutation-based hashing, in <i>24rd USENIX Sec. Symp. <\/i>, USENIX Assoc. , 2015,515\u2013530."},{"key":"key-10.3934\/amc.2017040-39","unstructured":"B. Pinkas, T. Schneider and M. Zohner, Faster private set intersection based on OT extension, in <i>23rd USENIX Sec. Symp. <\/i>, USENIX Assoc. , 2014,797\u2013812."},{"key":"key-10.3934\/amc.2017040-40","unstructured":"M. Rabin,  <i>How to Exchange Secrets by Oblivious Transfer<\/i> Technical Report TR-81, Aiken Comput. Lab. , Harvard Univ. , 1981."},{"key":"key-10.3934\/amc.2017040-41","unstructured":"R. Rivest, Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer 1999, available at <a href=\"http:\/\/people.csail.mit.edu\/rivest\/publications.html\" target=\"_blank\">http:\/\/people.csail.mit.edu\/rivest\/publications.html<\/a>"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2017_3_481.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:01:39Z","timestamp":1772791299000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2017040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2017040","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}