Exploració per autor "Kabatiansky, Grigory"
Ara es mostren els items 1-11 de 11
-
A construction of traceability set systems with polynomial tracing algorithm
(Institute of Electrical and Electronics Engineers (IEEE), 2019)
Text en actes de congrés
Accés obertA family F of w-subsets of a finite set X is called a set system with the identifiable parent property if for any w-subset contained in the union of some t sets, called traitors, of F at least one of these sets can be ... -
A new class of traceability schemes
(2019)
Text en actes de congrés
Accés restringit per política de l'editorialA new class of tracing traitors schemes with traceability property which combines ideas of nonbinary IPP-codes and IPP set systems is proposed. A detailed comparison of the proposed scheme with previously known traceability ... -
A novel support recovery algorithms and its applications to multiple-access channels
(Institute of Electrical and Electronics Engineers (IEEE), 2022)
Text en actes de congrés
Accés restringit per política de l'editorialA novel algorithm of a sparse vector support recovery in presence of noise is proposed. In contrary to known algorithms based on matrices with RIP-property our algorithm exploits properties of so-called separating codes. ... -
Almost IPP-codes or provably secure digital fingerprinting codes
(Institute of Electrical and Electronics Engineers (IEEE), 2015)
Text en actes de congrés
Accés restringit per política de l'editorialCodes with the Identifiable Parent Property (IPP codes) form a very useful tool in traitor tracing schemes since they guarantee (with probability 1) identification of at least one of the traitors. We consider a natural ... -
Almost separating and almost secure frameproof codes
(2011)
Text en actes de congrés
Accés restringit per política de l'editorialThe theory of separating codes has been applied in several areas of science ranging from automata synthesis to the protection of distribution rights. In this paper, we introduce a relaxed version of separating and secure ... -
Almost separating and almost secure frameproof codes over q-ary alphabets
(2015-03-27)
Article
Accés obertIn this paper we discuss some variations of the notion of separating code for alphabets of arbitrary size. We show how the original definition can be relaxed in two different ways, namely almost separating and almost secure ... -
Constructions of almost secure frameproof codes based on small-bias probability spaces
(Springer International Publishing, 2013)
Text en actes de congrés
Accés restringit per política de l'editorialSecure frameproof code is the name given to a separating code when studied in relation to fingerprinting schemes. Separating codes are combinatorial objects that have found to be useful in many areas such as technical ... -
Constructions of almost secure frameproof codes with applications to fingerprinting schemes
(2018-04)
Article
Accés obertThis paper presents explicit constructions of fingerprinting codes. The proposed constructions use a class of codes called almost secure frameproof codes. An almost secure frameproof code is a relaxed version of a secure ... -
Códigos de fingerprinting binarios. Nuevos paradigmas de identificación
(2016)
Text en actes de congrés
Accés obertLos códigos con la Identifiable Parent Property garantizan, con probabilidad 1, la identificación de como mínimo de uno de los traidores en sistemas de Traitor Tracing. Desafortunadamente, para el caso de códigos binarios ... -
On non-binary traceability set systems
(2020-03-19)
Article
Accés obertWe introduce non-binary IPP set systems with traceability properties that have IPP codes and binary IPP set systems with traceability capabilities as particular cases. We prove an analogue of the Gilbert–Varshamov bound ... -
Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
(2019-03-01)
Article
Accés obertWe 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. ...
