{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:43:57Z","timestamp":1740149037793,"version":"3.37.3"},"reference-count":22,"publisher":"Wiley","license":[{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402393","61601396","AGK201607"],"award-info":[{"award-number":["61402393","61601396","AGK201607"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402393","61601396","AGK201607"],"award-info":[{"award-number":["61402393","61601396","AGK201607"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Key Laboratory of Integrated Administration Technologies for Information Security","award":["61402393","61601396","AGK201607"],"award-info":[{"award-number":["61402393","61601396","AGK201607"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2019,5,13]]},"abstract":"<jats:p>Searchable public key encryption scheme is a key technique for protecting data confidentiality in today\u2019s cloud environment. Specifically, public key encryption with conjunctive and disjunctive keyword search (PECDK) can provide flexible search options without sacrificing keywords security and thus attracts a lot of attention nowadays. However, the most effective PECDK scheme is based on the inner product encryption (IPE), which needs more time and space cost. In this paper, by utilizing the bilinear pairing with a prime order group, we propose an efficient PECDK scheme needing less time and storage consumption. The proposed scheme is proven to be secure under a rigorous security definition. The theoretical analysis and experimental results demonstrate that our proposed scheme can significantly improve the time and space efficiency over the state-of-the-art scheme.<\/jats:p>","DOI":"10.1155\/2019\/5280806","type":"journal-article","created":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T23:30:53Z","timestamp":1557790253000},"page":"1-14","source":"Crossref","is-referenced-by-count":13,"title":["Secure and Efficient Searchable Public Key Encryption for Resource Constrained Environment Based on Pairings under Prime Order Group"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8261-0627","authenticated-orcid":true,"given":"Yu","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer and Information Technology, Xinyang Normal University, Xinyang 464000, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9529-8481","authenticated-orcid":true,"given":"Yin","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology, Xinyang Normal University, Xinyang 464000, China"}]},{"given":"Yifan","family":"Wang","sequence":"additional","affiliation":[{"name":"Wayne State University, 42 W Warren Ave, Detroit, MI 48202, USA"}]}],"member":"311","reference":[{"issue":"5","key":"2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/MSP.2011.155","volume":"10","year":"2012","journal-title":"IEEE Security & Privacy"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2015.2506573"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.282"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1587\/transcom.e98.b.190"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2401003"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2016.2596138"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2784395"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2010.07.007"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/3839254"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0131-1"},{"issue":"4","key":"21","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1109\/TIFS.2015.2506145","volume":"11","year":"2016","journal-title":"IEEE Transactions on Information Forensics and Security"},{"issue":"3","key":"35","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1109\/TDSC.2016.2593444","volume":"15","year":"2018","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2818651"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2017.2710190"},{"issue":"2","key":"26","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1109\/JSYST.2017.2667679","volume":"12","year":"2018","journal-title":"IEEE Systems Journal"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.07.077"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/tsc.2016.2520932"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2018.2789893"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-014-0270-9"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1109\/tsc.2016.2542813"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1002\/dac.2942"},{"issue":"99","key":"32","first-page":"1","volume":"pp","year":"2016","journal-title":"IEEE Transactions on Dependable and Secure Computing"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2019\/5280806.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2019\/5280806.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2019\/5280806.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T14:51:11Z","timestamp":1694875871000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2019\/5280806\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,13]]},"references-count":22,"alternative-id":["5280806","5280806"],"URL":"https:\/\/doi.org\/10.1155\/2019\/5280806","relation":{},"ISSN":["1939-0114","1939-0122"],"issn-type":[{"type":"print","value":"1939-0114"},{"type":"electronic","value":"1939-0122"}],"subject":[],"published":{"date-parts":[[2019,5,13]]}}}