{"article_processing_charge":"No","year":"2018","month":"02","isi":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"KrPi"}],"publisher":"AIMS","day":"01","title":"Private set-intersection with common set-up","quality_controlled":"1","citation":{"ieee":"S. Chatterjee, C. Kamath Hosdurg, and V. Kumar, “Private set-intersection with common set-up,” <i>American Institute of Mathematical Sciences</i>, vol. 12, no. 1. AIMS, pp. 17–47, 2018.","ama":"Chatterjee S, Kamath Hosdurg C, Kumar V. Private set-intersection with common set-up. <i>American Institute of Mathematical Sciences</i>. 2018;12(1):17-47. doi:<a href=\"https://doi.org/10.3934/amc.2018002\">10.3934/amc.2018002</a>","mla":"Chatterjee, Sanjit, et al. “Private Set-Intersection with Common Set-Up.” <i>American Institute of Mathematical Sciences</i>, vol. 12, no. 1, AIMS, 2018, pp. 17–47, doi:<a href=\"https://doi.org/10.3934/amc.2018002\">10.3934/amc.2018002</a>.","short":"S. Chatterjee, C. Kamath Hosdurg, V. Kumar, American Institute of Mathematical Sciences 12 (2018) 17–47.","ista":"Chatterjee S, Kamath Hosdurg C, Kumar V. 2018. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 12(1), 17–47.","apa":"Chatterjee, S., Kamath Hosdurg, C., &#38; Kumar, V. (2018). Private set-intersection with common set-up. <i>American Institute of Mathematical Sciences</i>. AIMS. <a href=\"https://doi.org/10.3934/amc.2018002\">https://doi.org/10.3934/amc.2018002</a>","chicago":"Chatterjee, Sanjit, Chethan Kamath Hosdurg, and Vikas Kumar. “Private Set-Intersection with Common Set-Up.” <i>American Institute of Mathematical Sciences</i>. AIMS, 2018. <a href=\"https://doi.org/10.3934/amc.2018002\">https://doi.org/10.3934/amc.2018002</a>."},"date_published":"2018-02-01T00:00:00Z","intvolume":"        12","page":"17-47","type":"journal_article","doi":"10.3934/amc.2018002","_id":"5980","scopus_import":"1","publication":"American Institute of Mathematical Sciences","language":[{"iso":"eng"}],"issue":"1","publication_status":"published","author":[{"full_name":"Chatterjee, Sanjit","last_name":"Chatterjee","first_name":"Sanjit"},{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg","first_name":"Chethan"},{"full_name":"Kumar, Vikas","first_name":"Vikas","last_name":"Kumar"}],"date_created":"2019-02-13T13:49:41Z","external_id":{"isi":["000430950400002"]},"status":"public","date_updated":"2023-09-19T14:27:59Z","volume":12,"abstract":[{"text":"The problem of private set-intersection (PSI) has been traditionally treated as an instance of the more general problem of multi-party computation (MPC). Consequently, in order to argue security, or compose these protocols one has to rely on the general theory that was developed for the purpose of MPC. The pursuit of efficient protocols, however, has resulted in designs that exploit properties pertaining to PSI. In almost all practical applications where a PSI protocol is deployed, it is expected to be executed multiple times, possibly on related inputs. In this work we initiate a dedicated study of PSI in the multi-interaction (MI) setting. In this model a server sets up the common system parameters and executes set-intersection multiple times with potentially different clients. We discuss a few attacks that arise when protocols are naïvely composed in this manner and, accordingly, craft security definitions for the MI setting and study their inter-relation. Finally, we suggest a set of protocols that are MI-secure, at the same time almost as efficient as their parent, stand-alone, protocols.","lang":"eng"}],"oa_version":"None"}