19 citations · 19 across the 2 of their papers we have counts for
2 papers
cs.CR2008★ 19 cited
Upper and Lower Bounds on Black-Box Steganography
Nenad Dedić, Gene Itkis, Leonid Reyzin +1
We study the limitations of steganography when the sender is not using any properties of the underlying channel beyond its entropy and the ability to sample from it. On the negativ…
cs.DC2005
Flat Holonomies on Automata Networks
Gene Itkis, Leonid A. Levin
We consider asynchronous networks of identical finite (independent of network's size or topology) automata. Our automata drive any network from any initial configuration of states,…