Gregory A. Kabatiansky

According to our database1, Gregory A. Kabatiansky authored at least 61 papers between 1993 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Probabilistic Existence Results for Parent-Identifying Schemes.
IEEE Trans. Information Theory, 2019

Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing.
Des. Codes Cryptogr., 2019

Probabilistic Existence Results for Parent-Identifying Schemes.
CoRR, 2019

A Construction of Traceability Set Systems with Polynomial Tracing Algorithm.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Tracing Traitors Math - Dedicated to the Memory of Bob Blakley - Pioneer of Digital Fingerprinting and Inventor of Secret Sharing.
Proceedings of the Codes, Cryptology and Information Security, 2019

2018
On Metric Dimension of Nonbinary Hamming Spaces.
Probl. Inf. Transm., 2018

Constructions of almost secure frameproof codes with applications to fingerprinting schemes.
Des. Codes Cryptogr., 2018

2017
Preface.
Electronic Notes in Discrete Mathematics, 2017

Signature codes for noisy multiple access adder channel.
Des. Codes Cryptogr., 2017

Analysis of Two Tracing Traitor Schemes via Coding Theory.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016
Almost separating and almost secure frameproof codes over q-ary alphabets.
Des. Codes Cryptogr., 2016

Multimedia fingerprinting codes resistant against colluders and noise.
Proceedings of the IEEE International Workshop on Information Forensics and Security, 2016

Signature codes for the A-channel and collusion-secure multimedia fingerprinting codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
On error correction with errors in both the channel and syndrome.
Probl. Inf. Transm., 2015

On the Doubly Sparse Compressed Sensing Problem.
CoRR, 2015

Binary fingerprinting codes - can we prove that someone is guilty?!
Proceedings of the 2015 IEEE International Workshop on Information Forensics and Security, 2015

Almost IPP-codes or provably secure digital fingerprinting codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On the Doubly Sparse Compressed Sensing Problem.
Proceedings of the Cryptography and Coding - 15th IMA International Conference, 2015

2013
Robust Parent-Identifying Codes and Combinatorial Arrays.
IEEE Trans. Information Theory, 2013

Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces.
Proceedings of the Advances in Information and Computer Security, 2013

2011
Authentication, From an Information Theoretic Perspective.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Visual Secret Sharing Schemes.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Share.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Shamir's Threshold Scheme.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Secret Sharing Schemes.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Robust parent-identifying codes and combinatorial arrays.
IACR Cryptology ePrint Archive, 2011

Lower bounds on almost-separating binary codes.
Proceedings of the 2011 IEEE International Workshop on Information Forensics and Security, 2011

Almost separating and almost secure frameproof codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Soft-decision list decoding of Reed-Muller codes with linear complexity.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Digital Fingerprinting under and (Somewhat) beyond the Marking Assumption - (Invited Talk).
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

2010
Robust parent-identifying codes.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009
Coverings, centered codes, and combinatorial steganography.
Probl. Inf. Transm., 2009

Finding passwords by random walks: How long does it take?
CoRR, 2009

2008
List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity.
IEEE Trans. Information Theory, 2008

2007
List decoding of the first-order binary Reed-Muller codes.
Probl. Inf. Transm., 2007

Soft-Decision List Decoding with Linear Complexity for the First-Order Reed-Muller Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Authentication.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Visual Secret Sharing Schemes.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Share.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Shamir's Threshold Scheme.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Secret Sharing Schemes.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Fingerprinting.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Codes for Copyright Protection: The Case of Two Pirates.
Probl. Inf. Transm., 2005

2004
Sphere packing and coding theory.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

A class of I.P.P. codes with efficient identification.
J. Complexity, 2004

Good ternary 2-traceability codes exist.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Random coding technique for digital fingerprinting codes: fighting two pirates revisited.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Digital fingerprinting codes: problem statements, constructions, identification of traitors.
IEEE Trans. Information Theory, 2003

Information hiding by coverings.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2001
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents.
SIAM J. Discrete Math., 2001

On Pair-Separating Codes.
Probl. Inf. Transm., 2001

A hypergraph approach to the identifying parent property: the case of multiple parents.
Electronic Notes in Discrete Mathematics, 2001

1997
A Digital Signature Scheme Based on Random Error-Correcting Codes.
Proceedings of the Cryptography and Coding, 1997

1996
On the cardinality of systematic authentication codes via error-correcting codes.
IEEE Trans. Information Theory, 1996

Trust and security: A new look at the Byzantine generals problem.
Proceedings of the Network Threats, Proceedings of a DIMACS Workshop, December 2-4, 1996, 1996

1995
General Perfect Secret Sharing Schemes.
Proceedings of the Advances in Cryptology, 1995

1993
On Plotkin-Elias Type Bounds for Binary Arithmetic Codes.
Proceedings of the Algebraic Coding, 1993

On the Relation between A-Codes and Codes Correcting Independent Errors.
Proceedings of the Advances in Cryptology, 1993

Linear Algebra Approach to Secret Sharing Schemes.
Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

On Families of Hash Functions via Geometric Codes and Concatenation.
Proceedings of the Advances in Cryptology, 1993


  Loading...