{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:40:42Z","timestamp":1759333242152},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319308395"},{"type":"electronic","value":"9783319308401"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-30840-1_5","type":"book-chapter","created":{"date-parts":[[2016,3,9]],"date-time":"2016-03-09T14:15:22Z","timestamp":1457532922000},"page":"69-84","source":"Crossref","is-referenced-by-count":1,"title":["Learning with Errors in the Exponent"],"prefix":"10.1007","author":[{"given":"\u00d6zg\u00fcr","family":"Dagdelen","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Gajek","sequence":"additional","affiliation":[]},{"given":"Florian","family":"G\u00f6pfert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,10]]},"reference":[{"key":"5_CR1","unstructured":"Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings, pp. 124\u2013134 (1994)"},{"key":"5_CR2","doi-asserted-by":"publisher","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":"5_CR3","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 84\u201393, 22\u201324 May 2005. ACM, Baltimore, MD, USA (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Regev, O.: The learning with errors problem (invited survey). In: IEEE Conference on Computational Complexity, pp. 191\u2013204. IEEE Computer Society (2010)","DOI":"10.1109\/CCC.2010.26"},{"key":"5_CR5","doi-asserted-by":"crossref","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, STOC 2009, pp. 333\u2013342. ACM, New York (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-03356-8_34","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"V Lyubashevsky","year":"2009","unstructured":"Lyubashevsky, V., Micciancio, D.: On bounded distance decoding, unique shortest vectors, and the minimum distance problem. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 577\u2013594. Springer, Heidelberg (2009)"},{"key":"5_CR7","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 45th Annual ACM Symposium on Symposium on Theory of Computing, pp. 575\u2013584. ACM (2013)","DOI":"10.1145\/2488608.2488680"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00145-012-9119-4","volume":"26","author":"J Katz","year":"2013","unstructured":"Katz, J., Sahai, A., Waters, B.: Predicate encryption supporting disjunctions, polynomial equations, and inner products. J. Cryptology 26, 191\u2013224 (2013)","journal-title":"J. Cryptology"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"5_CR10","unstructured":"Brands, S.A.: An efficient off-line electronic cash system based on the representation problem. Technical report, Amsterdam, The Netherlands (1993)"},{"key":"5_CR11","unstructured":"Shacham, H.: A Cramer-Shoup encryption scheme from the linear assumption and from progressively weaker linear variants. Cryptology ePrint Archive, Report 2007\/074 (2007). http:\/\/eprint.iacr.org\/"},{"key":"5_CR12","unstructured":"Dagdelen, O., Gajek, S., Gopfert, F.: Learning with errors in the exponent. Cryptology ePrint Archive, Report 2014\/826 (2014). http:\/\/eprint.iacr.org\/"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539703440678","volume":"33","author":"O Regev","year":"2004","unstructured":"Regev, O.: Quantum computation and lattice problems. SIAM J. Comput. 33, 738\u2013760 (2004)","journal-title":"SIAM J. Comput."},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-03356-8_2","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M Naor","year":"2009","unstructured":"Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 18\u201335. Springer, Heidelberg (2009)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-642-42045-0_21","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"S Agrawal","year":"2013","unstructured":"Agrawal, S., Dodis, Y., Vaikuntanathan, V., Wichs, D.: On continual leakage of discrete log representations. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 401\u2013420. Springer, Heidelberg (2013)"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-85174-5_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Halevi, S., Hamburg, M., Ostrovsky, R.: Circular-secure encryption from decision diffie-hellman. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 108\u2013125. Springer, Heidelberg (2008)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/978-3-642-10366-7_41","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"J Katz","year":"2009","unstructured":"Katz, J., Vaikuntanathan, V.: Signature schemes with bounded leakage resilience. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 703\u2013720. Springer, Heidelberg (2009)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-319-06734-6_22","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2014","author":"\u00d6 Dagdelen","year":"2014","unstructured":"Dagdelen, \u00d6., Venturi, D.: A second look at Fischlin\u2019s transformation. In: Pointcheval, D., Vergnaud, D. (eds.) AFRICACRYPT. LNCS, vol. 8469, pp. 356\u2013376. Springer, Heidelberg (2014)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-40084-1_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Escala","year":"2013","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.: An algebraic framework for Diffie-Hellman assumptions. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 129\u2013147. Springer, Heidelberg (2013)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44670-2_11","volume-title":"Cryptography and Lattices","author":"D Micciancio","year":"2001","unstructured":"Micciancio, D.: Improving lattice based cryptosystems using the Hermite normal form. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 126\u2013145. Springer, Heidelberg (2001)"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-03356-8_35","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Applebaum","year":"2009","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595\u2013618. Springer, Heidelberg (2009)"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011)"},{"key":"5_CR23","unstructured":"Goldwasser, S., Kalai, Y., Peikert, C., Vaikuntanathan, V.: Robustness of the learning with errors assumption. In: ICS, 2010, [GPV08] [GRS08] (2008)"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-45537-X_17","volume-title":"Selected Areas in Cryptography","author":"F Kuhn","year":"2001","unstructured":"Kuhn, F., Struik, R.: Random walks revisited: extensions of Pollard\u2019s Rho algorithm for computing multiple discrete logarithms. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 212\u2013229. Springer, Heidelberg (2001)"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s10207-004-0045-9","volume":"3","author":"Y Hitchcock","year":"2004","unstructured":"Hitchcock, Y., Montague, P., Carter, G., Dawson, E.: The efficiency of solving multiple discrete logarithm problems and the implications for the security of fixed elliptic curves. Int. J. Inf. Secur. 3, 86\u201398 (2004)","journal-title":"Int. J. Inf. Secur."},{"key":"5_CR26","unstructured":"Yun, A.: Generic hardness of the multiple discrete logarithm problem. Cryptology ePrint Archive, Report 2014\/637 (2014). http:\/\/eprint.iacr.org\/"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-11799-2_23","volume-title":"Theory of Cryptography","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Palacio, A., Segev, G.: Public-key cryptographic primitives provably as secure as subset sum. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 382\u2013400. Springer, Heidelberg (2010)"},{"key":"5_CR28","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)"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-38348-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"M Joye","year":"2013","unstructured":"Joye, M., Libert, B.: Efficient cryptosystems from 2 $$^k$$ k -th power residue symbols. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 76\u201392. Springer, Heidelberg (2013)"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S Pohlig","year":"1978","unstructured":"Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (corresp.). IEEE Trans. Inf. Theory 24, 106\u2013110 (1978)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30840-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T05:14:09Z","timestamp":1692249249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30840-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319308395","9783319308401"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30840-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}