Grigory Kabatiansky

Prof. Grigory Kabatiansky


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2020 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
EEE. E. Egorova
E. E. Egorova
MFM. Fernandez
M. Fernandez
GKGrigory Kabatiansky
Grigory Kabatiansky
YMYing Miao
Ying Miao
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.

24 September 2012 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
ABAlexander Barg
Alexander Barg
GKGrigory Kabatiansky
Grigory Kabatiansky
An n-word y=(y1,..., yn) over a finite alphabet of cardinality q is called a descendant of a set of t words x1,..., xt if every coordinate yi,i=1,..., n, is contained in the set {x1i,..., xti}. A code C={x1,..., xM} is said to have the t-IPP property if for any n -word y that is a descendant of at most t parents belonging to the code, it is possible to identify at least one of them. From earlier works, it is known that t-IPP codes of positive rate exist if and only if t ≤ q-1. We introduce a robust version of IPP codes which allows error-free identification of parents in the presence of a certain number of mutations, i.e., coordinates in y that can break away from the descent rule, taking arbitrary values from the alphabet or becoming completely unreadable. We show existence of robust t-IPP codes for all t ≤ q-1 and some positive proportion of such coordinates. We uncover a relation between the hash distance of codes and the IPP property and use it to find the exact proportion of mutant coordinates that permits identification of pirates with zero probability of error in the case of size-2 coalitions.

20 October 2015 in Physical Review A
Verified
Journal Article
Open access
PDF file
VAV. M. Akulin
V. M. Akulin
GKGrigory Kabatiansky
Grigory Kabatiansky
AMAikaterini Mandilara
Aikaterini Mandilara
Using geometric means, we first consider a density matrix decomposition of a multipartite quantum system of a finite dimension into two density matrices: a separable one, also known as the best separable approximation, and an essentially entangled one, which contains no product state components. We show that this convex decomposition can be achieved in practice with the help of a linear programming algorithm that scales in the general case polynomially with the system dimension. We illustrate the algorithm implementation with an example of a composite system of dimension 12 that undergoes a loss of coherence due to classical noise and we trace the time evolution of its essentially entangled component. We suggest a “geometric” description of entanglement dynamics and demonstrate how it explains the well-known phenomena of sudden death and revival of multipartite entanglements. For a statistical weight loss of the essentially entangled component with time, its average entanglement content is not affected by the coherence loss.

1 July 2019 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
GKGrigory Kabatiansky
Grigory Kabatiansky
Codes with the identifiable “parent” property appeared as one of solutions for the broadcast encryption problem. We propose a new, more general model of such codes, give an overview of known results,...

1 February 2019 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
EEElena Egorova
Elena Egorova
GKGrigory Kabatiansky
Grigory Kabatiansky
EKE Krouk
E Krouk
CTC Tavernier
C Tavernier
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 2021 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
EEE. E. Egorova
E. E. Egorova
GKGrigory Kabatiansky
Grigory Kabatiansky
We review known results about codes that are able to protect multimedia content from illegal redistribution by coalitions of malicious users.