{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:43:32Z","timestamp":1762004612444},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2014,9,17]],"date-time":"2014-09-17T00:00:00Z","timestamp":1410912000000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s11432-014-5147-z","type":"journal-article","created":{"date-parts":[[2014,9,17]],"date-time":"2014-09-17T16:56:52Z","timestamp":1410973012000},"page":"1-12","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Lattice-based key exchange on small integer solution problem"],"prefix":"10.1007","volume":"57","author":[{"given":"ShanBiao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yan","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Di","family":"Ma","sequence":"additional","affiliation":[]},{"given":"RongQuan","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,17]]},"reference":[{"key":"5147_CR1","first-page":"99","volume-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing","author":"M Ajtai","year":"1996","unstructured":"Ajtai M. Generating hard instances of lattice problems. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing. New York: ACM Press, 1996. 99\u2013108"},{"key":"5147_CR2","first-page":"236","volume":"3","author":"O Goldreich","year":"1996","unstructured":"Goldreich O, Goldwasser S, Halevi S. Collision-free hashing from lattice problems. ECCC, 1996, 3: 236\u2013241","journal-title":"ECCC"},{"key":"5147_CR3","first-page":"356","volume-title":"The 43rd Annual IEEE Symposium on Foundations of Computer Science","author":"D Micciancio","year":"2002","unstructured":"Micciancio D. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science. Vancouver: IEEE Press, 2002. 356\u2013365"},{"key":"5147_CR4","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology-CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert C, Vaikuntanathan V, Waters B. A framework for efficient and composable oblivious transfer. Advances in Cryptology-CRYPTO 2008. Berlin\/Heidelberg: Springer, 2008. 554\u2013571"},{"key":"5147_CR5","first-page":"284","volume-title":"Proceedings of the 29th Annual ACM Symposium on Theory of Computing","author":"M Ajtai","year":"1997","unstructured":"Ajtai M, Dwork C. A public-key cryptosystem with worst-case\/average-case equivalence. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing. New York: ACM Press, 1997. 284\u2013293"},{"key":"5147_CR6","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1145\/1039488.1039490","volume":"51","author":"O Regev","year":"2004","unstructured":"Regev O. New lattice-based cryptographic constructions. J ACM, 2004, 51: 899\u2013942","journal-title":"J ACM"},{"key":"5147_CR7","first-page":"84","volume-title":"Proceedings of the 37th Annual ACM Symposium on Theory of Computing","author":"O Regev","year":"2005","unstructured":"Regev O. On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing. New York: ACM Press, 2005. 84\u201393"},{"key":"5147_CR8","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. New York: ACM Press, 2008. 187\u2013196"},{"key":"5147_CR9","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. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York: ACM Press, 2009. 333\u2013342"},{"key":"5147_CR10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology-CT-RSA 2011","author":"R Lindner","year":"2011","unstructured":"Lindner R, Peikert C. Better key sizes (and attacks) for LWE-based encryption. Topics in Cryptology-CT-RSA 2011. Berlin\/Heidelberg: Springer, 2011. 319\u2013339"},{"key":"5147_CR11","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology-EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio D, Peikert C. Trapdoors for lattices: Simpler, tighter, faster, smaller. Advances in Cryptology-EUROCRYPT 2012. Berlin\/Heidelberg: Springer, 2012. 700\u2013718"},{"key":"5147_CR12","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. New York: ACM Press, 2008. 197\u2013206"},{"key":"5147_CR13","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"Advances in Cryptology-EUROCRYPT 2010","author":"D Cash","year":"2010","unstructured":"Cash D, Hofheinz D, Kiltz E, et al. Bonsai trees, or how to delegate a lattice basis. Advances in Cryptology-EUROCRYPT 2010. Berlin\/Heidelberg: Springer, 2010. 523\u2013552"},{"key":"5147_CR14","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/978-3-642-13013-7_29","volume-title":"Public Key Cryptography-PKC 2010","author":"X Boyen","year":"2010","unstructured":"Boyen X. Lattice mixing and vanishing trapdoors: A framework for fully secure short signatures and more. Public Key Cryptography-PKC 2010. Berlin\/Heidelberg: Springer, 2010. 499\u2013517"},{"key":"5147_CR15","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology-EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky V. Lattice signatures without trapdoors. Advances in Cryptology-EUROCRYPT 2012. Berlin\/Heidelberg: Springer, 2012. 738\u2013755"},{"key":"5147_CR16","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"Advances in Cryptology-EUROCRYPT 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal S, Boneh D, Boyen X. Efficient lattice (h)ibe in the standard model. Advances in Cryptology-EUROCRYPT 2010. Berlin\/Heidelberg: Springer, 2010. 553\u2013572"},{"key":"5147_CR17","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-642-14623-7_6","volume-title":"Advances in Cryptology-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. Advances in Cryptology-CRYPTO 2010. Berlin\/Heidelberg: Springer, 2010. 98\u2013115"},{"key":"5147_CR18","first-page":"169","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"C Gentry","year":"2009","unstructured":"Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. New York: ACM Press, 2009. 169\u2013178"},{"key":"5147_CR19","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/978-3-642-14623-7_7","volume-title":"Advances in Cryptology-CRYPTO 2010","author":"C Gentry","year":"2010","unstructured":"Gentry C. Toward basing fully homomorphic encryption on worst-case hardness. Advances in Cryptology-CRYPTO 2010. Berlin\/Heidelberg: Springer, 2010. 116\u2013137"},{"key":"5147_CR20","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology-CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski Z, Vaikuntanathan V. Fully homomorphic encryption from ring-LWE and security for key dependent messages. Advances in Cryptology-CRYPTO 2011. Berlin\/Heidelberg: Springer, 2011. 505\u2013524"},{"key":"5147_CR21","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/FOCS.2011.12","volume-title":"The 52nd Annual IEEE Symposium on Foundations of Computer Science","author":"Z Brakerski","year":"2011","unstructured":"Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from (standard) LWE. In: The 52nd Annual IEEE Symposium on Foundations of Computer Science. California: IEEE Press, 2011. 97\u2013106"},{"key":"5147_CR22","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/2090236.2090262","volume-title":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference","author":"Z Brakerski","year":"2012","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. New York: ACM Press, 2012. 309\u2013325"},{"key":"5147_CR23","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Lattice-based cryptography. Post-Quantum Cryptography","author":"D Micciancio","year":"2009","unstructured":"Micciancio D, Regev O. Lattice-based cryptography. Post-Quantum Cryptography. Berlin\/Heidelberg: Springer, 2009. 147\u2013191"},{"key":"5147_CR24","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, 2007, 37: 267\u2013302","journal-title":"SIAM J Comput"},{"key":"5147_CR25","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/978-3-540-45146-4_17","volume-title":"Advances in Cryptology-CRYPTO 2003","author":"D Micciancio","year":"2003","unstructured":"Micciancio D, Vadhan S P. Statistical zero-knowledge proofs with efficient provers: Lattice problems and more. Advances in Cryptology-CRYPTO 2003. Berlin\/Heidelberg: Springer, 2003. 282\u2013298"},{"key":"5147_CR26","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/978-3-540-78440-1_10","volume-title":"Public Key Cryptography-PKC 2008","author":"V Lyubashevsky","year":"2008","unstructured":"Lyubashevsky V. Lattice-based identification schemes secure under active attacks. Public Key Cryptography-PKC 2008. Berlin\/Heidelberg: Springer, 2008. 162\u2013179"},{"key":"5147_CR27","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/978-3-540-89255-7_23","volume-title":"Advances in Cryptology-ASIACRYPT 2008","author":"A Kawachi","year":"2008","unstructured":"Kawachi A, Tanaka K, Xagawa K. Concurrently secure identification schemes based on the worst-case hardness of lattice problems. Advances in Cryptology-ASIACRYPT 2008. Berlin\/Heidelberg: Springer, 2008. 372\u2013389"},{"key":"5147_CR28","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W, Hellman M. New directions in cryptography. IEEE Trans Inf Theory, 1976, 22: 644\u2013654","journal-title":"IEEE Trans Inf Theory"},{"key":"5147_CR29","first-page":"48","volume-title":"The decision diffie-hellman problem. Algorithmic Number Theory","author":"D Boneh","year":"1998","unstructured":"Boneh D. The decision diffie-hellman problem. Algorithmic Number Theory. Berlin\/Heidelberg: Springer, 1998. 48\u201363"},{"key":"5147_CR30","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-48329-2_21","volume-title":"Advances in Cryptology-CRYPTO\u201993","author":"M Bellare","year":"1994","unstructured":"Bellare M, Rogaway P. Entity authentication and key distribution. Advances in Cryptology-CRYPTO\u201993. Berlin\/Heidelberg: Springer, 1994. 232\u2013249"},{"key":"5147_CR31","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00124891","volume":"2","author":"W Diffie","year":"1992","unstructured":"Diffie W, Van Oorschot P C, Wiener M J. Authentication and authenticated key exchanges. Designs Codes Cryptogr, 1992, 2: 107\u2013125","journal-title":"Designs Codes Cryptogr"},{"key":"5147_CR32","first-page":"44","volume-title":"Advances in Cryptology-CRYPTO\u201991","author":"R Bird","year":"1992","unstructured":"Bird R, Gopal I, Herzberg A, et al. Systematic design of two-party authentication protocols. Advances in Cryptology-CRYPTO\u201991. Berlin\/Heidelberg: Springer, 1992. 44\u201361"},{"key":"5147_CR33","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BFb0028166","volume-title":"Security Protocols","author":"S Blake-Wilson","year":"1998","unstructured":"Blake-Wilson S, Menezes A. Entity authentication and authenticated key transport protocols employing asymmetric techniques. Security Protocols. Berlin\/Heidelberg: Springer, 1998. 137\u2013158"},{"key":"5147_CR34","first-page":"419","volume-title":"Proceedings of the 30th Annual ACM Symposium on Theory of Computing","author":"M Bellare","year":"1998","unstructured":"Bellare M, Canetti R, Krawczyk H. A modular approach to the design and analysis of authentication and key exchange protocols. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing. New York: ACM Press, 1998. 419\u2013428"},{"key":"5147_CR35","volume-title":"Analysis of key-exchange protocols and their use for building secure channels (full version)","author":"R Canetti","year":"2001","unstructured":"Canetti R, Krawczyk H. Analysis of key-exchange protocols and their use for building secure channels (full version). Cryptology ePrint Archive, Report 2001\/040, 2001. http:\/\/eprint.iacr.org\/040"},{"key":"5147_CR36","doi-asserted-by":"crossref","first-page":"2598","DOI":"10.1109\/TIT.2007.899532","volume":"53","author":"H G Hu","year":"2007","unstructured":"Hu H G, Hu L, Feng D G. On a class of pseudorandom sequences from elliptic curves over finite fields. IEEE Trans Info Theory, 2007, 53: 2598\u20132605","journal-title":"IEEE Trans Info Theory"},{"key":"5147_CR37","doi-asserted-by":"crossref","first-page":"2610","DOI":"10.1109\/TIT.2007.899553","volume":"53","author":"H G Hu","year":"2007","unstructured":"Hu H G, Feng D G. On quadratic bent functions in polynomial forms. IEEE Trans Info Theory, 2007, 53: 2610\u20132615","journal-title":"IEEE Trans Info Theory"},{"key":"5147_CR38","first-page":"181","volume":"2","author":"P Q Nguyen","year":"2008","unstructured":"Nguyen P Q, Vidick T. Sieve algorithms for the shortest vector problem are practical. J Math Crypt, 2008, 2: 181\u2013207","journal-title":"J Math Crypt"},{"key":"5147_CR39","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1145\/380752.380857","volume-title":"Proceedings of the 33rd Annual ACM Symposium on Theory of Computing","author":"M Ajtai","year":"2001","unstructured":"Ajtai M, Kumar R, Sivakumar D. A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. New York: ACM Press, 2001. 601\u2013610"},{"key":"5147_CR40","first-page":"1827","volume":"54","author":"D Su","year":"2011","unstructured":"Su D, L\u00fc K W. Paillier\u2019s trapdoor function hides \u0398(n) bits. Sci China: Info Sci, 2011, 54: 1827\u20131836","journal-title":"Sci China: Info Sci"},{"key":"5147_CR41","first-page":"263","volume-title":"Advances in Cryptology-INDOCRYPT","author":"D Su","year":"2009","unstructured":"Su D, L\u00fc K W. A new hard-core predicate of paillier\u2019s trapdoor function. Advances in Cryptology-INDOCRYPT. Berlin\/Heidelberg: Springer, 2009, 2009. 263\u2013271"},{"key":"5147_CR42","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/TSC.2011.51","volume":"6","author":"Y Zhu","year":"2013","unstructured":"Zhu Y, Ahn G-J, Hu H X, et al. Dynamic audit services for outsourced storages in clouds. IEEE Trans Services Comput, 2013, 6: 227\u2013238","journal-title":"IEEE Trans Services Comput"},{"key":"5147_CR43","doi-asserted-by":"crossref","first-page":"2138","DOI":"10.1109\/TIFS.2013.2287858","volume":"8","author":"Y Zhu","year":"2013","unstructured":"Zhu Y, Ahn G-J, Hu H X, et al. Role-based cryptosystem: A new cryptographic RBAC system based on role-key hierarchy. IEEE Trans Info Forensics and Security, 2013, 8: 2138\u20132153","journal-title":"IEEE Trans Info Forensics and Security"},{"key":"5147_CR44","doi-asserted-by":"crossref","first-page":"1702","DOI":"10.1109\/TIT.2010.2040887","volume":"56","author":"H G Hu","year":"2010","unstructured":"Hu H G, Gong G. New sets of zero or low correlation zone sequences via interleaving techniques. IEEE Trans Info Theory, 2010, 56: 1702\u20131713","journal-title":"IEEE Trans Info Theory"},{"key":"5147_CR45","doi-asserted-by":"crossref","first-page":"1158","DOI":"10.1109\/TIT.2011.2169297","volume":"58","author":"G Gong","year":"2012","unstructured":"Gong G, Tor H, Hu H G. A three-valued walsh transform from decimations of helleseth-gong sequences. IEEE Trans Info Theory, 2012, 58: 1158\u20131162","journal-title":"IEEE Trans Info Theory"},{"key":"5147_CR46","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1109\/TIT.2011.2176312","volume":"58","author":"G Gong","year":"2012","unstructured":"Gong G, Tor H, Hu H G, et al. On the dual of certain ternary weakly regular bent functions. IEEE Trans Info Theory, 2012, 58: 2237\u20132243","journal-title":"IEEE Trans Info Theory"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5147-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-014-5147-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-014-5147-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,17]],"date-time":"2022-04-17T08:14:58Z","timestamp":1650183298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-014-5147-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,17]]},"references-count":46,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["5147"],"URL":"https:\/\/doi.org\/10.1007\/s11432-014-5147-z","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,17]]}}}