{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T10:06:02Z","timestamp":1767261962151,"version":"3.37.3"},"reference-count":24,"publisher":"Wiley","issue":"18","license":[{"start":{"date-parts":[[2015,6,29]],"date-time":"2015-06-29T00:00:00Z","timestamp":1435536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61173151"],"award-info":[{"award-number":["61173151"]}],"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":["61173152"],"award-info":[{"award-number":["61173152"]}],"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":["61100229"],"award-info":[{"award-number":["61100229"]}],"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":["61303198"],"award-info":[{"award-number":["61303198"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security Comm Networks"],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Proxy re\u2010encryption (PRE) is a cryptographic primitive that allows a proxy to turn an Alice's ciphertext into a Bob's ciphertext on the same plaintext. At present, there are many different PRE schemes that have been proposed with different properties. However, all of them are based on the logarithm assumption and the large integer factorization assumption except for a bidirectional PRE scheme over lattices. In this paper, we construct the first multi\u2010use unidirectional PRE scheme based on lattices. In addition, the generation of the PRE key does not interact with two users, and the scheme can resist collusion attacks. Moreover, it is proved chosen plaintext attack secure in the standard model based on the Learning With Errors assumption. Finally, an identity\u2010based PRE is obtained from the basic construction. Copyright \u00a9 2015 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/sec.1300","type":"journal-article","created":{"date-parts":[[2015,6,29]],"date-time":"2015-06-29T07:50:09Z","timestamp":1435564209000},"page":"3796-3803","source":"Crossref","is-referenced-by-count":25,"title":["Lattice\u2010based multi\u2010use unidirectional proxy re\u2010encryption"],"prefix":"10.1002","volume":"8","author":[{"given":"M. M.","family":"Jiang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology Huaibei Normal University  Huaibei 235000 China"},{"name":"State Key Laboratory of Integrated Service Networks Xidian University  2 South Taibai Road Xi'an 710071 Shanxi China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y. P.","family":"Hu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks Xidian University  2 South Taibai Road Xi'an 710071 Shanxi China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. C.","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks Xidian University  2 South Taibai Road Xi'an 710071 Shanxi China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. H.","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Physics Shandong Jianzhu University  Jinan 250101 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Q. Q.","family":"Lai","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks Xidian University  2 South Taibai Road Xi'an 710071 Shanxi China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2015,6,29]]},"reference":[{"key":"e_1_2_8_2_1","series-title":"In Advances in Cryptology EUROCRYPT 1998, LNCS","first-page":"127","volume-title":"Divertible Protocols and Atomic Proxy Cryptography","author":"Blaze M","year":"1998"},{"key":"e_1_2_8_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1127345.1127346"},{"key":"e_1_2_8_4_1","series-title":"Proxy Cryptography Revisited","volume-title":"In: NDSS. The Internet Society","author":"Ivan AA","year":"2003"},{"key":"e_1_2_8_5_1","doi-asserted-by":"crossref","unstructured":"CanettiR HohenbergerS.Chosen\u2010ciphertext secure proxy re\u2010encryption In:ACM CCS 2007 New York NY USA 2007;185\u2013194.","DOI":"10.1145\/1315245.1315269"},{"key":"e_1_2_8_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104470"},{"key":"e_1_2_8_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2236606"},{"key":"e_1_2_8_8_1","series-title":"In: ACNS 2007, LNCS","first-page":"288","volume-title":"Identity\u2010based Proxy Re\u2010encryption","author":"Green M","year":"2007"},{"key":"e_1_2_8_9_1","series-title":"In: ISC 2007, LNCS","first-page":"189","volume-title":"Identity\u2010based Proxy Re\u2010encryption Without Random Oracles","author":"Chu C","year":"2007"},{"key":"e_1_2_8_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.06.029"},{"key":"e_1_2_8_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.04.013"},{"key":"e_1_2_8_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/sec.552"},{"key":"e_1_2_8_13_1","series-title":"In: PKC 2009, LNCS","first-page":"357","volume-title":"CCA\u2010secure Proxy Re\u2010encryption Without Pairings","author":"Shao J","year":"2009"},{"key":"e_1_2_8_14_1","series-title":"In: CANS 2008, LNCS","first-page":"1","volume-title":"Chosen\u2010ciphertext Secure Proxy Re\u2010encryption Schemes Without Pairings","author":"Weng J","year":"2008"},{"key":"e_1_2_8_15_1","series-title":"In: PKC 2010, LNCS","first-page":"261","volume-title":"CCA Proxy Re\u2010encryption Without Bilinear Maps in the Standard Model","author":"Matsuda T","year":"2010"},{"key":"e_1_2_8_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_2_8_17_1","unstructured":"XagawaK.Cryptography with lattices.Phd thesis TokyoTokyo Institute of Technology 2010."},{"key":"e_1_2_8_18_1","series-title":"In: PKC 2014, LNCS 8383","first-page":"77","volume-title":"Proxy Re\u2010encryption from Lattices","author":"Kirshanova E","year":"2014"},{"issue":"3","key":"e_1_2_8_19_1","first-page":"535","article-title":"Generating shorter bases for hard random lattices","volume":"48","author":"Alwen J","year":"2009","journal-title":"STACS 2009: 75\u201086. Invited to Theory of Computing Systems"},{"volume-title":"How to Use a Short Basis: Trapdoors for Hard Lattices and New Cryptographic Constructions","year":"2008","author":"Gentry C","key":"e_1_2_8_20_1"},{"key":"e_1_2_8_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_2_8_22_1","series-title":"In: STOC 2005","first-page":"84","volume-title":"On Lattices, Learning with Errors, Random Linear Codes, and Cryptography","author":"Regev O","year":"2005"},{"key":"e_1_2_8_23_1","series-title":"In: STOC 2009","first-page":"333","volume-title":"Public\u2010key Cryptosystems from the Worst\u2010case Shortest Vector Problem","author":"Peikert C","year":"2009"},{"key":"e_1_2_8_24_1","series-title":"In: Eurocrypt 2010. LNCS","first-page":"553","volume-title":"Efficient Lattice (H)IBE in the Standard Model","author":"Agrawal S","year":"2010"},{"key":"e_1_2_8_25_1","series-title":"In: Eurocrypt 2010. LNCS","first-page":"506","volume-title":"Simple BGN\u2010type Cryptosystem from LWE","author":"Gentry C","year":"2010"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fsec.1300","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fsec.1300","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/sec.1300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T21:29:21Z","timestamp":1693690161000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/sec.1300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,29]]},"references-count":24,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["10.1002\/sec.1300"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/sec.1300","archive":["Portico"],"relation":{},"ISSN":["1939-0114","1939-0122"],"issn-type":[{"type":"print","value":"1939-0114"},{"type":"electronic","value":"1939-0122"}],"subject":[],"published":{"date-parts":[[2015,6,29]]}}}