{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:59:07Z","timestamp":1760241547337,"version":"build-2065373602"},"reference-count":42,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T00:00:00Z","timestamp":1526342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Cloud computing is intensifying the necessity for searchable encryption (SE) for data protection in cloud storage. SE encrypts data to preserve its confidentiality while offering a secure search facility on the encrypted data. Typical index-based SEs in data sharing scenarios can effectively search secure keyword indexes. However, due to the smaller size of the keyword space, SEs using a public key are susceptible to a Keyword Guessing Attack (KGA) and other statistical information leakage. In this paper, for secure search in a data sharing scenario, we propose Random Searchable enCryption (RanSCrypt) that adds randomness to a transformed keyword to increase its space and aspires to make it irreversible. At the core of the mechanism, two keywords are garbled with randomness, still enabling another party to determine if the two garbled keywords (RanSCrypt\u2019s terms REST and Trapdoor) are the same or not without knowing the actual keywords. As SE in a public key setting suffers from vulnerability to KGA, RanSCrypt transfers into a symmetric key setting with minimum overhead and without losing the features of a data sharing scenario. RanSCrypt also adulterates the search result to add perplexity and provides full control of access only to the data receiver. The receiver can cull out the erroneous results from the search result locally. Finally, we introduce a new type of attack on SE, namely, the Keyword Luring Attack (KLA), and show that RanSCrypt is safe from KLA attack due to adulteration of the result. Our security analysis proves RanSCrypt is invulnerable against KGA and leaks no information.<\/jats:p>","DOI":"10.3390\/sym10050161","type":"journal-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T03:29:34Z","timestamp":1526354974000},"page":"161","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Searching on Encrypted E-Data Using Random Searchable Encryption (RanSCrypt) Scheme"],"prefix":"10.3390","volume":"10","author":[{"given":"M","family":"Ahsan","sequence":"first","affiliation":[{"name":"Department of Computer System &amp; Technology, Faculty of Computer Science &amp; Information Technology University of Malaya, Kuala Lumpur 50603, Malaysia"}]},{"given":"Mohd","family":"Idna Bin Idris","sequence":"additional","affiliation":[{"name":"Department of Computer System &amp; Technology, Faculty of Computer Science &amp; Information Technology University of Malaya, Kuala Lumpur 50603, Malaysia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1062-0329","authenticated-orcid":false,"given":"Ainuddin","family":"Bin Abdul Wahab","sequence":"additional","affiliation":[{"name":"Department of Computer System &amp; Technology, Faculty of Computer Science &amp; Information Technology University of Malaya, Kuala Lumpur 50603, Malaysia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9549-2540","authenticated-orcid":false,"given":"Ihsan","family":"Ali","sequence":"additional","affiliation":[{"name":"Department of Computer System &amp; Technology, Faculty of Computer Science &amp; Information Technology University of Malaya, Kuala Lumpur 50603, Malaysia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9058-4809","authenticated-orcid":false,"given":"Nawsher","family":"Khan","sequence":"additional","affiliation":[{"name":"Collage of Computer Science, King Khalid University, Abha 61421, Saudi Arabia"},{"name":"Department of Computer Science, Abdul Wali Khan University, Mardan 23200, Pakistan"}]},{"given":"Mohammed","family":"Al-Garwi","sequence":"additional","affiliation":[{"name":"Collage of Computer Science, King Khalid University, Abha 61421, Saudi Arabia"}]},{"given":"Atiq","family":"Rahman","sequence":"additional","affiliation":[{"name":"Faculty of Computing and Information Technology, Northern Border University, Rafha 76323, Saudi Arabia"}]}],"member":"1968","published-online":{"date-parts":[[2018,5,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Mell, P., and Grance, T. (2011). The NIST Definition of Cloud Computing, National Institute of Standards and Technology.","DOI":"10.6028\/NIST.SP.800-145"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/1721654.1721672","article-title":"A view of cloud computing","volume":"53","author":"Armbrust","year":"2010","journal-title":"Commun. ACM"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.3724\/SP.J.1001.2011.03958","article-title":"Study on cloud computing security","volume":"22","author":"Feng","year":"2011","journal-title":"J. Softw."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MSP.2010.186","article-title":"Security and privacy challenges in cloud computing environments","volume":"8","author":"Takabi","year":"2010","journal-title":"IEEE Secur. Priv."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.ins.2015.01.025","article-title":"Security in cloud computing: Opportunities and challenges","volume":"305","author":"Ali","year":"2015","journal-title":"Inf. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Kamara, S., and Lauter, K. (2010, January 25\u201328). Cryptographic cloud storage. Proceedings of the International Conference on Financial Cryptography and Data Security, Tenerife, Spain.","DOI":"10.1007\/978-3-642-14992-4_13"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.ins.2013.04.028","article-title":"Security and privacy for storage and computation in cloud computing","volume":"258","author":"Wei","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1109\/TCC.2015.2469662","article-title":"Flexible data access control based on trust and reputation in cloud computing","volume":"5","author":"Yan","year":"2017","journal-title":"IEEE Trans. Cloud Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/233551.233553","article-title":"Software protection and simulation on oblivious RAMs","volume":"43","author":"Goldreich","year":"1996","journal-title":"J. ACM (JACM)"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ins.2017.05.004","article-title":"Encrypted data processing with homomorphic re-encryption","volume":"409","author":"Ding","year":"2017","journal-title":"Inf. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.future.2016.01.007","article-title":"Secure searches in the cloud: A survey","volume":"62","author":"Han","year":"2016","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., and Persiano, G. (2004, January 2\u20136). Public key encryption with keyword search. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland.","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/s00145-007-9006-6","article-title":"Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions","volume":"21","author":"Abdalla","year":"2008","journal-title":"J. Cryptol."},{"key":"ref_14","unstructured":"Baek, J., Safavi-Naini, R., and Susilo, W. (July, January 30). Public key encryption with keyword search revisited. Proceedings of the International Conference on Computational Science and Its Applications (ICCSA 2008), Perugia, Italy."},{"key":"ref_15","unstructured":"Park, D.J., Kim, K., and Lee, P.J. (2004, January 23\u201325). Public key encryption with conjunctive field keyword search. Proceedings of the International Workshop on Information Security Applications, Jeju Island, Korea."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/j.jss.2009.11.726","article-title":"Trapdoor security in a searchable public-key encryption scheme with a designated tester","volume":"83","author":"Rhee","year":"2010","journal-title":"J. Syst. Softw."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2266","DOI":"10.1109\/TC.2012.215","article-title":"Public-key encryption with fuzzy keyword search: A provably secure scheme under keyword guessing attack","volume":"62","author":"Xu","year":"2013","journal-title":"IEEE Trans. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Byun, J.W., Rhee, H.S., Park, H.-A., and Lee, D.H. (2006, January 10\u201311). Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. Proceedings of the Workshop on Secure Data Management, Seoul, Korea.","DOI":"10.1007\/11844662_6"},{"key":"ref_19","unstructured":"Mish, F. (2003). Merriam-Webster\u2019s Collegiate Dictionary, Merriam-Webster. Inc.. [11th ed.]."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.comcom.2008.11.018","article-title":"Constructing PEKS schemes secure against keyword guessing attacks is possible?","volume":"32","author":"Jeong","year":"2009","journal-title":"Comput. Commun."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Shen, E., Shi, E., and Waters, B. (2009, January 15\u201317). Predicate privacy in encryption systems. Proceedings of the Theory of Cryptography Conference, San Francisco, CA, USA.","DOI":"10.1007\/978-3-642-00457-5_27"},{"key":"ref_22","unstructured":"Song, D.X., Wagner, D., and Perrig, A. (2000, January 14\u201317). Practical techniques for searches on encrypted data. Proceedings of the 2000 IEEE Symposium on Security and Privacy (S&P 2000), Berkeley, CA, USA."},{"key":"ref_23","first-page":"216","article-title":"Secure indexes","volume":"2003","author":"Goh","year":"2003","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref_24","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. Secur."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Chang, Y.-C., and Mitzenmacher, M. (2005, January 7\u201310). Privacy preserving keyword searches on remote encrypted data. Proceedings of the International Conference on Applied Cryptography and Network Security, New York, NY, USA.","DOI":"10.1007\/11496137_30"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1109\/JSYST.2014.2379646","article-title":"SeDaSC: Secure data sharing in clouds","volume":"11","author":"Ali","year":"2017","journal-title":"IEEE Syst. J."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Swaminathan, A., Mao, Y., Su, G.-M., Gou, H., Varna, A.L., He, S., Wu, M., and Oard, D.W. (2007, January 29). Confidentiality-preserving rank-ordered search. Proceedings of the 2007 ACM Workshop on Storage Security and Survivability, Alexandria, VA, USA.","DOI":"10.1145\/1314313.1314316"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1467","DOI":"10.1109\/TPDS.2011.282","article-title":"Enabling secure and efficient ranked keyword search over outsourced cloud data","volume":"23","author":"Wang","year":"2012","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_29","unstructured":"Zerr, S., Olmedilla, D., Nejdl, W., and Siberski, W. (2009, January 24\u201326). Zerber+R: Top-k retrieval from a confidential index. Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, Saint Petersburg, Russia."},{"key":"ref_30","unstructured":"Intille, S., and Jones, K.S. (1997). Simple, Proven Approaches to Text Retrieval, University of Cambridge, Computer Laboratory, CiteSeerX. Technical Report UCAM-CL-TR-356."},{"key":"ref_31","unstructured":"Witten, I.H., Moffat, A., and Bell, T.C. (1999). Managing Gigabytes: Compressing and Indexing Documents and Images, Morgan Kaufmann."},{"key":"ref_32","unstructured":"Boldyreva, A., Chenette, N., Lee, Y., and O\u2019neill, A. (2009, January 26\u201330). Order-preserving symmetric encryption. Proceedings of the 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), Cologne, Germany."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1109\/TPDS.2013.45","article-title":"Privacy-preserving multi-keyword ranked search over encrypted cloud data","volume":"25","author":"Cao","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"3025","DOI":"10.1109\/TPDS.2013.282","article-title":"Verifiable privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking","volume":"25","author":"Sun","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1109\/TPDS.2015.2401003","article-title":"A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data","volume":"27","author":"Xia","year":"2016","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Wong, W.K., Cheung, D.W.-L., Kao, B., and Mamoulis, N. (July, January 29). Secure kNN computation on encrypted databases. Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, Providence, RI, USA.","DOI":"10.1145\/1559845.1559862"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"2706","DOI":"10.1109\/TIFS.2016.2596138","article-title":"Toward efficient multi-keyword fuzzy search over encrypted outsourced data with accuracy improvement","volume":"11","author":"Fu","year":"2016","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2017.03.038","article-title":"An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks","volume":"403","author":"Huang","year":"2017","journal-title":"Inf. Sci."},{"key":"ref_39","unstructured":"Borg, C.W., and Dackebro, E. (2017). A Comparison of Performance between a CPU and a GPU on Prime Factorization Using Eratosthene\u2019s Sieve and Trial Division. [Bachelor\u2019s Thesis, School of Computer Science and Communication (CSC)]."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Kleinjung, T., Aoki, K., Franke, J., Lenstra, A., Thom\u00e9, E., Bos, J., Gaudry, P., Kruppa, A., Montgomery, P., and Osvik, D.A. (2010, January 15\u201319). Factorization of a 768-bit RSA modulus. Proceedings of the 30th Annual Cryptology Conference (CRYPTO), Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Kiviharju, M. (2017, January 15\u201316). On the fog of RSA key lengths: Verifying public key cryptography strength recommendations. Proceedings of the 2017 International Conference on Military Communications and Information Systems (ICMCIS), Oulu, Finland.","DOI":"10.1109\/ICMCIS.2017.7956481"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1137\/S0036144503439190","article-title":"A survey of public-key cryptosystems","volume":"46","author":"Koblitz","year":"2004","journal-title":"SIAM Rev."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/5\/161\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:04:15Z","timestamp":1760195055000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/5\/161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,15]]},"references-count":42,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2018,5]]}},"alternative-id":["sym10050161"],"URL":"https:\/\/doi.org\/10.3390\/sym10050161","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2018,5,15]]}}}