Polynomial and matrix computations (vol. 1): fundamental algorithms
Polynomial and matrix computations (vol. 1): fundamental algorithms
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
SIAM Journal on Discrete Mathematics
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Efficient Trace and Revoke Schemes
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Broadcast encryption with short keys and transmissions
Proceedings of the 3rd ACM workshop on Digital rights management
New traitor tracing schemes using bilinear map
Proceedings of the 3rd ACM workshop on Digital rights management
Scalable public-key tracing and revoking
Distributed Computing
Improved efficiency for revocation schemes via Newton interpolation
ACM Transactions on Information and System Security (TISSEC)
Improving the Boneh-Franklin Traitor Tracing Scheme
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Tracing and Revoking Pirate Rebroadcasts
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Pirate evolution: how to make the most of your traitor keys
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Tracing stateful pirate decoders
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Improving the round complexity of traitor tracing schemes
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
On the effects of pirate evolution on the design of digital content distribution systems
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Coalition resistant anonymous broadcast encryption scheme based on PUF
TRUST'11 Proceedings of the 4th international conference on Trust and trustworthy computing
Attacking traitor tracing schemes using history recording and abrupt decoders
ISC'11 Proceedings of the 14th international conference on Information security
A revocation scheme preserving privacy
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
Outsider-Anonymous broadcast encryption with sublinear ciphertexts
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Hi-index | 0.00 |
Traitor Tracing Schemes constitute a very useful tool against piracy in the context of digital content broadcast. In such multi-recipient encryption schemes, each decryption key is fingerprinted and when a pirate decoder is discovered, the authorities can trace the identities of the users that contributed in its construction (called traitors). Public-key traitor tracing schemes allow for a multitude of non trusted content providers using the same set of keys, which makes the scheme "server-side scalable." To make such schemes also "client-side scalable," i.e. long lived and usable for a large population of subscribers that changes dynamically over time, it is crucial to implement efficient Add-user and Remove-user operations. Previous work on public-key traitor tracing did not address this dynamic scenario thoroughly, and there is no efficient scalable public key traitor tracing scheme that allows an increasing number of Add-user and Remove-user operations.To address these issues, we introduce the model of Scalable Public-Key Traitor Tracing, and present the first construction of such a scheme. Our model mandates for deterministic traitor tracing and an unlimited number of efficient Add-user operations and Remove-user operations. A scalable system achieves an unlimited number of revocations while retaining high level of efficiency by dividing the run-time of the system into periods. Each period has a saturation level for the number of revocations. When a period becomes saturated, an efficient new-period operation is issued by the system server that resets the saturation level. We present a formal adversarial model for our system taking into account its periodic structure, and we prove our construction secure, both against adversaries that attempt to cheat the revocation mechanism as well as against adversaries that attempt to cheat the traitor tracing mechanism.