1 citations · 1 across the 5 of their papers we have counts for
5 papers
Using Kolmogorov Complexity for Understanding Some Limitations on Steganography
Boris Ryabko, Daniil Ryabko
Recently perfectly secure steganographic systems have been described for a wide class of sources of covertexts. The speed of transmission of secret information for these stegosyste…
An impossibility result for process discrimination
Daniil Ryabko
Two series of binary observations and are presented: at each time we are given and . It is assumed that the sequences are generated…
Provably Secure Universal Steganographic Systems
Boris Ryabko, Daniil Ryabko
We propose a simple universal (that is, distribution--free) steganographic system in which covertexts with and without hidden texts are statistically indistinguishable. The stegosy…
On Sequence Prediction for Arbitrary Measures
Daniil Ryabko, Marcus Hutter
Suppose we are given two probability measures on the set of one-way infinite finite-alphabet sequences and consider the question when one of the measures predicts the other, that i…
Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence
Daniil Ryabko, Marcus Hutter
We address the problem of reinforcement learning in which observations may exhibit an arbitrary form of stochastic dependence on past observations and actions. The task for an agen…