default search action
Gregory A. Kabatiansky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c30]Marcel Fernandez, Grigory Kabatiansky, Ibrahim Kamel, Ying Miao, Tamer F. Rabie:
Multimedia Fingerprinting Codes Resistant to Linear Attacks and Adversarial Noise. ISNCC 2023: 1-5 - [c29]Marcel Fernandez, Grigory Kabatiansky, Sebastià Martín, Cédric Tavernier:
A constructive approach to multimedia codes with complete traceability resistant to δ-noise. ITW 2023: 254-259 - 2021
- [j23]Elena Egorova, Gregory A. Kabatiansky:
Separable Collusion-Secure Multimedia Codes. Probl. Inf. Transm. 57(2): 178-198 (2021) - 2020
- [j22]Elena Egorova
, Marcel Fernandez, Grigory Kabatiansky:
On non-binary traceability set systems. Des. Codes Cryptogr. 88(9): 1885-1892 (2020) - [j21]Elena Egorova, Marcel Fernandez, Gregory A. Kabatiansky, Ying Miao:
Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise. Probl. Inf. Transm. 56(4): 388-398 (2020) - [c28]Fedor I. Ivanov, Grigory Kabatiansky, Eugeniy Krouk, Nikita Rumenko:
A New Code-Based Cryptosystem. CBCrypto 2020: 41-49 - [c27]Grigory Kabatiansky, Elena Egorova:
Adversarial multiple access channels and a new model of multimedia fingerprinting coding. CNS 2020: 1-5
2010 – 2019
- 2019
- [j20]Elena Egorova
Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing. Des. Codes Cryptogr. 87(2-3): 455-462 (2019) - [j19]Gregory A. Kabatiansky:
Traceability Codes and Their Generalizations. Probl. Inf. Transm. 55(3): 283-294 (2019) - [j18]Yujie Gu
Probabilistic Existence Results for Parent-Identifying Schemes. IEEE Trans. Inf. Theory 65(10): 6160-6170 (2019) - [c26]Grigory Kabatiansky:
On the Tracing Traitors Math - Dedicated to the Memory of Bob Blakley - Pioneer of Digital Fingerprinting and Inventor of Secret Sharing. C2SI 2019: 371-380 - [c25]Elena Egorova, Marcel Fernandez, Grigory Kabatiansky:
A Construction of Traceability Set Systems with Polynomial Tracing Algorithm. ISIT 2019: 2739-2742 - [i4]Yujie Gu, Minquan Cheng, Grigory Kabatiansky, Ying Miao:
Probabilistic Existence Results for Parent-Identifying Schemes. CoRR abs/1906.01031 (2019) - 2018
- [j17]José Moreira
Constructions of almost secure frameproof codes with applications to fingerprinting schemes. Des. Codes Cryptogr. 86(4): 785-802 (2018) - [j16]Gregory A. Kabatiansky, Vladimir S. Lebedev:
On Metric Dimension of Nonbinary Hamming Spaces. Probl. Inf. Transm. 54(1): 48-55 (2018) - 2017
- [j15]Vladimir Gritsenko, Grigory Kabatiansky, Vladimir S. Lebedev, Alexey Maevskiy:
Signature codes for noisy multiple access adder channel. Des. Codes Cryptogr. 82(1-2): 293-299 (2017) - [j14]Grigory Kabatiansky, Ivan N. Landjev:
Preface. Electron. Notes Discret. Math. 57: 1-2 (2017) - [c24]Elena Egorova, Grigory Kabatiansky:
Analysis of Two Tracing Traitor Schemes via Coding Theory. ICMCTA 2017: 84-92 - 2016
- [j13]José Moreira
Almost separating and almost secure frameproof codes over q-ary alphabets. Des. Codes Cryptogr. 80(1): 11-28 (2016) - [c23]Elena Egorova, Marcel Fernandez, Grigory A. Kabatiansky, Moon Ho Lee:
Signature codes for the A-channel and collusion-secure multimedia fingerprinting codes. ISIT 2016: 3043-3047 - [c22]Grigory Kabatiansky, Marcel Fernandez, Elena Egorova:
Multimedia fingerprinting codes resistant against colluders and noise. WIFS 2016: 1-5 - 2015
- [j12]Serge G. Vladut, Gregory A. Kabatiansky, V. V. Lomakov:
On error correction with errors in both the channel and syndrome. Probl. Inf. Transm. 51(2): 132-138 (2015) - [c21]Grigory Kabatiansky, Serge G. Vladut, Cédric Tavernier:
On the Doubly Sparse Compressed Sensing Problem. IMACC 2015: 184-189 - [c20]Marcel Fernandez, Grigory Kabatiansky, José Moreira:
Almost IPP-codes or provably secure digital fingerprinting codes. ISIT 2015: 1595-1599 - [c19]Marcel Fernandez, Elena Egorova, Grigory Kabatiansky:
Binary fingerprinting codes - can we prove that someone is guilty?! WIFS 2015: 1-4 - [i3]Grigory Kabatiansky, Cédric Tavernier, Serge G. Vladut:
On the Doubly Sparse Compressed Sensing Problem. CoRR abs/1509.07145 (2015) - 2013
- [j11]Alexander Barg, Grigory Kabatiansky:
Robust Parent-Identifying Codes and Combinatorial Arrays. IEEE Trans. Inf. Theory 59(2): 994-1003 (2013) - [c18]José Moreira, Marcel Fernandez, Grigory Kabatiansky:
Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces. IWSEC 2013: 53-67 - 2011
- [c17]Alexander Barg, Grigory Kabatiansky:
Digital Fingerprinting under and (Somewhat) beyond the Marking Assumption - (Invited Talk). ICITS 2011: 202-205 - [c16]Ilya Dumer
Soft-decision list decoding of Reed-Muller codes with linear complexity. ISIT 2011: 2303-2307 - [c15]Marcel Fernandez, Grigory Kabatiansky, José Moreira:
Almost separating and almost secure frameproof codes. ISIT 2011: 2696-2700 - [c14]José Moreira, Grigory Kabatiansky, Marcel Fernandez:
Lower bounds on almost-separating binary codes. WIFS 2011: 1-6 - [r13]Gregory A. Kabatiansky, Ben J. M. Smeets:
Authentication, From an Information Theoretic Perspective. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 63-65 - [r12]Alexander Barg, Gregory A. Kabatiansky:
Fingerprinting. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 465-467 - [r11]G. R. Blakley, Gregory A. Kabatiansky:
Secret Sharing Schemes. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1095-1097 - [r10]G. R. Blakley, Gregory A. Kabatiansky:
Shamir's Threshold Scheme. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1193-1194 - [r9]G. R. Blakley, Gregory A. Kabatiansky:
Share. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1195-1196 - [r8]G. R. Blakley, Gregory A. Kabatiansky:
Visual Secret Sharing Schemes. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1363-1364 - [i2]Alexander Barg, Grigory Kabatiansky:
Robust parent-identifying codes and combinatorial arrays. IACR Cryptol. ePrint Arch. 2011: 227 (2011) - 2010
- [c13]Alexander Barg, G. Robert Blakley, Grigory Kabatiansky, Cédric Tavernier:
Robust parent-identifying codes. ITW 2010: 1-4
2000 – 2009
- 2009
- [j10]Fabien Galand, Gregory A. Kabatiansky:
Coverings, centered codes, and combinatorial steganography. Probl. Inf. Transm. 45(3): 289 (2009) - [i1]Gregory A. Kabatiansky, G. Oshanin:
Finding passwords by random walks: How long does it take? CoRR abs/0909.1051 (2009) - 2008
- [j9]Ilya Dumer
List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity. IEEE Trans. Inf. Theory 54(10): 4488-4492 (2008) - 2007
- [j8]Ilya Dumer
List decoding of the first-order binary Reed-Muller codes. Probl. Inf. Transm. 43(3): 225-232 (2007) - [c12]Ilya Dumer
Soft-Decision List Decoding with Linear Complexity for the First-Order Reed-Muller Codes. ISIT 2007: 1346-1349 - 2006
- [c11]Ilya Dumer
List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity. ISIT 2006: 138-142 - 2005
- [j7]Gregory A. Kabatiansky:
Codes for Copyright Protection: The Case of Two Pirates. Probl. Inf. Transm. 41(2): 182-186 (2005) - [r7]Alexander Barg, Gregory A. Kabatiansky:
Fingerprinting. Encyclopedia of Cryptography and Security 2005 - [r6]Robert Blakley, Gregory A. Kabatiansky:
Secret Sharing Schemes. Encyclopedia of Cryptography and Security 2005 - [r5]Robert Blakley, Gregory A. Kabatiansky:
Shamir's Threshold Scheme. Encyclopedia of Cryptography and Security 2005 - [r4]Robert Blakley, Gregory A. Kabatiansky:
Share. Encyclopedia of Cryptography and Security 2005 - [r3]Robert Blakley, Gregory A. Kabatiansky:
Visual Secret Sharing Schemes. Encyclopedia of Cryptography and Security 2005 - [r2]Gregory A. Kabatiansky, Ben J. M. Smeets:
Authentication. Encyclopedia of Cryptography and Security 2005 - 2004
- [j6]Alexander Barg, Gregory A. Kabatiansky:
A class of I.P.P. codes with efficient identification. J. Complex. 20(2-3): 137-147 (2004) - [c10]G. R. Blakley, Gregory A. Kabatiansky:
Random coding technique for digital fingerprinting codes: fighting two pirates revisited. ISIT 2004: 203 - [c9]Gregory A. Kabatiansky:
Good ternary 2-traceability codes exist. ISIT 2004: 204 - [r1]Gregory A. Kabatiansky, J. A. Rush:
Sphere packing and coding theory. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 1355-1376 - 2003
- [j5]Alexander Barg, G. R. Blakley, Gregory A. Kabatiansky:
Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49(4): 852-865 (2003) - [c8]Fabien Galand, Grigory Kabatiansky:
Information hiding by coverings. ITW 2003: 151-154 - 2001
- [j4]Alexander Barg, Gérard D. Cohen, Sylvia B. Encheva, Grigory Kabatiansky, Gilles Zémor
A hypergraph approach to the identifying parent property: the case of multiple parents. Electron. Notes Discret. Math. 6: 1-3 (2001) - [j3]Gregory A. Kabatiansky:
On Pair-Separating Codes. Probl. Inf. Transm. 37(4): 329-331 (2001) - [j2]Alexander Barg, Gérard D. Cohen, Sylvia B. Encheva, Gregory A. Kabatiansky, Gilles Zémor
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents. SIAM J. Discret. Math. 14(3): 423-431 (2001)
1990 – 1999
- 1997
- [c7]Gregory Kabatianskii, E. A. Krouk, Ben J. M. Smeets:
A Digital Signature Scheme Based on Random Error-Correcting Codes. IMACC 1997: 161-167 - 1996
- [j1]Gregory Kabatianskii, Ben J. M. Smeets, Thomas Johansson
On the cardinality of systematic authentication codes via error-correcting codes. IEEE Trans. Inf. Theory 42(2): 566-578 (1996) - [c6]Mike Burmester, Yvo Desmedt, Gregory Kabatianskii:
Trust and security: A new look at the Byzantine generals problem. Network Threats 1996: 75-83 - 1995
- [c5]G. R. Blakley, Gregory Kabatianskii:
General Perfect Secret Sharing Schemes. CRYPTO 1995: 367-371 - 1993
- [c4]Jürgen Bierbrauer, Thomas Johansson
On Families of Hash Functions via Geometric Codes and Concatenation. CRYPTO 1993: 331-342 - [c3]G. R. Blakley, Gregory Kabatianskii:
Linear Algebra Approach to Secret Sharing Schemes. Error Control, Cryptology, and Speech Compression 1993: 33-40 - [c2]Thomas Johansson
On the Relation between A-Codes and Codes Correcting Independent Errors. EUROCRYPT 1993: 1-11 - [c1]Gregory Kabatianskii, Antoine Lobstein:
On Plotkin-Elias Type Bounds for Binary Arithmetic Codes. Algebraic Coding 1993: 263-269
Coauthor Index
aka: Marcel Fernández
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: