{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:43Z","timestamp":1740122623936,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61171072"],"award-info":[{"award-number":["61171072"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Science & Technology Innovation Projects of Shenzhen","award":["ZDSYS20140430164957660"],"award-info":[{"award-number":["ZDSYS20140430164957660"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s11277-017-3979-8","type":"journal-article","created":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T10:54:24Z","timestamp":1485946464000},"page":"2973-2988","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Chosen-Ciphertext Secure Encryption from R-LWE"],"prefix":"10.1007","volume":"95","author":[{"given":"Ting","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoqiang","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqiang","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,1]]},"reference":[{"key":"3979_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M. & Dwork C. (1997). A public-key cryptosystem with worst-case\/average-case equivalence. In Proceedings of the 29th ACM Symposium on Theory of Computing (STOC) (pp. 284\u2013293). El Paso, TX, USA.","DOI":"10.1145\/258533.258604"},{"key":"3979_CR2","doi-asserted-by":"crossref","unstructured":"Regev, O. (2005). On lattices, learning with errors, random linear codes, and cryptography. In Proceedings of the of 37th ACM Symposium on Theory of Computing (STOC) (pp. 84\u201393). May 22\u201324.","DOI":"10.1145\/1060590.1060603"},{"key":"3979_CR3","doi-asserted-by":"crossref","unstructured":"Peikert, C. (2009). Public-key cryptosystems from the worst-case shortest vector problem. In Proceedings of 41th ACM Symposium on Theory of Computing (STOC) (pp. 333\u2013342). May 31\u2013June 2.","DOI":"10.1145\/1536414.1536461"},{"key":"3979_CR4","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C. & Vaikuntanathan, V. (2008). Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of the 40th ACM Symposium on Theory of Computing (STOC) (pp. 197\u2013206). May 17\u201320.","DOI":"10.1145\/1374376.1374407"},{"key":"3979_CR5","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E. & Peikert, C. (2010). Bonsai trees, or how to delegate a lattice basis. In Proceedings of the 29th International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (pp. 523\u2013552). May 30\u2013June 3.","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"3979_CR6","doi-asserted-by":"crossref","unstructured":"Klivans, A. R. & Sherstov, A. A. (2006). Cryptographic hardness for learning intersections of halfspaces. In Proceedings of the 47th Symposium on Foundations of Computer Science (FOCS) (pp. 553\u2013562). October 21\u201324.","DOI":"10.1109\/FOCS.2006.24"},{"key":"3979_CR7","doi-asserted-by":"crossref","unstructured":"Peikert, C., Vaikuntanathan, V. & Waters, B. (2008). A framework for efficient and composable oblivious transfer. In Proceedings of the 28th International Cryptology Conference (CRYPTO) (pp. 554\u2013571). August 17\u201321.","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"3979_CR8","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S. & Vaikuntanathan, V. (2009). Simultaneous hardcore bits and cryptography against memory attacks. In Proceedings of the 6th Theory of Cryptography Conference (TCC) (pp. 474\u2013495). March 15\u201317.","DOI":"10.1007\/978-3-642-00457-5_28"},{"key":"3979_CR9","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D. & Boyen, X. (2010). Efficient lattice (H) IBE in the standard model. In Proceedings of the 29th International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (pp. 553\u2013572). May 30\u2013June 3.","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"3979_CR10","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C. & Regev, O. (2010). On ideal lattices and learning with errors over rings. In Proceedings of the 29th International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (pp. 1\u201323). May 30\u2013June 3.","DOI":"10.1007\/978-3-642-13190-5_1"},{"issue":"8","key":"3979_CR11","first-page":"3911","volume":"10","author":"W Ting","year":"2016","unstructured":"Ting, W., Jianping, Y., Peng, Z., & Yong, Z. (2016). Efficient signature schemes from R-LWE. KSII Transactions on Internet and Information Systems, 10(8), 3911\u20133924.","journal-title":"KSII Transactions on Internet and Information Systems"},{"key":"3979_CR12","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V. (2011). Fully homomorphic encryption from ring-LWE and security for key dependent messages. In Proceedings of the 31th Annual International Cryptology Conference on Advances in Cryptology, August (pp. 505\u2013524).","DOI":"10.1007\/978-3-642-22792-9_29"},{"issue":"2","key":"3979_CR13","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1007\/s11277-013-1335-1","volume":"74","author":"W Ting","year":"2014","unstructured":"Ting, W., Jianping, Y., Peng, Z., & Xuan, X. (2014). Efficient linear homomorphic encryption from LWE over rings [J]. Wireless Personal Communications, 74(2), 1005\u20131016.","journal-title":"Wireless Personal Communications"},{"issue":"2","key":"3979_CR14","first-page":"23","volume":"34","author":"X Yang","year":"2013","unstructured":"Yang, X., Wu, L., Zhang, M., & Zhang, W. (2013). Public-key encryption scheme based on R-LWE. Journal on Communications, 34(2), 23\u201330.","journal-title":"Journal on Communications"},{"issue":"2","key":"3979_CR15","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., & Naor, M. (2000). Non-malleable cryptography. SIAM Journal on Computing, 30(2), 391\u2013437.","journal-title":"SIAM Journal on Computing"},{"key":"3979_CR16","doi-asserted-by":"crossref","unstructured":"Naor, M. & Yung, M. (1990). Public-Key Cryptosystems provably-secure against chosen-ciphertext attacks. In Proceedings of the 22nd ACM Symposium on Theory of Computing (STOC) (pp. 427\u2013437). May 13\u201317.","DOI":"10.1145\/100216.100273"},{"issue":"1","key":"3979_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U Feige","year":"1999","unstructured":"Feige, U., Lapidot, D., & Shamir, A. (1999). Multiple non-interactive zero-knowledge proofs under general assumptions. SIAM Journal on Computing, 29(1), 1\u201328.","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"3979_CR18","first-page":"915","volume":"36","author":"D Boneh","year":"2006","unstructured":"Boneh, D., Canetti, R., Halevi, S., & Katz, J. (2006). Chosen-ciphertext security from identity-based encryption. SIAM Journal on Computing, 36(5), 915\u2013942.","journal-title":"SIAM Journal on Computing"},{"key":"3979_CR19","unstructured":"Alwen, J. & Peikert, C. (2009). Generating shorter bases for hard random lattices. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 75\u201386). February 26\u201328."},{"key":"3979_CR20","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V. (2012). Lattice signatures without trapdoors. In Proceedings of 31th International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (pp. 738\u2013755). April 15\u201319.","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"3979_CR21","unstructured":"Shoup, V. (2010). NTL: A library for doing number theory. \n                        http:\/\/shoup.net\/ntl\/\n                        \n                    , Version 5.5.2, 2010."},{"key":"3979_CR22","doi-asserted-by":"crossref","unstructured":"Bellare, M., Desai, A., Pointcheval, D. & Rogaway, P. (1998). Relations among notions of security for public-key encryption schemes. In Proceedings of the 18th International Cryptology Conference (CRYPTO) (pp. 26\u201345). August 23\u201327.","DOI":"10.1007\/BFb0055718"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-017-3979-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-3979-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-017-3979-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T05:39:07Z","timestamp":1501479547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-017-3979-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,1]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["3979"],"URL":"https:\/\/doi.org\/10.1007\/s11277-017-3979-8","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2017,2,1]]}}}