{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:43:26Z","timestamp":1762004606844},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,5,26]],"date-time":"2014-05-26T00:00:00Z","timestamp":1401062400000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s11704-014-3163-1","type":"journal-article","created":{"date-parts":[[2014,5,26]],"date-time":"2014-05-26T10:27:32Z","timestamp":1401100052000},"page":"667-675","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A lattice-based signcryption scheme without random oracles"],"prefix":"10.1007","volume":"8","author":[{"given":"Xiuhua","family":"Lu","sequence":"first","affiliation":[]},{"given":"Qiaoyan","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Zhengping","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Licheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chunli","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,26]]},"reference":[{"key":"3163_CR1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BFb0052234","volume":"1294","author":"Y Zheng","year":"1997","unstructured":"Zheng Y. Digital signcryption or how to achieve cost(signature & encryption) \u226a cost(signature) + cost(encryption). Lecture Notes in Computer Science, 1997, 1294: 165\u2013179","journal-title":"Lecture Notes in Computer Science"},{"key":"3163_CR2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/978-3-540-45146-4_23","volume":"2729","author":"X Boyen","year":"2003","unstructured":"Boyen X. Multipurpose identity-based signcryption. Lecture Notes in Computer Science, 2003, 2729: 383\u2013399","journal-title":"Lecture Notes in Computer Science"},{"key":"3163_CR3","first-page":"211","volume-title":"Proceedings of the 2003 RSA Conference on the Cryptographers\u2019 Track","author":"J Malone-Lee","year":"2003","unstructured":"Malone-Lee J, Mao W. Two birds one stone: signcryption using RSA. In: Proceedings of the 2003 RSA Conference on the Cryptographers\u2019 Track. 2003, 211\u2013226"},{"key":"3163_CR4","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/11593447_28","volume":"3788","author":"P Barreto","year":"2005","unstructured":"Barreto P, Libert B, McCullagh N, Quisquater J. Efficient and provablysecure identity-based signatures and signcryption from bilinear maps. Lecture Notes in Computer Science, 2005, 3788: 515\u2013532","journal-title":"Lecture Notes in Computer Science"},{"issue":"1","key":"3163_CR5","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.mcm.2012.06.011","volume":"57","author":"F Li","year":"2013","unstructured":"Li F, Shirase M, Takagi T. Certificateless hybrid signcryption. Mathematical and Computer Modelling, 2013, 57(1): 324\u2013343","journal-title":"Mathematical and Computer Modelling"},{"issue":"5","key":"3163_CR6","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P Shor","year":"1997","unstructured":"Shor P. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 1997, 26(5): 1484\u20131509","journal-title":"SIAM Journal on Computing"},{"key":"3163_CR7","first-page":"187","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing","author":"C Peikert","year":"2008","unstructured":"Peikert C, Waters B. Lossy trapdoor functions and their applications. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing. 2008, 187\u2013196"},{"key":"3163_CR8","first-page":"333","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"C Peikert","year":"2009","unstructured":"Peikert C. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. 2009, 333\u2013342"},{"key":"3163_CR9","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume":"7237","author":"D Micciancio","year":"2012","unstructured":"Micciancio D, Peikert C. Trapdoors for lattices: Simpler, tighter, faster, smaller. Lecture Notes in Computer Science, 2012, 7237: 700\u2013718","journal-title":"Lecture Notes in Computer Science"},{"key":"3163_CR10","first-page":"197","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing","author":"C Gentry","year":"2008","unstructured":"Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing. 2008, 197\u2013206"},{"key":"3163_CR11","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume":"6110","author":"D Cash","year":"2010","unstructured":"Cash D, Hofheinz D, Kiltz E, Peikert C. Bonsai trees, or how to delegate a lattice basis. Lecture Notes in Computer Science, 2010, 6110: 523\u2013552","journal-title":"Lecture Notes in Computer Science"},{"key":"3163_CR12","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/978-3-642-13013-7_29","volume":"6056","author":"X Boyen","year":"2010","unstructured":"Boyen X. Lattice mixing and vanishing trapdoors: A framework for fully secure short signatures and more. Lecture Notes in Computer Science, 2010, 6056: 499\u2013517","journal-title":"Lecture Notes in Computer Science"},{"issue":"4","key":"3163_CR13","first-page":"2112","volume":"25","author":"F Li","year":"2012","unstructured":"Li F, Muhaya F, Khan M, Takagi T. Lattice-based signcryption. Concurrency and Computation: Practice and Experience, 2012, 25(4): 2112\u20132122","journal-title":"Concurrency and Computation: Practice and Experience"},{"issue":"1","key":"3163_CR14","first-page":"23","volume":"6","author":"F Wang","year":"2012","unstructured":"Wang F, Hu Y, Wang C. Post-quantum secure hybrid signcryption from lattice assumption. Applied Mathematics & Information Sciences, 2012, 6(1): 23\u201328","journal-title":"Applied Mathematics & Information Sciences"},{"key":"3163_CR15","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume":"1070","author":"M Bellare","year":"1996","unstructured":"Bellare M, Rogaway P. The exact security of digital signatures-how to sign with rsa and rabin. Lecture Notes in Computer Science, 1996, 1070: 399\u2013416","journal-title":"Lecture Notes in Computer Science"},{"issue":"4","key":"3163_CR16","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R Canetti","year":"2004","unstructured":"Canetti R, Goldreich O, Halevi S. The random oracle methodology, revisited. Journal of the ACM. 2004, 51(4): 557\u2013594","journal-title":"Journal of the ACM"},{"key":"3163_CR17","first-page":"1","volume":"2013","author":"J Yan","year":"2013","unstructured":"Yan J, Wang L, Wang L, Yang Y, Yao W. Efficient lattice-based signcryption in standard model. Mathematical Problems in Engineering. 2013, 2013: 1\u201318","journal-title":"Mathematical Problems in Engineering"},{"key":"3163_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-48523-6_1","volume":"1644","author":"M Ajtai","year":"1999","unstructured":"Ajtai M. Generating hard instances of the short basis problem. Lecture Notes in Computer Science, 1999, 1644: 1\u20139","journal-title":"Lecture Notes in Computer Science"},{"key":"3163_CR19","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume":"6110","author":"S Agrawal","year":"2010","unstructured":"Agrawal S, Boneh D, Boyen X. Efficient lattice (h)ibe in the standard model. Lecture Notes in Computer Science, 2010, 6110: 553\u2013572","journal-title":"Lecture Notes in Computer Science"},{"key":"3163_CR20","first-page":"Report 2009\/359","volume-title":"Cryptology ePrint Archive","author":"C Peikert","year":"2009","unstructured":"Peikert C. Bonsai trees (or, arboriculture in lattice-based cryptography). Cryptology ePrint Archive. 2009: Report 2009\/359"},{"issue":"34","key":"3163_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O. On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM, 2009, 56(34): 1\u201340","journal-title":"Journal of the ACM"},{"issue":"1","key":"3163_CR22","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio D, Regev O. Worst-case to average-case reductions based on gaussian measures. SIAM Journal on Computing. 2007, 37(1): 267\u2013302","journal-title":"SIAM Journal on Computing"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-014-3163-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-014-3163-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-014-3163-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:01:19Z","timestamp":1559408479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-014-3163-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,26]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["3163"],"URL":"https:\/\/doi.org\/10.1007\/s11704-014-3163-1","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,26]]}}}