Practical scenarios for the van trung-martirosyan codes

Authors:
Marcel Fernandez;Miguel Soriano;Josep Cotrina
Affiliations:
Department of Telematics Engineering, Universitat Politècnica de Catalunya, Barcelona, Spain;Department of Telematics Engineering, Universitat Politècnica de Catalunya, Barcelona, Spain;Department of Telematics Engineering, Universitat Politècnica de Catalunya, Barcelona, Spain
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Year:
2005

Citing 8
Cited 0

Broadcast encryption

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Guessing secrets efficiently via list decoding

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Traitor Training

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Tracing Traitors

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Efficient Traitor Tracing Algorithms Using List Decoding

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory
Sequential traitor tracing

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traitor tracing schemes are used in to detect piracy in broadcast encryption systems, in case that a bounded number of authorized users are dishonest. In this paper we present, by solving a variant of the guessing secrets problem defined by Chung, Graham and Leighton [3], a traitor tracing scheme based in the recently discovered van Trung-Martirosyan traceability codes.