E. E. Egorova
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
E. E. Egorova has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Grigory Kabatiansky
Skolkovo Institute of Science and Technology (Skoltech), Moscow, Russia
4 shared publications - Cedric Tavernier
THALES Communications
1 shared publication - Eugenii Krouk
HSE University, Moscow Institute of Electronics and Mathematics
1 shared publication - Marcel Fernandez
Universitat Politècnica de Catalunya (UPC)
1 shared publication - Marcel Fernandez
Universitat Politecnica de Catalunya, Barcelona, Spain
1 shared publication V. S. Potapova
Skolkovo Institute of Science and Technology
1 shared publication
Latest Publications
- 1 April 2021
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 57 (2) , 178-198
Separable Collusion-Secure Multimedia Codes
We review known results about codes that are able to protect multimedia content from illegal redistribution by coalitions of malicious users.
- 1 April 2021
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 57 (2) , 178-198
Separable Collusion-Secure Multimedia Codes
We review known results about codes that are able to protect multimedia content from illegal redistribution by coalitions of malicious users.
- 1 December 2020
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 56 (4) , 388-398
Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise
It was shown very recently in [1] that there are no multimedia digital fingerprinting codes capable of fully recovering a coalition of malicious users under the general linear attack and adversarial noise. We show that such codes exist if the class of attacks is narrowed to the averaging attack. The arising mathematical problem is close to the problem of constructing signature codes for a noisy binary adder channel.
- 1 December 2020
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 56 (4) , 388-398
Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise
It was shown very recently in [1] that there are no multimedia digital fingerprinting codes capable of fully recovering a coalition of malicious users under the general linear attack and adversarial noise. We show that such codes exist if the class of attacks is narrowed to the averaging attack. The arising mathematical problem is close to the problem of constructing signature codes for a noisy binary adder channel.
- 19 March 2020
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 88 (9) , 1885-1892
On non-binary traceability set systems
- 19 March 2020
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 88 (9) , 1885-1892
On non-binary traceability set systems
- 1 July 2019
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 55 (3) , 241-253
Generalization of IPP Codes and IPP Set Systems
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,...
- 1 July 2019
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 55 (3) , 241-253
Generalization of IPP Codes and IPP Set Systems
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,...
- Open Access
- 1 February 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1163 (1) , 012061
A new code-based public-key cryptosystem resistant to quantum computer attacks
We propose a new type of public-key cryptosystems (PKC) which is based on repetition of different error-correcting codes. We give a brief analysis of some well known attacks on code-based PKC, including structural ones and show that the scheme could be used as a perspective post-quantum PKC.
- 1 February 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1163 (1) , 012061
Open AccessA new code-based public-key cryptosystem resistant to quantum computer attacks
We propose a new type of public-key cryptosystems (PKC) which is based on repetition of different error-correcting codes. We give a brief analysis of some well known attacks on code-based PKC, including structural ones and show that the scheme could be used as a perspective post-quantum PKC.
- 1 April 2018
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 54 (2) , 116-123
Compositional Restricted Multiple Access Channel
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)\frac{{{{\log }_q}s}}{{4s}}...
- 1 April 2018
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 54 (2) , 116-123
Compositional Restricted Multiple Access Channel
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)\frac{{{{\log }_q}s}}{{4s}}...