Elena E. Egorova

Elena E. Egorova
Skolkovo Institute of Science and Technology | Skoltech · Computer Science

MS, Higher School of Economics

About

11
Publications
333
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
53
Citations

Publications

Publications (11)
Article
We review known results about codes that are able to protect multimedia content from illegal redistribution by coalitions of malicious users.
Article
A quarter century ago Chor, Fiat, and Naor proposed mathematical models for revealing a source of illegal redistribution of digital content (tracing traitors) in the broadcast encryption framework, including the following two combinatorial models: nonbinary IPP codes, based on an (n, n)-threshold secret sharing scheme, and IPP set systems, based on...
Article
Full-text available
We propose a new approach to construct noise-resistant multimedia fingerprinting codes. Our approach is based on the theory of the signature codes for multiple access channels, mainly, for a weighted noisy adder channel. The corresponding multimedia fingerprinting codes allow to trace the entire coalition of pirates. The codes provide significantly...
Article
We propose a new approach to construct noise-resistant multimedia fingerprinting codes. Our approach is based on the theory of the signature codes for multiple access channels, mainly, for a weighted noisy adder channel. The corresponding multimedia fingerprinting codes allow to trace the entire coalition of pirates. The codes provide significantly...
Article
We introduce the notion of a q-ary s-compositional code and prove that the rate, R, of the best such code satisfies for large s the asymptotic inequalities (q−1)logqs4s≲2(q−1)logqs4s.
Conference Paper
We compare two popular tracing traitor schemes (1) using non-binary codes with identifiable parent property (IPP-codes) and (2) using family of sets with identifiable parent property. We establish a natural basis for comparing and show that the second approach is stronger than IPP-codes. We also establish a new lower bound on the cardinality of the...
Conference Paper
Coding schemes for multimedia fingerprinting in the presence of noise and colluders are investigated. We prove that best such codes have nonvanishing rate, i.e., have exponentially many codewords (users) and can trace the entire coalition of pirates and do it either with zero error probability or w.h.p. depending on the corresponding model of error...

Network

Cited By