Improving the Round Complexity of Traitor Tracing Schemes
A traitor tracing scheme is a multiuser encryption that has a built-in key leakage deterrence mechanism : the sender is capable of utilizing a tracing process that can interact with any adversarial decoder and reveal the identities of the users whose keys are employed by the de coder. A number of desired design goals havc been put forth for traitor tracing schemes, notably the minimization of the length of the cipher texts, the length of the encryption key and the storage for private keys. An important efficiency parameter that is not as widely investigated is the round complexity of the tracing process, i.e., the number of rounds of interaction that is required for the tracing process to terminate. In this work we provide (1) a general formalization of this important design consideration, (2) a novel tracing procedure that exhibits an asymptotic improvement over the previously known approaches. Our first result is achieved by casting the tracing process as a game between the tracer and the adversary where the objective of the tracer is to reveal the identity of the corrupted users while the adversary wishes to prevent that while still meeting a minimum functionality requirement. The second result involves a novel application of fingerprinting codes.
Aggelos Kiayias Scrdar Pehlivanoglu
Computer Science and Engineering,University of Connecticut Storrs, CT, USA Division of Mathematical Sciences School of Physical and Mathematical Sciences Nanyang Technological
国际会议
8th International Conference,ACNS 2010(第八届国际应用密码与网络安全大会)
北京
英文
273-290
2010-06-22（万方平台首次上网日期，不代表论文的发表时间）