Research interests

Cryptography: pseudorandomness, computational entropy, foundations of cryptography.
Complexity theory, theoretical computer science.

Research papers

• Upper and Lower Bounds on Black-Box Steganography
  Nenad Dedić, Gene Itkis, Leonid Reyzin, Scott Russell
  Extended abstract in Second Theory of Cryptography Conference, TCC 2005, Joe Kilian, editor, Lecture Notes in Computer Science, Springer-Verlag, 2005. © IACR
  [HTML Abstract] [Postscript] [pdf]
• An Improved Pseudorandom Generator Based on Hardness of Factoring
  Nenad Dedić, Leonid Reyzin, Salil Vadhan
  Security in Communication Networks, Third International Conference, SCN 2002, Cimato, Galdi, Persiano, editors, Lecture Notes in Computer Science 2576, © Springer-Verlag, 2003.
  [HTML Abstract] [Postscript] [pdf]
• On Different Models for Generating Random SAT Problems
  Predrag Janičić, Nenad Dedić, Goran Terzić
  Computing and Informatics, Vol. 20, Number 5, 2001.
  [HTML Abstract] [Postscript] [pdf]