{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T17:37:39Z","timestamp":1774892259058,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,1,11]],"date-time":"2014-01-11T00:00:00Z","timestamp":1389398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10207-014-0226-0","type":"journal-article","created":{"date-parts":[[2014,1,10]],"date-time":"2014-01-10T17:18:17Z","timestamp":1389374297000},"page":"305-314","source":"Crossref","is-referenced-by-count":5,"title":["Efficient verifiably encrypted signatures from lattices"],"prefix":"10.1007","volume":"13","author":[{"given":"Kee Sung","family":"Kim","sequence":"first","affiliation":[]},{"given":"Ik Rae","family":"Jeong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,11]]},"reference":[{"key":"226_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: Advanced in Cryptology\u2014CRYPTO 2010 LNCS, vol. 6223, pp. 98\u2013115 (2010)","DOI":"10.1007\/978-3-642-14623-7_6"},{"key":"226_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: EUROCRYPT\u201910, vol. 6110 of LNCS, pp. 553\u2013572 (2010)","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"226_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instance of lattice problems. In: STOC, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"key":"226_CR4","first-page":"75","volume":"09001","author":"J Alwen","year":"2009","unstructured":"Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. STACS 09001, 75\u201386 (2009)","journal-title":"STACS"},{"key":"226_CR5","doi-asserted-by":"crossref","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures (Extended Abstract). EUROCRYPT\u2019 98. LNCS, vol. 1403, pp. 591\u2013606. Springer, Heidelberg (1998)","DOI":"10.1007\/BFb0054156"},{"key":"226_CR6","unstructured":"Bao, F., Deng, R.H., Mao, W.: Efficient and practical fair exchange protocols with off-line TTP. In: IEEE Symposium on Security and Privacy, pp. 77\u201385. IEEE Computer Society (1998)"},{"key":"226_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: EUROCRYPT 2003, LNCS 2656, pp. 416\u2013432 (2003)","DOI":"10.1007\/3-540-39200-9_26"},{"key":"226_CR8","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Proceedings of the Eurocrypt 2010 (2010)","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"226_CR9","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Advances in Cryptology\u2014Crypto \u201986, volume 263 of LNCS, pp. 186\u2013194 (1987)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"226_CR10","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Katz, J., Vaikuntanathan, V.: A group signature scheme from lattice assumptions. In: ASIACRYPT\u2019 10, pp. 395\u2013412 (2010)","DOI":"10.1007\/978-3-642-17373-8_23"},{"key":"226_CR11","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C.V.: Vaikuntanathan trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"226_CR12","first-page":"465","volume":"2006","author":"S Lu","year":"2006","unstructured":"Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., Waters, B.: Sequential aggregate signatures and multisignatures without random oracles. Adv. Eurocrypt 2006, 465\u2013485 (2006)","journal-title":"Adv. Eurocrypt"},{"key":"226_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of Lattice Problems: A Cryptographic Perspective","author":"D Micciancio","year":"2002","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective, vol. 671. Kluwer Academic Publishers, Boston (2002)"},{"issue":"1","key":"226_CR14","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 J. Comput. (SICOMP) 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput. (SICOMP)"},{"key":"226_CR15","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Vadhan, S.P.: Statistical zero-knowledge proofs with efficient provers: lattice problems and more. In: Advances in Cryptology\u2014Crypto 2003, volume 2729 of LNCS, pp. 282\u2013298 (2003)","DOI":"10.1007\/978-3-540-45146-4_17"},{"key":"226_CR16","doi-asserted-by":"crossref","unstructured":"Nishimaki, R., Xagawa, K.: Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES, Public-Key Cryptography\u2014PKC 2013, Lecture Notes in Computer Science, volume 7778, pp. 405\u2013422 (2013)","DOI":"10.1007\/978-3-642-36362-7_25"},{"key":"226_CR17","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: STOC\u201909, pp. 333\u2013342 (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"226_CR18","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Journal of the ACM 56, Article 34 (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"226_CR19","doi-asserted-by":"crossref","unstructured":"R\u00fcckert, M., Schr\u00f6der, D.: Security of verifiably encrypted signatures and a construction without random oracles. In: Shacham, H., Waters, B. (eds.) Proceedings of Pairing 2009, volume 5671 of LNCS, pp. 17\u201334. Springer-Verlag (2009)","DOI":"10.1007\/978-3-642-03298-1_2"},{"key":"226_CR20","doi-asserted-by":"crossref","unstructured":"R\u00fcckert, M., Schneider, M., Schr\u00f6der, D.: Generic constructions for verifiably encrypted signatures without random oracles or nizks. In: ACNS, pp. 69\u201386 (2010)","DOI":"10.1007\/978-3-642-13708-2_5"},{"key":"226_CR21","doi-asserted-by":"crossref","unstructured":"R\u00fcckert, M.: Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles. In: PQCrypto\u201910, vol. 6061 of LNCS, pp. 182\u2013200 (2010)","DOI":"10.1007\/978-3-642-12929-2_14"},{"key":"226_CR22","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 J. Comput. 26, 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"226_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, F., Safavi-Naini, R., Susilo, W.: Eficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings, Progress in Indocrypt 2003, pp. 191\u2013204 (2003)","DOI":"10.1007\/978-3-540-24582-7_14"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-014-0226-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-014-0226-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-014-0226-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T05:50:53Z","timestamp":1565070653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-014-0226-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,11]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1007\/s10207-014-0226-0","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,11]]}}}