{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:31:35Z","timestamp":1770539495630,"version":"3.49.0"},"reference-count":38,"publisher":"Oxford University Press (OUP)","issue":"8","license":[{"start":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T00:00:00Z","timestamp":1602720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We introduce the notion of private set operations (PSO) as a symmetric-key primitive in the cloud scenario, where a client securely outsources his dataset to a cloud service provider and later privately issues queries in the form of common set operations. We define a syntax and security notion for PSO and propose a general construction that satisfies it. There are two main ingredients to our PSO scheme: an adjustable join (Adjoin) scheme (MIT-CSAIL-TR-2012-006 (2012) Cryptographic treatment of CryptDB\u2019s adjustable join. http:\/\/people.csail.mit.edu\/nickolai\/papers\/popa-join-tr.pdf) and a tuple set (TSet) scheme (Cash, D., Jarecki, S., Jutla, C. S., Krawczyk, H., Rosu, M.-C., and Steiner, M. (2013) Highly-Scalable Searchable Symmetric Encryption With Support for Boolean Queries. 33rd Annual Cryptology Conf., Santa Barbara, CA, August 18\u201322, pp. 353\u2013373. Springer, Berlin, Heidelberg). We also propose an Adjoin construction that is substantially more efficient (in computation and storage) than the previous ones (Mironov, I., Segev, G., and Shahaf, I. (2017) Strengthening the Security of Encrypted Databases: Non-Transitive Joins. 15th Int. Conf., TCC 2017, Baltimore, MD, USA, November 12\u201315, pp. 631\u2013661. Springer, Cham) due to the hardness assumption that we rely on, while retaining the same security notion. The proposed PSO scheme can be used to perform join queries on encrypted databases without revealing the duplicate patterns in the unqueried columns, which is inherent to an Adjoin scheme. In addition, we also show that the PSO scheme can be used to perform Boolean search queries on a collection of encrypted documents. We also provide standard security proofs for our constructions and present detailed efficiency evaluation and compare them with well-known previous ones.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaa123","type":"journal-article","created":{"date-parts":[[2020,9,8]],"date-time":"2020-09-08T19:10:44Z","timestamp":1599592244000},"page":"1145-1162","source":"Crossref","is-referenced-by-count":6,"title":["Private Set Operations Over Encrypted Cloud Dataset and Applications"],"prefix":"10.1093","volume":"64","author":[{"given":"Mojtaba","family":"Rafiee","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Sharif University of Technology, Tehran 11155-1639, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahram","family":"Khazaei","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Sharif University of Technology, Tehran 11155-1639, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2020,10,15]]},"reference":[{"key":"2021082512504510100_ref1","first-page":"44","article-title":"Practical Techniques for Searches on Encrypted Data","volume-title":"IEEE Symposium on Security and Privacy","author":"Song","year":"2000"},{"key":"2021082512504510100_ref2","first-page":"353","article-title":"Highly-Scalable Searchable Symmetric Encryption With Support for Boolean Queries","volume-title":"33rd Annual Cryptology Conf.","author":"Cash","year":"2013"},{"key":"2021082512504510100_ref3","volume-title":"Cryptographic treatment of CryptDB\u2019s adjustable join","author":"MIT-CSAIL-TR-2012-006","year":"2012"},{"key":"2021082512504510100_ref4","first-page":"442","article-title":"Privacy Preserving Keyword Searches on Remote Encrypted Data","volume-title":"Third Int. Conf. ACNS, New York, NY, USA","author":"Chang","year":"2005"},{"key":"2021082512504510100_ref5","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/j.future.2019.06.018","article-title":"Verifiable ranked search over encrypted data with forward and backward privacy","volume":"101","author":"Najafi","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"2021082512504510100_ref6","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/j.future.2019.05.001","article-title":"Secure conjunctive multi-keyword ranked search over encrypted cloud data for multiple data owners","volume":"100","author":"Yin","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"2021082512504510100_ref7","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.future.2019.05.038","article-title":"Witness-based searchable encryption with optimal overhead for cloud-edge computing","volume":"100","author":"Chen","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"2021082512504510100_ref8","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.future.2018.05.048","article-title":"A parallelized disjunctive query based searchable encryption scheme for big data","volume":"109","author":"Tahir","year":"2020","journal-title":"Future Gener. Comput. Syst."},{"key":"2021082512504510100_ref9","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.future.2017.09.030","article-title":"Controllable keyword search scheme supporting multiple users","volume":"81","author":"Ye","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"key":"2021082512504510100_ref10","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.future.2016.05.017","article-title":"A multi-user searchable encryption scheme with keyword authorization in a cloud storage","volume":"72","author":"Deng","year":"2017","journal-title":"Future Gener. Comput. Syst."},{"key":"2021082512504510100_ref11","first-page":"577","article-title":"Structured Encryption and Controlled Disclosure","volume-title":"16th Int. Conf. Theory and Application of Cryptology and Information Security","author":"Chase","year":"2010"},{"key":"2021082512504510100_ref12","first-page":"1465","article-title":"Forward and Backward Private Searchable Encryption From Constrained Cryptographic Primitives","volume-title":"Conf. Computer and Communications Security, CCS","author":"Bost","year":"2017"},{"key":"2021082512504510100_ref13","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1093\/comjnl\/bxy134","article-title":"A searchable asymmetric encryption scheme with support for boolean queries for cloud applications","volume":"62","author":"Zeng","year":"2019","journal-title":"Comput. J."},{"key":"2021082512504510100_ref14","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1093\/comjnl\/bxz140","article-title":"Practical attribute-based conjunctive keyword search scheme","volume":"63","author":"Chen","year":"2019","journal-title":"Comput. J"},{"key":"2021082512504510100_ref15","doi-asserted-by":"crossref","first-page":"895","DOI":"10.3233\/JCS-2011-0426","article-title":"Searchable symmetric encryption: improved definitions and efficient constructions","volume":"19","author":"Curtmola","year":"2011","journal-title":"J. Comput. Security"},{"key":"2021082512504510100_ref16","first-page":"668","article-title":"The fallacy of composition of oblivious RAM and searchable encryption","volume":"2015","author":"Naveed","year":"2015","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2021082512504510100_ref17","first-page":"631","article-title":"Strengthening the Security of Encrypted Databases: Non-Transitive Joins","volume-title":"15th Int. Conf., TCC 2017, Baltimore, MD, USA","author":"Mironov","year":"2017"},{"key":"2021082512504510100_ref18","first-page":"164","article-title":"Authenticated id-based key exchange and remote log-in with simple token and PIN number","volume":"2002","author":"Scott","year":"2002","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2021082512504510100_ref19","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","article-title":"Lower Bounds for Discrete Logarithms and Related Problems","volume-title":"Advances in Cryptology\u2013EUROCRYPT \u201997, Int. Conf. Theory and Application of Cryptographic Techniques","author":"Shoup","year":"1997"},{"key":"2021082512504510100_ref20","first-page":"707","article-title":"All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption","volume-title":"25th USENIX Security Symposium, USENIX Security 16","author":"Zhang","year":"2016"},{"key":"2021082512504510100_ref21","article-title":"Access Pattern Disclosure on Searchable Encryption: Ramification, Attack and Mitigation","author":"Islam","year":"2012","journal-title":"19th Annual Network and Distributed System Security Symposium, NDSS 2012"},{"key":"2021082512504510100_ref22","first-page":"1060","article-title":"Thwarting leakage abuse attacks against searchable encryption\u2014a formal approach and applications to database padding","volume":"2017","author":"Bost","year":"2017","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2021082512504510100_ref23","first-page":"668","article-title":"Leakage-Abuse Attacks Against Searchable Encryption","volume-title":"Proc. 22nd ACM SIGSAC Conf. Computer and Communications Security","author":"Cash","year":"2015"},{"key":"2021082512504510100_ref24","first-page":"1175","article-title":"Revisiting leakage abuse attacks","volume":"2019","author":"Blackstone","year":"2019","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2021082512504510100_ref25","first-page":"978","article-title":"Encrypted multi-maps with computationally-secure leakage","volume":"2018","author":"Kamara","year":"2018","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2021082512504510100_ref26","doi-asserted-by":"crossref","first-page":"2503","DOI":"10.1109\/INFOCOM.2019.8737588","article-title":"Hardening Database Padding for Searchable Encryption","volume-title":"IEEE Conf. Computer Communications, INFOCOM 2019","author":"Xu","year":"2019"},{"key":"2021082512504510100_ref27","first-page":"417","article-title":"Correlation-resistant storage via keyword-searchable encryption","volume":"2005","author":"Ballard","year":"2005","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2021082512504510100_ref28","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1112\/S1461157000001108","article-title":"Easy decision Diffie\u2013Hellman groups","volume":"7","author":"Galbraith","year":"2004","journal-title":"LMS J. Comput. Math."},{"key":"2021082512504510100_ref29","first-page":"41","article-title":"Short Group Signatures","volume-title":"24th Annual Int. Cryptology Conf., Santa Barbara, California, USA, August 15\u201319","author":"Boneh","year":"2004"},{"key":"2021082512504510100_ref30","first-page":"92","article-title":"Untraceable RFID Tags via Insubvertible Encryption","volume-title":"Proc. 12th ACM Conf. Computer and Communications Security, CCS 2005","author":"Ateniese","year":"2005"},{"key":"2021082512504510100_ref31","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/11426639_18","article-title":"Compact E-Cash","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2005, 24th Annual Int. Conf. Theory and Applications of Cryptographic Techniques","author":"Camenisch","year":"2005"},{"key":"2021082512504510100_ref32","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/s00145-018-9302-3","article-title":"Automated analysis of cryptographic assumptions in generic group models","volume":"32","author":"Barthe","year":"2019","journal-title":"J. Cryptol."},{"key":"2021082512504510100_ref33","article-title":"Psec: provably secure elliptic curve encryption scheme","volume-title":"IEEE P1363a","author":"Okamoto","year":"2000"},{"key":"2021082512504510100_ref34","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/s00145-015-9220-6","article-title":"An algebraic framework for Diffie\u2013Hellman assumptions","volume":"30","author":"Escala","year":"2017","journal-title":"J. Cryptol."},{"key":"2021082512504510100_ref35","first-page":"1","article-title":"Recommendation for key management part 1: General (revision 3)","volume":"800","author":"Barker","year":"2012","journal-title":"NIST Special Publ."},{"key":"2021082512504510100_ref36","volume-title":"Yearly Report on Algorithms and Key Lengths (2010)","author":"ECRYPT, I","year":"2011"},{"key":"2021082512504510100_ref37","first-page":"463","article-title":"Practical Constructions and New Proof Methods for Large Universe Attribute-Based Encryption","volume-title":"2013 ACM SIGSAC Conf. Computer and Communications Security, CCS\u201913","author":"Rouselakis","year":"2013"},{"key":"2021082512504510100_ref38","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1109\/ISCC.2011.5983948","article-title":"jpbc: Java Pairing Based Cryptography","volume-title":"Proc. 16th IEEE Symposium on Computers and Communications, ISCC 2011","author":"Caro","year":"2011"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/8\/1145\/39904363\/bxaa123.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/8\/1145\/39904363\/bxaa123.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T12:51:11Z","timestamp":1629895871000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/64\/8\/1145\/5921321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,15]]},"references-count":38,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2020,10,15]]},"published-print":{"date-parts":[[2021,8,25]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaa123","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2021,8]]},"published":{"date-parts":[[2020,10,15]]}}}