{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T20:10:49Z","timestamp":1760472649702,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T00:00:00Z","timestamp":1540252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472114","61672346","61702342"],"award-info":[{"award-number":["61472114","61672346","61702342"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key R&amp;D Program of China","award":["2017YFB0802000"],"award-info":[{"award-number":["2017YFB0802000"]}]},{"name":"Science and Technology Innovation Projects of Shenzhen","award":["GJHZ20160226202520268, JCYJ20170302145623566"],"award-info":[{"award-number":["GJHZ20160226202520268, JCYJ20170302145623566"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>An Identity-based encryption (IBE) simplifies key management by taking users\u2019 identities as public keys. However, how to dynamically revoke users in an IBE scheme is not a trivial problem. To solve this problem, IBE scheme with revocation (namely revocable IBE scheme) has been proposed. Apart from those lattice-based IBE, most of the existing schemes are based on decisional assumptions over pairing-groups. In this paper, we propose a revocable IBE scheme based on a weaker assumption, namely Computational Diffie-Hellman (CDH) assumption over non-pairing groups. Our revocable IBE scheme is inspired by the IBE scheme proposed by D\u00f6ttling and Garg in Crypto2017. Like D\u00f6ttling and Garg\u2019s IBE scheme, the key authority maintains a complete binary tree where every user is assigned to a leaf node. To adapt such an IBE scheme to a revocable IBE, we update the nodes along the paths of the revoked users in each time slot. Upon this updating, all revoked users are forced to be equipped with new encryption keys but without decryption keys, thus they are unable to perform decryption any more. We prove that our revocable IBE is adaptive IND-ID-CPA secure in the standard model. Our scheme serves as the first revocable IBE scheme from the CDH assumption. Moreover, we extend our scheme to support Decryption Key Exposure Resistance (DKER) and also propose a server-aided revocable IBE to decrease the decryption workload of the receiver. In our schemes, the size of updating key in each time slot is only related to the number of newly revoked users in the past time slot.<\/jats:p>","DOI":"10.3390\/cryptography2040033","type":"journal-article","created":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T02:59:40Z","timestamp":1540349980000},"page":"33","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Revocable Identity-Based Encryption and Server-Aided Revocable IBE from the Computational Diffie-Hellman Assumption"],"prefix":"10.3390","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8446-2231","authenticated-orcid":false,"given":"Ziyuan","family":"Hu","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China"}]},{"given":"Shengli","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China"},{"name":"Westone Cryptologic Research Center, Beijing 100070, China"}]},{"given":"Kefei","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hangzhou Normal University, Hangzhou 310036, China"},{"name":"Westone Cryptologic Research Center, Beijing 100070, China"}]},{"given":"Joseph K.","family":"Liu","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Monash University, Clayton VIC 3800, Australia"}]}],"member":"1968","published-online":{"date-parts":[[2018,10,23]]},"reference":[{"key":"ref_1","unstructured":"Shamir, A. (1984, January 19\u201322). Identity-Based Cryptosystems and Signature Schemes. Proceedings of the CRYPTO 1984, Advances in Cryptology, Santa Barbara, CA, USA."},{"key":"ref_2","unstructured":"Waters, B. (2005, January 22\u201326). Efficient Identity-Based Encryption Without Random Oracles. Proceedings of the 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Advances in Cryptology (EUROCRYPT 2005), Aarhus, Denmark."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Gentry, C. (June, January 28). Practical Identity-Based Encryption Without Random Oracles. Proceedings of the 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Advances in Cryptology (EUROCRYPT 2006), St. Petersburg, Russia.","DOI":"10.1007\/11761679_27"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Okamoto, T., and Takashima, K. (2010, January 15\u201319). Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption. Proceedings of the 30th Annual Cryptology Conference, Advances in Cryptology (CRYPTO 2010), Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-14623-7_11"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., and Vaikuntanathan, V. (2008, January 17\u201320). Trapdoors for hard lattices and new cryptographic constructions. Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, BC, Canada.","DOI":"10.1145\/1374376.1374407"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., and Boyen, X. (June, January 30). Efficient Lattice (H)IBE in the Standard Model. Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology: (EUROCRYPT 2010), Monaco\/Nice, France.","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., and Peikert, C. (June, January 30). Bonsai Trees, or How to Delegate a Lattice Basis. Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Advances in Cryptology (EUROCRYPT 2010), Monaco\/Nice, France.","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"D\u00f6ttling, N., and Garg, S. (2017, January 20\u201324). Identity-Based Encryption from the Diffie-Hellman Assumption. Proceedings of the 37th Annual International Cryptology Conference, Advances in Cryptology (CRYPTO 2017), Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-319-63688-7_18"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/S0097539701398521","article-title":"Identity-Based Encryption from the Weil Pairing","volume":"32","author":"Boneh","year":"2003","journal-title":"SIAM J. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., Goyal, V., and Kumar, V. (2008, January 27\u201331). Identity-based encryption with efficient revocation. Proceedings of the 2008 ACM Conference on Computer and Communications Security (CCS 2008), Alexandria, VA, USA.","DOI":"10.1145\/1455770.1455823"},{"key":"ref_11","unstructured":"Sahai, A., and Waters, B. (2005, January 22\u201326). Fuzzy Identity-Based Encryption. Proceedings of the 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Advances in Cryptology (EUROCRYPT 2005), Aarhus, Denmark."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Libert, B., and Vergnaud, D. (2009, January 20\u201324). Adaptive-ID Secure Revocable Identity-Based Encryption. Proceedings of the Cryptographers\u2019 Track at the RSA Conference on Topics in Cryptology (CT-RSA 2009), San Francisco, CA, USA.","DOI":"10.1007\/978-3-642-00862-7_1"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Seo, J.H., and Emura, K. (March, January 26). Revocable Identity-Based Encryption Revisited: Security Model and Construction. Proceedings of the 16th International Conference on Practice and Theory in Public-Key Cryptography: Public-Key Cryptography (PKC 2013), Nara, Japan.","DOI":"10.1007\/978-3-642-36362-7_14"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10623-016-0287-3","article-title":"Efficient revocable identity-based encryption via subset difference methods","volume":"85","author":"Lee","year":"2017","journal-title":"Des. Codes Cryptogr."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Watanabe, Y., Emura, K., and Seo, J.H. (2017, January 14\u201317). New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters. Proceedings of the Cryptographers\u2019 Track at the RSA Conference on Topics in Cryptology (CT-RSA 2017), San Francisco, CA, USA.","DOI":"10.1007\/978-3-319-52153-4_25"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1109\/TIFS.2015.2419180","article-title":"New Constructions of Revocable Identity-Based Encryption from Multilinear Maps","volume":"10","author":"Park","year":"2015","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_17","unstructured":"Chen, J., Lim, H.W., Ling, S., Wang, H., and Nguyen, K. (2012, January 9\u201311). Revocable Identity-Based Encryption from Lattices. Proceedings of the 17th Australasian Conference on Information Security and Privacy (ACISP 2012), Wollongong, NSW, Australia."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Takayasu, A., and Watanabe, Y. (2017, January 3\u20135). Lattice-Based Revocable Identity-Based Encryption with Bounded Decryption Key Exposure Resistance. Proceedings of the 22nd Australasian Conference on Information Security and Privacy (ACISP 2017), Auckland, New Zealand.","DOI":"10.1007\/978-3-319-60055-0_10"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Qin, B., Deng, R.H., Li, Y., and Liu, S. (2015, January 21\u201325). Server-Aided Revocable Identity-Based Encryption. Proceedings of the 20th European Symposium on Research in Computer Security (ESORICS 2015), Vienna, Austria.","DOI":"10.1007\/978-3-319-24174-6_15"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Liang, K., Liu, J.K., Wong, D.S., and Susilo, W. (2014, January 7\u201311). An Efficient Cloud-Based Revocable Identity-Based Proxy Re-encryption Scheme for Public Clouds Data Sharing. Proceedings of the 19th European Symposium on Research in Computer Security (ESORICS 2014), Wroclaw, Poland.","DOI":"10.1007\/978-3-319-11203-9_15"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Yang, Y., Liu, J.K., Liang, K., Choo, K.R., and Zhou, J. (2015, January 21\u201325). Extended Proxy-Assisted Approach: Achieving Revocable Fine-Grained Encryption of Cloud Data. Proceedings of the 20th European Symposium on Research in Computer Security (ESORICS 2015), Vienna, Austria.","DOI":"10.1007\/978-3-319-24177-7_8"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Yang, Y., Liu, J.K., Wei, Z., and Huang, X. (2017, January 3\u20135). Towards Revocable Fine-Grained Encryption of Cloud Data: Reducing Trust upon Cloud. Proceedings of the 22nd Australasian Conference on Information Security and Privacy (ACISP 2017), Auckland, New Zealand.","DOI":"10.1007\/978-3-319-60055-0_7"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Liu, J.K., Yuen, T.H., Zhang, P., and Liang, K. (2018, January 2\u20134). Time-Based Direct Revocable Ciphertext-Policy Attribute-Based Encryption with Short Revocation List. Proceedings of the 16th International Conference on Applied Cryptography and Network Security (ACNS 2018), Leuven, Belgium.","DOI":"10.1007\/978-3-319-93387-0_27"},{"key":"ref_24","first-page":"420","article-title":"Lattice-based Revocable (Hierarchical) IBE with Decryption Key Exposure Resistance","volume":"2018","author":"Katsumata","year":"2018","journal-title":"IACR Cryptol. ePrint Arch."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/2\/4\/33\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:25:44Z","timestamp":1760196344000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/2\/4\/33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,23]]},"references-count":24,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,12]]}},"alternative-id":["cryptography2040033"],"URL":"https:\/\/doi.org\/10.3390\/cryptography2040033","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2018,10,23]]}}}