{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T20:34:17Z","timestamp":1754598857797},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811508172"},{"type":"electronic","value":"9789811508189"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-15-0818-9_10","type":"book-chapter","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T19:18:32Z","timestamp":1573154312000},"page":"145-160","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Proxy Re-Signature Over Lattices"],"prefix":"10.1007","author":[{"given":"Mingming","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Jinqiu","family":"Hou","sequence":"additional","affiliation":[]},{"given":"Yuyan","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Shimin","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,8]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0054122","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"M Blaze","year":"1998","unstructured":"Blaze, M., Bleumer, G., Strauss, M.: Divertible protocols and atomic proxy cryptography. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 127\u2013144. Springer, Heidelberg (1998). \n                    https:\/\/doi.org\/10.1007\/BFb0054122"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Ateniese, G., Hohenberger, S.: Proxy re-signatures: new definitions, algorithms, and applications. In: CCS Proceedings of the 15th ACM Conference on Computer and Communications Security, Alexandria, VA, USA, March 2005, pp. 310\u2013319 (2005). \n                    https:\/\/doi.org\/10.1145\/1102120.1102161","DOI":"10.1145\/1102120.1102161"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Libert, B., Vergnaud, D.: Multi-use unidirectional proxy re-signatures. In: CCS Proceedings of the 15th ACM Conference on Computer and Communications Security, Alexandria, VA, USA, October 2008, pp. 511\u2013520 (2008)","DOI":"10.1145\/1455770.1455835"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Sunitha, N.R., Amberker, B.B.: Multi-use unidirectional forward-secure proxy re-signature scheme. In: Proceedings of the 3rd IEEE International Conference on Internet Multimedia Services Architecture and Applications, Bangalore, India, December 2009, pp. 223\u2013228 (2009)","DOI":"10.1109\/IMSAA.2009.5439497"},{"issue":"3","key":"10_CR5","first-page":"165","volume":"2","author":"NR Sunitha","year":"2011","unstructured":"Sunitha, N.R.: Proxy re-signature schemes: multi-use, unidirectional and translations. J. Adv. Inf. Technol. 2(3), 165\u2013176 (2011)","journal-title":"J. Adv. Inf. Technol."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-77026-8_15","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"J Shao","year":"2007","unstructured":"Shao, J., Cao, Z., Wang, L., Liang, X.: Proxy re-signature schemes without random oracles. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 197\u2013209. Springer, Heidelberg (2007). \n                    https:\/\/doi.org\/10.1007\/978-3-540-77026-8_15"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Shao, J., Wei, G.Y., Ling, Y., Xie, M.D.: Unidirectional identity-based proxy re-signature. In: Proceedings of the IEEE Communications Society, Hangzhou, China, June 2011, pp. 1\u20135 (2011)","DOI":"10.1109\/icc.2011.5962456"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-14081-5_14","volume-title":"Information Security and Privacy","author":"J Shao","year":"2010","unstructured":"Shao, J., Feng, M., Zhu, B., Cao, Z., Liu, P.: The security model of unidirectional proxy re-signature with private re-signature key. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol. 6168, pp. 216\u2013232. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-14081-5_14"},{"issue":"24","key":"10_CR9","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/s11424-011-8370-3","volume":"2011","author":"PY Yang","year":"2011","unstructured":"Yang, P.Y., Cao, Z.F., Dong, X.L.: Threshold proxy re-signature. J. Syst. Sci. Complex 2011(24), 816\u2013824 (2011)","journal-title":"J. Syst. Sci. Complex"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: How to use a short basis: trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the STOC 2008, Victoria, Canada, May 2008, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), Article 34 (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"R Lindner","year":"2011","unstructured":"Lindner, R., Peikert, C.: Better key sizes (and attacks) for LWE-based encryption. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 319\u2013339. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-19074-2_21"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson, Kenneth G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 27\u201347. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-20465-4_4"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Cash","year":"2010","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523\u2013552. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-13190-5_27"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 553\u2013572. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-13190-5_28"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-14623-7_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 98\u2013115. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-14623-7_6"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the STOC 2009, Bethesda, Maryland, USA, May 2009, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-14623-7_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C Gentry","year":"2010","unstructured":"Gentry, C.: Toward basing fully homomorphic encryption on worst-case hardness. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 116\u2013137. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-14623-7_7"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Proceedings of the FOCS 2011, Palm Springs, CA, USA, October 2011, pp. 97\u2013106 (2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-17373-8_23","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"SD Gordon","year":"2010","unstructured":"Gordon, S.D., Katz, J., Vaikuntanathan, V.: A group signature scheme from lattice assumptions. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 395\u2013412. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-17373-8_23"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-17373-8_24","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"M R\u00fcckert","year":"2010","unstructured":"R\u00fcckert, M.: Lattice-based blind signatures. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 413\u2013430. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-17373-8_24"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-12929-2_14","volume-title":"Post-Quantum Cryptography","author":"M R\u00fcckert","year":"2010","unstructured":"R\u00fcckert, M.: Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 182\u2013200. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-12929-2_14"},{"key":"10_CR26","unstructured":"Alwen, J., Peiker, C.: Generating shorter bases for hard random lattices. In: Proceedings of the STACS 2009, Freiburg, Germany, February 2009, pp. 75\u201386 (2009)"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-19379-8_1","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Freeman, D.M.: Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 1\u201316. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-19379-8_1"}],"container-title":["Communications in Computer and Information Science","Frontiers in Cyber Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-0818-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T19:18:43Z","timestamp":1573154323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-0818-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811508172","9789811508189"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-0818-9_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"8 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Frontiers in Cyber Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fcs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fcs.xidian.edu.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.55","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}