{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:17:11Z","timestamp":1750220231243,"version":"3.41.0"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T00:00:00Z","timestamp":1637625600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Priv. Secur."],"published-print":{"date-parts":[[2022,2,28]]},"abstract":"<jats:p>\n            Performing searches over encrypted data is a very current and active area. Several efficient solutions have been provided for the\n            <jats:italic>single-writer<\/jats:italic>\n            scenario in which all sensitive data originate with one party (the\n            <jats:italic>Data Owner<\/jats:italic>\n            ) that encrypts and uploads the data to a public repository. Subsequently, the Data Owner accesses the encrypted data through a\n            <jats:italic>Query Processor<\/jats:italic>\n            , which has direct access to the public encrypted repository. Motivated by the recent trend in pervasive data collection, we depart from this model and consider a\n            <jats:italic>multi-writer<\/jats:italic>\n            scenario in which the data originate with several and mutually untrusted parties, the\n            <jats:italic>Data Sources<\/jats:italic>\n            . In this new scenario, the Data Owner provides public parameters so that each Data Source can add encrypted items to the public encrypted stream; moreover, the Data Owner keeps some related secret information needed to generate\n            <jats:italic>tokens<\/jats:italic>\n            so that different\n            <jats:italic>Query Sources<\/jats:italic>\n            can decrypt different subsets of the encrypted stream, as specified by corresponding access policies.\n          <\/jats:p>\n          <jats:p>\n            We propose security model for this problem that we call\n            <jats:italic>Secure Selective Stream<\/jats:italic>\n            (\n            <jats:sans-serif>SSS<\/jats:sans-serif>\n            ) and give a secure construction for it based on hard problems in Pairing-Based Cryptography. The cryptographic core of our construction is a new primitive,\n            <jats:italic>Amortized Orthogonality Encryption<\/jats:italic>\n            , that is crucial for the efficiency of the proposed implementation for\n            <jats:sans-serif>SSS<\/jats:sans-serif>\n            .\n          <\/jats:p>\n          <jats:p\/>","DOI":"10.1145\/3485470","type":"journal-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T23:50:55Z","timestamp":1637711455000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Secure Selections on Encrypted Multi-writer Streams"],"prefix":"10.1145","volume":"25","author":[{"given":"Angelo Massimo","family":"Perillo","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Salerno, Salerno, Italy"}]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Salerno, Salerno, Italy"}]},{"given":"Alberto","family":"Trombetta","sequence":"additional","affiliation":[{"name":"Universit\u00e0 dell\u2019Insubria, Varese, Italy"}]}],"member":"320","published-online":{"date-parts":[[2021,11,23]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46447-2_33"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693383_22"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398521"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366316.2366333"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2590701.2590705"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-005-0046-3"},{"key":"e_1_3_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/14095772X"},{"key":"e_1_3_2_12_1","first-page":"287","volume-title":"Proceedings of the International Conference on Security and Cryptography (SECRYPT\u201910)","author":"Ion Mihaela","year":"2010","unstructured":"Mihaela Ion, Giovanni Russello, and Bruno Crispo. 2010. Providing confidentiality in content-based publish\/subscribe systems. In Proceedings of the International Conference on Security and Cryptography (SECRYPT\u201910), Sokratis K. Katsikas and Pierangela Samarati (Eds.). SciTePress, 287\u2013292."},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516730"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_4"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03326-2_6"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-012-9119-4"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_4"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813651"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2022815.2022836"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0131-1"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E99.A.92"},{"key":"e_1_3_2_22_1","first-page":"556","article-title":"Definitional issues in functional encryption","author":"O\u2019Neill Adam","year":"2010","unstructured":"Adam O\u2019Neill. 2010. Definitional issues in functional encryption. IACR Cryptol. ePrint Arch. (2010), 556.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2442626.2442656"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9405-9"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98989-1_11"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2017.20"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043566"},{"key":"e_1_3_2_28_1","volume-title":"Pairing-Friendly Curves","author":"Sakemi Yumi","year":"2020","unstructured":"Yumi Sakemi, Tetsutaro Kobayashi, Tsunekazu Saito, and Riad S. Wahby. 2020. Pairing-Friendly Curves. Internet-Draft draft-irtf-cfrg-pairing-friendly-curves-09. Internet Engineering Task Force. Retrieved from https:\/\/datatracker.ietf.org\/doc\/html\/draft-irtf-cfrg-pairing-friendly-curves-09."},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_27"},{"key":"e_1_3_2_30_1","first-page":"44","volume-title":"Proceeding of the IEEE Symposium on Security and Privacy (S&P\u201900)","author":"Song D.","year":"2000","unstructured":"D. Song, D. Wagner, and A. Perrig. 2000. Practical techniques for searches on encrypted data. In Proceeding of the IEEE Symposium on Security and Privacy (S&P\u201900). 44\u201355."}],"container-title":["ACM Transactions on Privacy and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485470","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:15Z","timestamp":1750188615000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,23]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2,28]]}},"alternative-id":["10.1145\/3485470"],"URL":"https:\/\/doi.org\/10.1145\/3485470","relation":{},"ISSN":["2471-2566","2471-2574"],"issn-type":[{"type":"print","value":"2471-2566"},{"type":"electronic","value":"2471-2574"}],"subject":[],"published":{"date-parts":[[2021,11,23]]},"assertion":[{"value":"2019-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}