Tracing traitors by guessing secrets. the q-ary case

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:
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
Year:
2005

Citing 5
Cited 1

On codes with the identifiable parent property

Journal of Combinatorial Theory Series A
Guessing secrets efficiently via list decoding

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Tracing Traitors

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory
Sequential traitor tracing

IEEE Transactions on Information Theory

Two cooperative versions of the Guessing Secrets problem

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present, by solving a variant of the guessing secrets problem defined by Chung, Graham and Leighton [3], a sequential traitor tracing scheme equipped with an efficient identification algorithm. Sequential traitor tracing schemes are used to detect piracy in multimedia content broadcast systems, where the traitors illegally rebroadcast the content they receive to unauthorized users.