{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:40:04Z","timestamp":1737502804569,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_31","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"294-303","source":"Crossref","is-referenced-by-count":2,"title":["Complexity Theoretic Aspects of Some Cryptographic Functions"],"prefix":"10.1007","author":[{"given":"Eike","family":"Kiltz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans Ulrich","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(83)90029-4","volume":"28","author":"N. Blum","year":"1984","unstructured":"N. Blum. A Boolean function requiring 3n network size. Theoretical Computer Science, 28(3):337\u2013345, February 1984.","journal-title":"Theoretical Computer Science"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"D. Catalano, R. Gennaro, N. Howgrave-Graham, and P. Q. Nguyen. Paillier\u2019s cryptosystem revisited. In Proceedings of the 8th ACM Conference on Computer and Communications Security, pages 206\u2013214, 2001.","DOI":"10.1145\/502010.502012"},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s001450010002","volume":"13","author":"D. Coppersmith","year":"2000","unstructured":"D. Coppersmith and I. Shparlinski. On polynomial approximation of the Discrete Logarithm and the Diffie-Hellman mapping. Journal of Cryptology, 13(3):339\u2013360, March 2000.","journal-title":"Journal of Cryptology"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"J. Forster. A linear lower bound on the unbounded error probabilistic communication complexity. In Proceedings of the Sithteenth Annual Conference on Computational Complexity, pages 100\u2013106. IEEE Computer Society, 2001.","DOI":"10.1109\/CCC.2001.933877"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"J. Forster, M. Krause, S. V. Lokam, R. Mubarakzjanov, N. Schmitt, and H. U. Simon. Relations between communication complexity, linear arrangements, and computational complexity. In Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science, pages 171\u2013182, 2001.","DOI":"10.1007\/3-540-45294-X_15"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. Advances in Cryptology\u2014CRYPTO\u2019 84, pages 10\u201318, 1984.","DOI":"10.1007\/3-540-39568-7_2"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"E. Kiltz. On the representation of boolean predicates of the Diffie-Hellman function. In Proc. of 20th International Symposium on Theoretical Aspects of Computer Science STACS, pages 223\u2013233, 2003.","DOI":"10.1007\/3-540-36494-3_21"},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/0022-0000(86)90046-2","volume":"33","author":"R. Paturi","year":"1986","unstructured":"R. Paturi and J. Simon. Probabilistic communication complexity. Journal of Computer and System Sciences, 33(1):106\u2013123, 1986.","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"D. Pointcheval. New public key cryptosystems based on the dependent \u2014 RSA problems. Lecture Notes in Computer Science, 1592:239\u2013254, 1999.","DOI":"10.1007\/3-540-48910-X_17"},{"key":"31_CR10","volume-title":"Primzahlverteilung","author":"K. Prachar","year":"1957","unstructured":"K. Prachar. Primzahlverteilung. Springer-Verlag, Berlin, 1957."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"I. E. Shparlinski. Cryptographic Application of Analytic Number Theory. Birkh\u00e4user Verlag, 2002.","DOI":"10.1007\/978-3-0348-8037-4"},{"key":"31_CR12","unstructured":"I. M. Vinogradov. Elements of number theory. Dover Publications., 1954."},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1017\/S0004972700019936","volume":"64","author":"A. Winterhof","year":"2001","unstructured":"A. Winterhof. A note on the interpolation of the Diffie-Hellman mapping. In Bulletin of the Australian Mathematical Society, volume 64, pages 475\u2013477, 2001.","journal-title":"Bulletin of the Australian Mathematical Society"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1012556500517","volume":"25","author":"A. Winterhof","year":"2002","unstructured":"A. Winterhof. Polynomial interpolation of the discrete logarithm. Designs, Codes and Cryptography, 25:63\u201372, 2002.","journal-title":"Designs, Codes and Cryptography"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:25:40Z","timestamp":1737501940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}