{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:21:04Z","timestamp":1761805264594},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540768999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76900-2_26","type":"book-chapter","created":{"date-parts":[[2007,11,4]],"date-time":"2007-11-04T20:38:44Z","timestamp":1194208724000},"page":"427-443","source":"Crossref","is-referenced-by-count":11,"title":["Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations"],"prefix":"10.1007","author":[{"given":"Ueli","family":"Maurer","sequence":"first","affiliation":[]},{"given":"Dominik","family":"Raub","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"26_CR1","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1145\/30401.30404","volume":"30","author":"N. Ahituv","year":"1987","unstructured":"Ahituv, N., Lapid, Y., Neumann, S.: Processing encrypted data. Communications of the ACM\u00a030(9), 777\u2013780 (1987)","journal-title":"Communications of the ACM"},{"key":"26_CR2","first-page":"30","volume":"260","author":"L. Babai","year":"1999","unstructured":"Babai, L., Beals, R.: A polynomial-time theory of black box groups I. London Mathematical Society Lecture Note Series\u00a0260, 30\u201364 (1999)","journal-title":"London Mathematical Society Lecture Note Series"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/3-540-68697-5_22","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"D. Boneh","year":"1996","unstructured":"Boneh, D., Lipton, R.J.: Algorithms for black-box fields and their application to cryptography (extended abstract). In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 283\u2013297. Springer, Heidelberg (1996)"},{"key":"26_CR4","first-page":"229","volume-title":"25th Annual Symposium on Foundations of Computer Science","author":"L. Babai","year":"1984","unstructured":"Babai, L., Szemer\u00e9di, E.: On the complexity of matrix group problems I. In: Babai, L. (ed.) 25th Annual Symposium on Foundations of Computer Science, pp. 229\u2013240. IEEE Computer Society Press, Los Alamitos (1984)"},{"key":"26_CR5","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory. Foundations of Computing\u00a01 (1996)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1006\/ffta.2000.0306","volume":"7","author":"E.. Bach","year":"2001","unstructured":"Bach, E., von zur Gathen, J., Lenstra Jr., H.W.: Factoring polynomials over special finite fields. Finite Fields and Their Applications\u00a07, 5\u201328 (2001)","journal-title":"Finite Fields and Their Applications"},{"issue":"5","key":"26_CR7","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W.. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022(5), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/3-540-45811-5_37","volume-title":"Information Security","author":"J.. Domingo-Ferrer","year":"2002","unstructured":"Domingo-Ferrer, J.: A provably secure additive and multiplicative privacy homomorphism. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol.\u00a02433, pp. 471\u2013483. Springer, Heidelberg (2002)"},{"issue":"193","key":"26_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.2307\/2008545","volume":"56","author":"H..W. Lenstra Jr.","year":"1991","unstructured":"Lenstra Jr., H.W.: Finding isomorphisms between finite fields. Mathematics of Computation\u00a056(193), 329\u2013347 (1991)","journal-title":"Mathematics of Computation"},{"key":"26_CR10","unstructured":"Lenstra Jr., H.W.: Personal Communication (2005)"},{"key":"26_CR11","volume-title":"Encyclopedia of Mathematics and its Applications","author":"R. Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. In: Encyclopedia of Mathematics and its Applications, 2nd edn., vol.\u00a020, Cambridge University Press, Cambridge (1997)","edition":"2"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/3-540-48658-5_26","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"U. Maurer","year":"1994","unstructured":"Maurer, U.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 271\u2013281. Springer, Heidelberg (1994)"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11586821_1","volume-title":"Cryptography and Coding 2005","author":"U. Maurer","year":"2005","unstructured":"Maurer, U.: Abstract models of computation in cryptography. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 1\u201312. Springer, Heidelberg (2005)"},{"issue":"5","key":"26_CR14","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1137\/S0097539796302749","volume":"28","author":"U. Maurer","year":"1999","unstructured":"Maurer, U., Wolf, S.: The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms. SIAM Journal on Computing\u00a028(5), 1689\u20131721 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"V. Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 256\u2013268. Springer, Heidelberg (1997)"},{"key":"26_CR16","first-page":"554","volume-title":"Proceedings of the 40th Symposium on Foundations of Computer Science (FOCS)","author":"T. Sander","year":"1999","unstructured":"Sander, T., Young, A., Yung, M.: Non-interactive CryptoComputing for NC\n                    1. In: Proceedings of the 40th Symposium on Foundations of Computer Science (FOCS), pp. 554\u2013567. IEEE Computer Society Press, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76900-2_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:46:01Z","timestamp":1619505961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76900-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540768999"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76900-2_26","relation":{},"subject":[]}}