44 citations · 69 across the 30 of their papers we have counts for
Showing 2006Show all
3 papers · 1 filter
cs.CR2006
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…
cs.IT2006
Universal Codes as a Basis for Time Series Testing
Boris Ryabko, Jaakko Astola
We suggest a new approach to hypothesis testing for ergodic and stationary processes. In contrast to standard methods, the suggested approach gives a possibility to make tests, bas…
cs.CC2006★ 1 cited
Fast Enumeration of Combinatorial Objects
Boris Ryabko
The problem of ranking can be described as follows. We have a set of combinatorial objects , such as, say, the k-subsets of n things, and we can imagine that they have been arra…