Efficient pseudorandom generators based on the DDH assumption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4450 LNCS, Issue , 2007, Pages 426-441

  Farashahi, Reza Rezaeian ^a,b   Schoenmakers, Berry ^a   Sidorenko, Andrey ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b ISFAHAN UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; NUMERICAL METHODS; PROBABILISTIC LOGICS;

DIFFIE HELLMAN ASSUMPTION; DISCRETE LOG ASSUMPTIONS; DUAL ELLIPTIC CURVE GENERATOR; PROBABILISTIC RANDOMNESS EXTRACTORS; PSEUDORANDOM GENERATORS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 38049035823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71677-8_28     Document Type: Conference Paper

References (31)

1. E. Barker and J. Kelsey, Recommendation for random number generation using deterministic random bit generators, December 2005, NIST Special Publication (SP) 800-90.
2. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM Journal on Computing 13 (1984), no. 4, 850-864.
3. D. Brown, Conjectured security of the ANSI-NIST Elliptic Curve RNG, Cryptology ePrint Archive, Report 2006/117, 2006, http://eprint.iacr. org/.
4. O. Chevassut, P. Fouque, P. Gaudry, and D. Pointcheval, The Twist-AUgmented Technique for Key Exchange, Public Key Cryptography-PKC 2006, Lecture Notes in Computer Science, vol. 3958, Springer-Verlag, 2006, pp. 410-426.
5. R. Cramer and V. Shoup, Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack, SIAM Journal on Computing (2003), 167-226.
6. R. Fischlin and C. P. Schnorr, Stronger security proofs for RSA and Rabin bits, Journal of Cryptology 13 (2000), no. 2, 221-244.
7. P. Fouque, D. Pointcheval, J. Stern, and S. Zimmer, Hardness of distinguishing the MSB or LSB of secret keys in Diffie-Hellman schemes, ICALP (2), 2006, pp. 240-251.
8. R. Gennaro, An improved pseudo-random generator based on the discrete logarithm problem, Journal of Cryptology 18 (2005), no. 2, 91-110.
9. R. Gennaro, H. Krawczyk, and T. Rabin, Secure hashed Diffie-Hellman over non-DDH groups, Cryptology ePrint Archive, Report 2004/099, 2004, http://eprint.iacr.org/.
10. K. Gjøsteen, Comments on Dual-EC-DRBG/NIST SP 800-90, Draft December 2005, March 2006, http://www.math,ntnu.no/~kristiag/drafts/dual-ec- drbg-comments.pdf.
11. O. Goldreich, Foundations of cryptography, Cambridge University Press, Cambridge, UK, 2001.
12. I. Haitner, D. Harnik, and O. Reingold, On the power of the randomized iterate, Advances in Cryptology - Crypto 2006, Lecture Notes in Computer Science, vol. 4117, Springer-Verlag, 2006, pp. 22-40.
13. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, Construction of a pseudorandom generator from any one-way function, SIAM Journal on Computing 28 (1999), 1364-1396.
14. p, ACISP, Lecture Notes in Computer Science, vol. 4058, Springer-Verlag, 2006, pp. 259-270.
15. A. Juels, M. Jakobsson, E. Shriver, and B. K. Hillyer, How to turn loaded dice into fair coins, IEEE Transactions on Information Theory 46 (2000), no. 3, 911-921.
16. B. S. Kaliski, Elliptic curves and cryptography: A pseudorandom bit generator and other tools, Ph.D. thesis, MIT, Cambridge, MA, USA, 1988.
17. D. E. Knuth, Seminumerical algorithms, third ed., vol. 3, Addison-Wesley, Reading, MA, USA, 1997.
18. A. K. Lenstra and E. R. Verheul, The XTR public key system, Advances in Cryptology-Crypto 2000, Lecture Notes in Computer Science, vol. 1880, Springer-Verlag, 2000, pp. 1-19.
19. _, Selecting cryptographic key sizes, Journal of Cryptology 14 (2001), no. 4, 255-293.
20. M. Luby, Pseudorandomness and cryptographic applications, Princeton University Press, Princeton, NJ, USA, 1994.
21. U. M. Maurer, Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete algorithms, CRYPTO, 1994, pp. 271-281.
22. U. M. Maurer and S. Wolf, Diffie-Hellman oracles, CRYPTO, 1996, pp. 268-282.
23. A. Menezes, T. Okamoto, and S. A. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Transactions on Information Theory 30 (1993), no. 5, 1639-1646.
24. M. Naor and O. Reingold, Number-theoretic constructions of efficient pseudorandom functions, Journal of the ACM 51 (2004), no. 2, 231-262.
25. S. Patel and G. S. Sundaram, An efficient discrete log pseudo random generator, CRYPTO, 1998, pp. 304-317.
26. J. M. Pollard, Kangaroos, monopoly and discrete logarithms, Journal of Cryptology 13 (2000), no. 4, 437-447.
27. B. Schoenmakers and A. Sidorenko, Cryptanalysis of the Dual Elliptic Curve pseudorandom generator, Cryptology ePrint Archive, Report 2006/190, 2006, http://eprint.iacr.org/.
28. R. Shaltiel, Recent developments in explicit constructions of extractors., Bulletin of the EATCS 77 (2002), 67-95.
29. R. Steinfeld, J. Pieprzyk, and H. Wang, On the provable security of an efficient RSA-based pseudorandom generator, Cryptology ePrint Archive, Report 2006/206, 2006, http://eprint.iacr.org/.
30. S. Wolf, Information-theoretically and computationally secure key agreement in cryptography, Ph.D. thesis, ETH Zurich, 1999.
31. F. Zhang, R. Safavi-Naini, and W. Susilo, An efficient signature scheme from bilinear pairings and its applications, Public Key Cryptography 2004, Lecture Notes in Computer Science, vol. 2947, Springer-Verlag, 2004, pp. 277-290.