{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T20:53:18Z","timestamp":1773262398648,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540716761","type":"print"},{"value":"9783540716778","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71677-8_28","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T18:05:58Z","timestamp":1182362758000},"page":"426-441","source":"Crossref","is-referenced-by-count":28,"title":["Efficient Pseudorandom Generators Based on the DDH Assumption"],"prefix":"10.1007","author":[{"given":"Reza Rezaeian","family":"Farashahi","sequence":"first","affiliation":[]},{"given":"Berry","family":"Schoenmakers","sequence":"additional","affiliation":[]},{"given":"Andrey","family":"Sidorenko","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Barker, E., Kelsey, J.: Recommendation for random number generation using deterministic random bit generators. NIST Special Publication (SP) 800-90 (December 2005)"},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing\u00a013(4), 850\u2013864 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR3","unstructured":"Brown, D.: Conjectured security of the ANSI-NIST Elliptic Curve RNG. Cryptology ePrint Archive, Report 2006 \/117 (2006), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/11745853_27","volume-title":"Public Key Cryptography - PKC 2006","author":"O. Chevassut","year":"2006","unstructured":"Chevassut, O., Fouque, P., Gaudry, P., Pointcheval, D.: The Twist-AUgmented Technique for Key Exchange. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 410\u2013426. Springer, Heidelberg (2006)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing, 167\u2013226 (2003)","DOI":"10.1137\/S0097539702403773"},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s001459910008","volume":"13","author":"R. Fischlin","year":"2000","unstructured":"Fischlin, R., Schnorr, C.P.: Stronger security proofs for RSA and Rabin bits. Journal of Cryptology\u00a013(2), 221\u2013244 (2000)","journal-title":"Journal of Cryptology"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/11787006_21","volume-title":"Automata, Languages and Programming","author":"P. Fouque","year":"2006","unstructured":"Fouque, P., Pointcheval, D., Stern, J., Zimmer, S.: Hardness of distinguishing the MSB or LSB of secret keys in Diffie-Hellman schemes. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 240\u2013251. Springer, Heidelberg (2006)"},{"issue":"2","key":"28_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00145-004-0215-y","volume":"18","author":"R. Gennaro","year":"2005","unstructured":"Gennaro, R.: An improved pseudo-random generator based on the discrete logarithm problem. Journal of Cryptology\u00a018(2), 91\u2013110 (2005)","journal-title":"Journal of Cryptology"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Krawczyk, H., Rabin, T.: Secure hashed Diffie-Hellman over non-DDH groups, Cryptology ePrint Archive, Report 2004\/099 (2004), \n                    \n                      http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-540-24676-3_22"},{"key":"28_CR10","unstructured":"Gj\u00f8steen, K.: Comments on Dual-EC-DRBG\/NIST SP 800-90, Draft, December 2005 (March 2006), \n                    \n                      http:\/\/www.math.ntnu.no\/~kristiag\/drafts\/dual-ec-drbg-comments.pdf"},{"key":"28_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of cryptography. Cambridge University Press, Cambridge (2001)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11818175_2","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I. Haitner","year":"2006","unstructured":"Haitner, I., Harnik, D., Reingold, O.: On the power of the randomized iterate. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 22\u201340. Springer, Heidelberg (2006)"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: Construction of a pseudo-random generator from any one-way function. SIAM Journal on Computing\u00a028, 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/11780656_22","volume-title":"Information Security and Privacy","author":"S. Jiang","year":"2006","unstructured":"Jiang, S.: Efficient primitives from exponentiation in \u2124\n                    p\n                  . In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol.\u00a04058, pp. 259\u2013270. Springer, Heidelberg (2006)"},{"issue":"3","key":"28_CR15","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/18.841170","volume":"46","author":"A. Juels","year":"2000","unstructured":"Juels, A., Jakobsson, M., Shriver, E., Hillyer, B.K.: How to turn loaded dice into fair coins. IEEE Transactions on Information Theory\u00a046(3), 911\u2013921 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"28_CR16","unstructured":"Kaliski, B.S.: Elliptic curves and cryptography: A pseudorandom bit generator and other tools, Ph.D. thesis, MIT, Cambridge, MA, USA (1988)"},{"key":"28_CR17","volume-title":"Seminumerical algorithms, vol. 3","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: Seminumerical algorithms, vol. 3, 3rd edn. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44598-6_1","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A.K. Lenstra","year":"2000","unstructured":"Lenstra, A.K., Verheul, E.R.: The XTR public key system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 1\u201319. Springer, Heidelberg (2000)"},{"issue":"4","key":"28_CR19","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A.K. Lenstra","year":"2001","unstructured":"Lenstra, A.K., Verheul, E.R.: Selecting cryptographic key sizes. Journal of Cryptology\u00a014(4), 255\u2013293 (2001)","journal-title":"Journal of Cryptology"},{"key":"28_CR20","volume-title":"Pseudorandomness and cryptographic applications","author":"M. Luby","year":"1994","unstructured":"Luby, M.: Pseudorandomness and cryptographic applications. Princeton University Press, Princeton (1994)"},{"key":"28_CR21","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.M. Maurer","year":"1994","unstructured":"Maurer, U.M.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete algorithms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 271\u2013281. Springer, Heidelberg (1994)"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-68697-5_21","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"U.M. Maurer","year":"1996","unstructured":"Maurer, U.M., Wolf, S.: Diffie-Hellman. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 268\u2013282. Springer, Heidelberg (1996)"},{"issue":"5","key":"28_CR23","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A. Menezes","year":"1993","unstructured":"Menezes, A., Okamoto, T., Vanstone, S.A.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory\u00a039(5), 1639\u20131646 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"28_CR24","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M. Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. Journal of the ACM\u00a051(2), 231\u2013262 (2004)","journal-title":"Journal of the ACM"},{"key":"28_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/BFb0055737","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"S. Patel","year":"1998","unstructured":"Patel, S., Sundaram, G.S.: An efficient discrete log pseudo random generator. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 304\u2013317. Springer, Heidelberg (1998)"},{"issue":"4","key":"28_CR26","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s001450010010","volume":"13","author":"J.M. Pollard","year":"2000","unstructured":"Pollard, J.M.: Kangaroos, monopoly and discrete logarithms. Journal of Cryptology\u00a013(4), 437\u2013447 (2000)","journal-title":"Journal of Cryptology"},{"key":"28_CR27","unstructured":"Schoenmakers, B., Sidorenko, A.: Cryptanalysis of the Dual Elliptic Curve pseudorandom generator, Cryptology ePrint Archive, Report 2006 \/190 (2006), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"28_CR28","first-page":"67","volume":"77","author":"R. Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS\u00a077, 67\u201395 (2002)","journal-title":"Bulletin of the EATCS"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Steinfeld, R., Pieprzyk, J., Wang, H.: On the provable security of an efficient RSA-based pseudorandom generator, Cryptology ePrint Archive, Report 2006 \/206 (2006), \n                    \n                      http:\/\/eprint.iacr.org\/","DOI":"10.1007\/11935230_13"},{"key":"28_CR30","unstructured":"Wolf, S.: Information-theoretically and computationally secure key agreement in cryptography, Ph.D. thesis, ETH Zurich (1999)"},{"key":"28_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-540-24632-9_20","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"F. Zhang","year":"2004","unstructured":"Zhang, F., Safavi-Naini, R., Susilo, W.: An efficient signature scheme from bilinear pairings and its applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 277\u2013290. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71677-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:40:55Z","timestamp":1558273255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71677-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540716761","9783540716778"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71677-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}