{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:12:02Z","timestamp":1773234722391,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,9,30]],"date-time":"2009-09-30T00:00:00Z","timestamp":1254268800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s10623-009-9329-4","type":"journal-article","created":{"date-parts":[[2009,9,29]],"date-time":"2009-09-29T02:05:42Z","timestamp":1254189942000},"page":"45-64","source":"Crossref","is-referenced-by-count":6,"title":["More efficient DDH pseudorandom generators"],"prefix":"10.1007","volume":"55","author":[{"given":"Hongsong","family":"Shi","sequence":"first","affiliation":[]},{"given":"Shaoquan","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Zhiguang","family":"Qin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,30]]},"reference":[{"issue":"2","key":"9329_CR1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"Alexi W., Chor B., Goldreich O., Schnorr C.: RSA and Rabin functions: certain parts are as hard as the whole. SIAM J. Comput. 17(2), 194\u2013209 (1988)","journal-title":"SIAM J. Comput."},{"key":"9329_CR2","doi-asserted-by":"crossref","unstructured":"Bellare M., Boldyreva A., Micali S.: Public-key encryption in a multi-user setting: security proofs and improvements. In: Advances in Cryptology-EUROCRYPT\u201900. LNCS, vol. 1807, pp. 259\u2013274 (2000).","DOI":"10.1007\/3-540-45539-6_18"},{"issue":"11","key":"9329_CR3","doi-asserted-by":"crossref","first-page":"3927","DOI":"10.1109\/TIT.2007.907471","volume":"53","author":"M. Bellare","year":"2007","unstructured":"Bellare M., Boldyreva A., Kurosawa K., Staddon J.: Multi-recipient encryption schemes: efficient constructions and their security. IEEE Trans. Inform. Theory 53(11), 3927\u20133943 (2007)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9329_CR4","doi-asserted-by":"crossref","unstructured":"Berbain C., Gilbert H., Patarin J.: QUAD: a practical stream cipher with provable security. In: Advances in Cryptology-EUROCRYPT 2006. LNCS, vol. 4004, pp. 109\u2013128 (2006).","DOI":"10.1007\/11761679_8"},{"issue":"4","key":"9329_CR5","doi-asserted-by":"crossref","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 pseudorandom bits. SIAM J. Comput. 13(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9329_CR6","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum L., Blum M., Shub M.: A Simple unpredictable pseudorandom number generator. SIAM J. Comput. 15(2), 364\u2013383 (1986)","journal-title":"SIAM J. Comput."},{"key":"9329_CR7","doi-asserted-by":"crossref","unstructured":"Boneh D.: The decision Diffie\u2013Hellman problem. In: The Third Algorithmic Number Theory Symposium. LNCS, vol. 1423, pp. 48\u201363 (1998).","DOI":"10.1007\/BFb0054851"},{"key":"9329_CR8","doi-asserted-by":"crossref","unstructured":"Boneh D., Halevi S., Howgrave-Graham N.A.: The modular inversion hidden number problem. In: Advances in Cryptology-ASIACRYPT 2001. LNCS, vol. 2248, pp. 36\u201351 (2001).","DOI":"10.1007\/3-540-45682-1_3"},{"key":"9329_CR9","unstructured":"Chevassut O., Fouque P.A., Gaudry P., Pointcheval D.: Key derivation and randomness extraction. Cryptology ePrint archive. Report 2005\/061 (2005). http:\/\/eprint.iacr.org\/2005\/061.pdf ."},{"issue":"6","key":"9329_CR10","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie W., Hellman M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9329_CR11","unstructured":"Farashahi R.R., Schoenmakers B., Sidorenko A.: Efficient pseudo-random generators based on the DDH assumption. In: PKC 2007. LNCS, vol. 4450, pp. 426\u2013441 (2007)."},{"issue":"2","key":"9329_CR12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s001459910008","volume":"13","author":"R. Fischlin","year":"2000","unstructured":"Fischlin R., Schnorr C.: Stronger security proofs for RSA and Rabin bits. J. Cryptol. 13(2), 221\u2013244 (2000)","journal-title":"J. Cryptol."},{"issue":"2","key":"9329_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00145-004-0215-y","volume":"18","author":"R. Gennaro","year":"2006","unstructured":"Gennaro R.: An improved pseudo-random generator based on the discrete logarithm problem. J. Cryptol. 18(2), 91\u2013110 (2006)","journal-title":"J. Cryptol."},{"issue":"4","key":"9329_CR14","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich O., Goldwasser S., Micali S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"issue":"2","key":"9329_CR15","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s00145-002-0038-7","volume":"16","author":"O. Goldreich","year":"2003","unstructured":"Goldreich O., Rosen V.: On the security of modular exponentiation with application to the construction of pseudorandom generators. J. Cryptol. 16(2), 71\u201393 (2003)","journal-title":"J. Cryptol."},{"key":"9329_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich O., Wigderson A.: Tiny family of functions with random properties: a quality-size tradeoff forhashing. In: ACM STOC\u201994. pp. 574\u2013584 (1994).","DOI":"10.1145\/195058.195410"},{"key":"9329_CR17","unstructured":"Goldwasser S., Micali S.: probabilistic encryptions. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984). Priliminary version appears in STOC\u201982."},{"key":"9329_CR18","doi-asserted-by":"crossref","unstructured":"Gonzalez Vasco M.I., Naslund M., Shparlinski I.E.: New results on the hardness of Diffie-Hellman bits. In: PKC 2004. LNCS, vol. 2947, pp. 159\u2013172 (2004).","DOI":"10.1007\/978-3-540-24632-9_12"},{"issue":"4","key":"9329_CR19","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad J., Impagliazzo R., Levin L., Luby M.: A pseudo-random generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9329_CR20","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"Impagliazzo R., Naor M.: Efficient cryptographic schemes provably as secure as subset sum. J. Cryptol. 9(4), 199\u2013216 (1996)","journal-title":"J. Cryptol."},{"key":"9329_CR21","doi-asserted-by":"crossref","unstructured":"Jiang S.: Efficient primitives from exponentiation in Zp. In: Information Security and privacy: 11th Australasian Conference\u2014ACISP 2006. LNCS, vol. 4058, pp. 259\u2013270 (2006).","DOI":"10.1007\/11780656_22"},{"key":"9329_CR22","unstructured":"Jiang S., Gong G.: Security of a server-assisted group password-authenticated key exchange protocol. Technical Report CACR 2005-17 (2005). http:\/\/www.cacr.math.uwaterloo.ca ."},{"issue":"3","key":"9329_CR23","doi-asserted-by":"crossref","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 Trans. Inform Theory 46(3), 911\u2013921 (2000)","journal-title":"IEEE Trans. Inform Theory"},{"issue":"4","key":"9329_CR24","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. J. Cryptol. 14(4), 255\u2013293 (2001)","journal-title":"J. Cryptol."},{"key":"9329_CR25","doi-asserted-by":"crossref","unstructured":"Lim C., Lee P.: More flexible exponentiation with precomputation. In: Advances in Cryptology-CRYPTO 1994. LNCS, vol. 839, pp. 95\u2013107 (1994).","DOI":"10.1007\/3-540-48658-5_11"},{"key":"9329_CR26","doi-asserted-by":"crossref","unstructured":"Long D.L., Wigderson A.: How discreet is the discrete log. In: ACM STOC. pp. 413\u2013420 (1983).","DOI":"10.1145\/800061.808772"},{"issue":"2","key":"9329_CR27","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby M., Rackoff C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17(2), 373\u2013386 (1988)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9329_CR28","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor M.: Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991)","journal-title":"J. Cryptol."},{"key":"9329_CR29","doi-asserted-by":"crossref","unstructured":"Patel S., Sundaram G.S.: An efficient discrete log pseudo random generator. In: Advances in Cryptology-CRYPTO 1998. LNCS, vol. 1462, pp. 304\u2013317 (1998).","DOI":"10.1007\/BFb0055737"},{"key":"9329_CR30","doi-asserted-by":"crossref","unstructured":"Peralta R.: Simultaneous security of bits in the discrete Log. In: Advances in Cryptology-EUROCRYPT 1985. LNCS, vol. 219, pp. 62\u201372 (1986).","DOI":"10.1007\/3-540-39805-8_8"},{"key":"9329_CR31","unstructured":"Shaltiel R.: Recent developments in explicit constructions of extractors. In: Bull. Eur. Assoc. Theory Comput. Sci., pp. 67\u201395 (2002)."},{"key":"9329_CR32","unstructured":"Shoup V.: Lower bounds for discrete logarithms and related problems. In: Advances in Cryptology-EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266 (1997)."},{"key":"9329_CR33","unstructured":"Shoup V.: On formal models for secure key exchange. http:\/\/philby.ucsd.edu\/cryptolib\/1999.html ."},{"key":"9329_CR34","doi-asserted-by":"crossref","unstructured":"Sidorenko A., Schoenmakers B.: Concrete security of the blum-blum-shub pseudorandom generator. In: Cryptography and Coding 2005. LNCS, vol. 3796, pp. 355\u2013375 (2005).","DOI":"10.1007\/11586821_24"},{"key":"9329_CR35","doi-asserted-by":"crossref","unstructured":"Steinfeld R., Pieprzyk J., Wang H.: On the provable security of an efficient RSA-based pseudorandom generator. In: Advances in Cryptology-ASIACRYPT 2006. LNCS, vol. 4284, pp. 194\u2013209 (2006).","DOI":"10.1007\/11935230_13"},{"key":"9329_CR36","unstructured":"Wullschleger J.: Oblivious transfer amplification, PhD Thesis, ETH, 2006. http:\/\/arxiv.org\/abs\/cs\/0608076 ."},{"key":"9329_CR37","doi-asserted-by":"crossref","unstructured":"Yao A.: Theory and applications of trapdoor functions. In: IEEE FOCS. pp. 80\u201391 (1982).","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9329-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-009-9329-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9329-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:27Z","timestamp":1559231907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-009-9329-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,30]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9329"],"URL":"https:\/\/doi.org\/10.1007\/s10623-009-9329-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,30]]}}}