Asymmetric fingerprinting for larger collusions
Proceedings of the 4th ACM conference on Computer and communications security
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
SIAM Journal on Discrete Mathematics
Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended Abstract)
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
On Crafty Pirates and Foxy Tracers
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Anonymous fingerprinting with robust QIM watermarking techniques
EURASIP Journal on Information Security
Optimal probabilistic fingerprint codes
Journal of the ACM (JACM)
Traitor tracing with constant size ciphertext
Proceedings of the 15th ACM conference on Computer and communications security
Tracing and Revoking Pirate Rebroadcasts
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
An efficient buyer-seller watermarking protocol based on composite signal representation
Proceedings of the 11th ACM workshop on Multimedia and security
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
An anonymous buyer-seller watermarking protocol with anonymity control
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Improving the round complexity of traitor tracing schemes
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Encryption for Digital Content
Encryption for Digital Content
An asymmetric fingerprinting scheme based on tardos codes
IH'11 Proceedings of the 13th international conference on Information hiding
Combinatorial properties of frameproof and traceability codes
IEEE Transactions on Information Theory
New results on frame-proof codes and traceability schemes
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
A buyer-seller watermarking protocol
IEEE Transactions on Image Processing
Anti-collusion forensics of multimedia fingerprinting using orthogonal modulation
IEEE Transactions on Image Processing
Fingerprinting protocol for images based on additive homomorphic property
IEEE Transactions on Image Processing
A privacy-preserving buyer-seller watermarking protocol with semi-trust third party
TrustBus'07 Proceedings of the 4th international conference on Trust, Privacy and Security in Digital Business
Renewable traitor tracing: a trace-revoke-trace system for anonymous attack
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
| Hi-index | 0.00 |
A buyer seller watermarking protocol is intended to ensure copyright protection, privacy and security for both the buyer and seller simultaneously in an e-commerce application. A traitor should not be able to deny his responsibility of a copyright violation caused by him in such protocols. This feature is identified as non-repudiation in the literature. An efficient approach taken is through secure embedding of watermarks in an encrypted domain by using dither modulation and homomorphic encryption. To support non-repudiation along with collusion resistance, one needs an asymmetric collusion resistant fingerprinting code that is compatible with the watermarking technique. The design of such codes has not yet studied thoroughly with an exception of a recent work by Charpentier et. al. in [4]. In this paper, we propose an asymmetric binary fingerprinting code based on Boneh-Shaw code. When applied to the secure embedding of watermarks, we show that our code outperforms the code introduced by [4]: (i) we achieve constant communication round, (ii) we do not require any oblivious transfer protocol and (iii) we do not require any public Write Once Read Many (WORM) directory.