Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Proxy signatures for delegating signing operation
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the Security of Joint Signature and Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proxy re-signatures: new definitions, algorithms, and applications
Proceedings of the 12th ACM conference on Computer and communications security
Improved proxy re-encryption schemes with applications to secure distributed storage
ACM Transactions on Information and System Security (TISSEC)
Multi-signatures in the plain public-Key model and a general forking lemma
Proceedings of the 13th ACM conference on Computer and communications security
Advances in signatures, encryption, and e-cash from bilinear groups
Advances in signatures, encryption, and e-cash from bilinear groups
Chosen-ciphertext secure proxy re-encryption
Proceedings of the 14th ACM conference on Computer and communications security
Multi-use unidirectional proxy re-signatures
Proceedings of the 15th ACM conference on Computer and communications security
Perfect NIZK with adaptive soundness
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Securely obfuscating re-encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Proxy re-signature schemes without random oracles
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Efficient Selective Identity-Based Encryption Without Random Oracles
Journal of Cryptology
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
About the security of MTI/C0 and MQV
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Sequential aggregate signatures and multisignatures without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Efficient Traitor Tracing from Collusion Secure Codes
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
On the complexity of differentially private data release: efficient algorithms and hardness results
Proceedings of the forty-first annual ACM symposium on Theory of computing
Traitor Tracing without A Priori Bound on the Coalition Size
ISC '09 Proceedings of the 12th International Conference on Information Security
An Error-Tolerant Variant of a Short 2-Secure Fingerprint Code and Its Security Evaluation
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
Building efficient fully collusion-resilient traitor tracing and revocation schemes
Proceedings of the 17th ACM conference on Computer and communications security
The privacy of tracing traitors
Proceedings of the tenth annual ACM workshop on Digital rights management
Robust fingerprinting codes: a near optimal construction
Proceedings of the tenth annual ACM workshop on Digital rights management
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Improving the round complexity of traitor tracing schemes
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Efficient traitor tracing for clone attack in content protection
Proceedings of the 2011 ACM Symposium on Applied Computing
Fully collusion-resistant traitor tracing scheme with shorter ciphertexts
Designs, Codes and Cryptography
Traitor tracing against public collaboration
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Identity-based trace and revoke schemes
ProvSec'11 Proceedings of the 5th international conference on Provable security
Attacking traitor tracing schemes using history recording and abrupt decoders
ISC'11 Proceedings of the 14th international conference on Information security
A public-key traitor tracing scheme with an optimal transmission rate
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Codes based tracing and revoking scheme with constant ciphertext
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Message-Based traitor tracing with optimal ciphertext rate
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
Further analysis of pairing-based traitor tracing schemes for broadcast encryption
Security and Communication Networks
An asymmetric fingerprinting code for collusion-resistant buyer-seller watermarking
Proceedings of the first ACM workshop on Information hiding and multimedia security
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
A traitor tracing system enables a publisher to trace a pirate decryption box to one of the secret keys used to create the box. We present a traitor tracing system where ciphertext size is "constant," namely independent of the number of users in the system and the collusion bound. A ciphertext in our system consists of only two elements where the length of each element depends only on the security parameter. The down side is that private-key size is quadratic in the collusion bound. Our construction is based on recent constructions for fingerprinting codes.