{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:10:35Z","timestamp":1763968235544},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319531762"},{"type":"electronic","value":"9783319531779"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53177-9_3","type":"book-chapter","created":{"date-parts":[[2017,2,8]],"date-time":"2017-02-08T04:35:07Z","timestamp":1486528507000},"page":"51-74","source":"Crossref","is-referenced-by-count":18,"title":["A Practical Post-Quantum Public-Key Cryptosystem Based on $$\\textsf {spLWE}$$"],"prefix":"10.1007","author":[{"given":"Jung Hee","family":"Cheon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyoohyung","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinsu","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changmin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongha","family":"Son","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,9]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 99\u2013108. ACM (1996)","key":"3_CR1","DOI":"10.1145\/237814.237838"},{"doi-asserted-by":"crossref","unstructured":"Albrecht, M., Cid, C., Faugere, J.C., Fitzpatrick, R., Perret, L.: Algebraic algorithms for LWE problems, Jean-Charles Faugere (2014)","key":"3_CR2","DOI":"10.1145\/2815111.2815158"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-319-12160-4_18","volume-title":"Information Security and Cryptology \u2013 ICISC 2013","author":"MR Albrecht","year":"2014","unstructured":"Albrecht, M.R., Fitzpatrick, R., G\u00f6pfert, F.: On the efficacy of solving LWE by reduction to unique-SVP. In: Lee, H.S., Han, D.G. (eds.) ICISC 2013. LNCS, vol. 8565, pp. 293\u2013310. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-12160-4_18"},{"issue":"3","key":"3_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015)","journal-title":"J. Math. Cryptol."},{"unstructured":"Alkim, E., Ducas, L., Poppelmann, T., Schwabe, P.: Post-quantum key exchange-a new hope. Technical report, Cryptology ePrint Archive, Report 2015\/1092 (2015). http:\/\/eprint.iacr.org","key":"3_CR5"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-22006-7_34","volume-title":"Automata, Languages and Programming","author":"S Arora","year":"2011","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 403\u2013415. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22006-7_34"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-04852-9_2","volume-title":"Topics in Cryptology \u2013 CT-RSA 2014","author":"S Bai","year":"2014","unstructured":"Bai, S., Galbraith, S.D.: An improved compression technique for signatures based on learning with errors. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, vol. 8366, pp. 28\u201347. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-04852-9_2"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-319-08344-5_21","volume-title":"Information Security and Privacy","author":"S Bai","year":"2014","unstructured":"Bai, S., Galbraith, S.D.: Lattice decoding attacks on binary LWE. In: Susilo, W., Mu, Y. (eds.) ACISP 2014. LNCS, vol. 8544, pp. 322\u2013337. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-08344-5_21"},{"issue":"2","key":"3_CR9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF02574039","volume":"13","author":"W Banaszczyk","year":"1995","unstructured":"Banaszczyk, W.: Inequalities for convex bodies and polar reciprocal lattices in R $$^{\\rm n}$$ . Discrete Comput. Geom. 13(2), 217\u2013231 (1995)","journal-title":"Discrete Comput. Geom."},{"doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, pp. 10\u201324 (2016)","key":"3_CR10","DOI":"10.1137\/1.9781611974331.ch2"},{"doi-asserted-by":"crossref","unstructured":"Bos, J., Costello, C., Ducas, L., Mironov, I., Naehrig, M., Nikolaenko, V., Raghunathan, A., Stebila, D.: Frodo: take off the ring! practical, quantum-secure key exchange from LWE (2016)","key":"3_CR11","DOI":"10.1145\/2976749.2978425"},{"doi-asserted-by":"crossref","unstructured":"Bos, J.W., Costello, C., Naehrig, M., Stebila, D.: Post-quantum key exchange for the TLS protocol from the ring learning with errors problem. In: 2015 IEEE Symposium on Security and Privacy, pp. 553\u2013570. IEEE (2015)","key":"3_CR12","DOI":"10.1109\/SP.2015.40"},{"doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 575\u2013584. ACM (2013)","key":"3_CR13","DOI":"10.1145\/2488608.2488680"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-319-31517-1_2","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2016","author":"J Buchmann","year":"2016","unstructured":"Buchmann, J., G\u00f6pfert, F., Player, R., Wunderer, T.: On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack. In: Pointcheval, D., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2016. LNCS, vol. 9646, pp. 24\u201343. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-31517-1_2"},{"unstructured":"Chen, Y.: R\u00e9duction de r\u00e9seau et s\u00e9curit\u00e9 concr\u00e9te du chiffrement compl\u00e9tement homomorphe. Ph.D. thesis, ENS-Lyon, France (2013)","key":"3_CR15"},{"unstructured":"Cheon, J.H., Jeong, J., Lee, C.: An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low level encoding of zero. Cryptology ePrint Archive, Report 2016\/139 (2016). http:\/\/eprint.iacr.org\/2016\/139","key":"3_CR16"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-16295-9_5","volume-title":"Progress in Cryptology - LATINCRYPT 2014","author":"\u00d6 Dagdelen","year":"2015","unstructured":"Dagdelen, \u00d6., Bansarkhani, R., G\u00f6pfert, F., G\u00fcneysu, T., Oder, T., P\u00f6ppelmann, T., S\u00e1nchez, A.H., Schwabe, P.: High-speed signatures from standard lattices. In: Aranha, D.F., Menezes, A. (eds.) LATINCRYPT 2014. LNCS, vol. 8895, pp. 84\u2013103. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-16295-9_5"},{"unstructured":"Daniel, A., Lejla, B. et al.: Initial recommendations of long-term secure post-quantum systems, Technical report (2015). http:\/\/pqcrypto.eu.org\/docs\/initial-recommendations.pdf","key":"3_CR18"},{"doi-asserted-by":"crossref","unstructured":"De Clercq, R., Roy, S.S., Vercauteren, F., Verbauwhede, I.: Efficient software implementation of ring-LWE encryption. In: Proceedings of the 2015 Design, Automation and Test in Europe Conference and Exhibition, pp. 339\u2013344, EDA Consortium (2015)","key":"3_CR19","DOI":"10.7873\/DATE.2015.0378"},{"unstructured":"De Meyer, L.: Security of LWE-based cryptosystems (2015)","key":"3_CR20"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-662-46800-5_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A Duc","year":"2015","unstructured":"Duc, A., Tram\u00e8r, F., Vaudenay, S.: Better algorithms for LWE and LWR. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 173\u2013202. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46800-5_8"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-40041-4_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"L Ducas","year":"2013","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal gaussians. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 40\u201356. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40041-4_3"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-662-43414-7_3","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"R Bansarkhani","year":"2014","unstructured":"Bansarkhani, R., Buchmann, J.: Improvement and efficient implementation of a lattice-based signature scheme. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 48\u201367. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-43414-7_3"},{"unstructured":"Galbraith, S.D.: Space-efficient variants of cryptosystems based on learning with errors (2013). https:\/\/www.math.auckland.ac.nz\/~sgal018\/compact-LWE.pdf","key":"3_CR24"},{"doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 197\u2013206. ACM (2008)","key":"3_CR25","DOI":"10.1145\/1374376.1374407"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-642-33027-8_30","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"N G\u00f6ttert","year":"2012","unstructured":"G\u00f6ttert, N., Feller, T., Schneider, M., Buchmann, J., Huss, S.: On the design of hardware building blocks for modern lattice-based encryption schemes. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 512\u2013529. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33027-8_30"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-642-33027-8_31","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"T G\u00fcneysu","year":"2012","unstructured":"G\u00fcneysu, T., Lyubashevsky, V., P\u00f6ppelmann, T.: Practical lattice-based cryptography: a signature scheme for embedded systems. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 530\u2013547. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33027-8_31"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-662-47989-6_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"Q Guo","year":"2015","unstructured":"Guo, Q., Johansson, T., Stankovski, P.: Coded-BKW: solving LWE using lattice codes. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 23\u201342. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-47989-6_2"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-22792-9_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Hanrot","year":"2011","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 447\u2013464. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22792-9_25"},{"unstructured":"Chen, H., Lauter, K., Stange, K.E.: Attacks on search RLWE. Cryptology ePrint Archive, Report 2015\/971 (2015). http:\/\/eprint.iacr.org\/2015\/971","key":"3_CR30"},{"unstructured":"Chen, H., Lauter, K., Stange, K.E.: Vulnerable galois rlwe families and improved attacks. Cryptology ePrint Archive, Report 2016\/193 (2016). http:\/\/eprint.iacr.org\/2016\/193","key":"3_CR31"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithmic Number Theory","year":"1998","unstructured":"Buhler, J.P. (ed.): ANTS 1998. LNCS, vol. 1423. Springer, Heidelberg (1998)"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-662-47989-6_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"P Kirchner","year":"2015","unstructured":"Kirchner, P., Fouque, P.-A.: An improved BKW algorithm for LWE with applications to cryptography and lattices. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 43\u201362. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-47989-6_3"},{"unstructured":"Laarhoven, T.: Search problems in cryptography, Ph.D. thesis, Eindhoven University of Technology (2015). http:\/\/www.thijs.com\/docs\/phd-final.pdf.8","key":"3_CR34"},{"unstructured":"Laarhoven, T.: Sieving for closest lattice vectors (with preprocessing). arXiv preprint (2016). arXiv:1607.04789","key":"3_CR35"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-662-48324-4_33","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2015","author":"Z Liu","year":"2015","unstructured":"Liu, Z., Seo, H., Sinha Roy, S., Gro\u00dfsch\u00e4dl, J., Kim, H., Verbauwhede, I.: Efficient ring-LWE encryption on 8-Bit AVR processors. In: G\u00fcneysu, T., Handschuh, H. (eds.) CHES 2015. LNCS, vol. 9293, pp. 663\u2013682. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48324-4_33"},{"key":"3_CR37","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). doi: 10.1007\/978-3-642-13190-5_1"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: A toolkit for ring-LWE cryptography. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 35\u201354. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38348-9_3"},{"unstructured":"Albrecht, M., Bai, S., Ducas, L.: A subfield lattice attack on overstretched NTRU assumptions: cryptanalysis of some FHE and graded encoding schemes. Cryptology ePrint Archive, Report 2016\/127 (2016). http:\/\/eprint.iacr.org\/2016\/127","key":"3_CR39"},{"key":"3_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29011-4_41"},{"unstructured":"NIST. Technical report (2015). http:\/\/www.nist.gov\/itl\/csd\/ct\/post-quantum-crypto-workshop-2015.cfm","key":"3_CR41"},{"unstructured":"NSA. Cryptography today. Technical report (2015). https:\/\/www.nsa.gov\/ia\/programs\/suitebcryptography\/ , Also at: https:\/\/www.iad.gov\/iad\/programs\/iad-initiatives\/cnsa-suite.cfm","key":"3_CR42"},{"key":"3_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-11659-4_12","volume-title":"Post-Quantum Cryptography","author":"C Peikert","year":"2014","unstructured":"Peikert, C.: Lattice cryptography for the internet. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 197\u2013219. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-11659-4_12"},{"key":"3_CR44","doi-asserted-by":"crossref","DOI":"10.1561\/9781680831139","volume-title":"Decade of Lattice Cryptography","author":"C Peikert","year":"2016","unstructured":"Peikert, C., et al.: Decade of Lattice Cryptography. World Scientific, Singapore (2016)"},{"issue":"6","key":"3_CR45","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1137\/080733954","volume":"40","author":"C Peikert","year":"2011","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. SIAM J. Comput. 40(6), 1803\u20131844 (2011)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, ACM, pp. 84\u201393 (2005)","key":"3_CR46","DOI":"10.1145\/1060590.1060603"},{"issue":"6","key":"3_CR47","doi-asserted-by":"crossref","first-page":"34","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. J. ACM (JACM) 56(6), 34 (2009)","journal-title":"J. ACM (JACM)"},{"key":"3_CR48","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). doi: 10.1007\/978-3-642-19074-2_21"},{"key":"3_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-662-44709-3_21","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"SS Roy","year":"2014","unstructured":"Roy, S.S., Vercauteren, F., Mentens, N., Chen, D.D., Verbauwhede, I.: Compact ring-LWE cryptoprocessor. In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 371\u2013391. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-44709-3_21"},{"key":"3_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","volume-title":"STACS 2003","author":"CP Schnorr","year":"2003","unstructured":"Schnorr, C.P.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 145\u2013156. Springer, Heidelberg (2003). doi: 10.1007\/3-540-36494-3_14"},{"unstructured":"Singh, V.: A practical key exchange for the internet using lattice cryptography. IACR Cryptology ePrint Archive, p. 138 (2015)","key":"3_CR51"},{"doi-asserted-by":"crossref","unstructured":"Targhi, E.E., Unruh, D.: Quantum security of the fujisaki-okamoto transform. Technical report (2015)","key":"3_CR52","DOI":"10.1007\/978-3-662-53644-5_8"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53177-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T01:52:48Z","timestamp":1601603568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53177-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319531762","9783319531779"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53177-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}