Tracing traitors by guessing secrets. The q-ary case
View/Open
Tracing traitors by guessing secrets. The q-ary case (192,0Kb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/23120
Document typeConference report
Defense date2005
PublisherSpringer
Rights accessRestricted access - publisher's policy
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
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.
CitationFernandez, M.; Soriano, M.; Cotrina, J. Tracing traitors by guessing secrets. The q-ary case. A: Information Security Practice and Experience Conference. "Information security practice and experience: First International Conference, ISPEC 2005: Singapore, April 11-14, 2005: proceedings". Singapore: Springer, 2005, p. 61-73.
ISBN978-3-540-25584-0
Publisher versionhttp://link.springer.com/chapter/10.1007%2F978-3-540-31979-5_6
Files | Description | Size | Format | View |
---|---|---|---|---|
Tracing traitor ... ecrets. The q-ary case.pdf![]() | Tracing traitors by guessing secrets. The q-ary case | 192,0Kb | Restricted access |