CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Traitor Tracing with Constant Transmission Rate
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Hierarchical ID-Based Cryptography
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Trace and Revoke Schemes
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
On Crafty Pirates and Foxy Tracers
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Linear Code Implies Public-Key Traitor Tracing
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key 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
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Scalable public-key tracing and revoking
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient and Short Certificateless Signature
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Building efficient fully collusion-resilient traitor tracing and revocation schemes
Proceedings of the 17th ACM conference on Computer and communications security
Robust fingerprinting codes: a near optimal construction
Proceedings of the tenth annual ACM workshop on Digital rights management
Efficient and short certificateless signatures secure against realistic adversaries
The Journal of Supercomputing
Fully collusion-resistant traitor tracing scheme with shorter ciphertexts
Designs, Codes and Cryptography
Accumulators from bilinear pairings and applications
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Public traceability in traitor tracing schemes
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Fully collusion resistant traitor tracing with short ciphertexts and private keys
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Adaptively secure traitor tracing against key exposure and its application to anywhere TV service
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
A public-key traitor tracing scheme with an optimal transmission rate
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Security proof of sakai-kasahara's identity-based encryption scheme
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Further analysis of pairing-based traitor tracing schemes for broadcast encryption
Security and Communication Networks
| Hi-index | 0.00 |
Mitsunari et al [15] presented a new traitor tracing scheme which uses Weil pairing in elliptic curves. To the best of our knowledge this is the first scheme that uses bilinear map. The claimed advantage of the scheme is that the ciphertext size is independent of the number of traitors. It is shown that the problem of constructing a pirate key by k colluders is as hard as the so-called "k-weak Diffie-Hellman problem".In this paper, we show an attack on this scheme in which traitors find a linear combination of their keys to construct a pirate key that can be used to decrypt the ciphertext. We identify a class of schemes, that includes MSK, with the property that correct tracing requires the ciphertext size to depend on the collusion threshold. We derive a lower bound on the size of the ciphertext that depends on the number of colluders.We propose a modification to MSK scheme, Scheme 1, which not only ensures constructing a pirate decoder is hard, but also has a number of significant advantages over the initial proposal. In particular, it is a public key traitor tracing scheme while the original scheme is a secret key traitor tracing scheme; it has a black box tracing algorithm while MSK scheme only has an open box tracing algorithm, and finally its security is provable (semantic secure against passive adversary) while there was no security proof for MSK.We also propose two other schemes based on bilinear pairing. Scheme~2, is a generic scheme and can be used with any linear error correcting code. Scheme~3 uses Shamir's secret sharing scheme and has the added property that the encrypted message can be targeted to a subset of users. This is by including user revocation property and allowing selected users to be revoked from the original set of users. We also give proof of security, similar to Scheme 1, and also a tracing algorithm for the two schemes. Finally we give an efficiency comparison for the three schemes against the most efficient schemes with similar security and traceability properties and show that all three schemes are the most efficient ones of their kind.