More Web Proxy on the site http://driver.im/

Article

An Asymmetric Traceability Scheme for Copyright Protection without Trust Assumptions

Authors:

Emmanouil Magkos,

Panayiotis Kotzanikolaou,

Vassilios ChrissikopoulosAuthors Info & Claims

EC-Web 2001: Proceedings of the Second International Conference on Electronic Commerce and Web Technologies

Pages 186 - 195

Published: 04 September 2001 Publication History

Abstract

Traceability schemes have been proposed as a method to establish copyright protection of broadcast information. With asymmetric traceability, the merchant cannot frame an innocent user, while no user can abuse the system without being detected.We propose an asymmetric solution for traceability, based on the very efficient symmetric scheme of Kurosawa-Desmedt [13]. We do not make any trust assumptions about the broadcasting center or other authorities. Furthermore, we establish anonymity protection for all honest users: the identity of a user is protected, until a "fingerprint" of that user is found on a pirate decoder. We make use of well-known cryptographic techniques, such as oblivious transfer, time-lock puzzles and blind signatures. Finally, we propose a cut-and-choose technique to assure the correctness of the decryption keys.

References

[1]

Bellare, M., Micali, S.: Non-Interactive Oblivious Transfer and Applications. Advances in Cryptology-CRYPTO '89, LNCS 435, Springer-Verlag, 1990, pp. 544- 557.

[2]

Boneh, D., Franklin, M.: An Efficient Public key Traitor Tracing Scheme. Advances in Cryptology-EUROCRYPT '90, LNCS 1666, Springer-Verlag, 1999, pp. 338-353.

[3]

Boneh, D., Shaw, J.: Collusion Secure Fingerprinting For Digital Data. Advances in Cryptology-CRYPTO '95, LNCS 963, Springer-Verlag, 1995, pp. 452-465.

[4]

Chaum, D.: Blind Signatures for Untraceable Payments. Advances in Cryptology-CRYPTO '82, Plenum Press, 1982, pp. 199-203.

[5]

Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, Vol. 24(2), 1981, pp. 84-88.

[6]

Chaum, D., Damgard, I., Graaf, J.: Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result. Advances in Cryptology-CRYPTO '87, LNCS 293, Springer-Verlag, 1988, pp. 87-119.

[7]

Chor, B., Fiat, A., Naor, M.: Tracing Traitors. Advances in Cryptology-CRYPTO '94, LNCS 293, Springer-Verlag, 1994, pp. 257-270.

[8]

Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory IT-22, November 1976, pp. 644-654.

[9]

Even, S., Goldreich, O., Lempel, A.: A Randomized Protocol for Signing Contracts. Communications of the ACM, Vol. 28, 1985, pp. 637-647.

[10]

Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game -or- a Completeness Theorem for Protocols with Honest Majority. 19th STOC, 1987, pp. 218-229.

[11]

Goldschlag, D., Reed, M., Syverson, P.: Onion Routing for Anonymous and Private Communications. Communications of the ACM, Vol. 42(2), 1999, pp. 39-41.

[12]

Kurosawa, K., Burmester, M., Demedt, Y.: Proven Secure Tracing Algorithm For The Optimal KD Traitor Tracing Scheme. DIMACS Workshop on Management of Digital Intellectual Property, April 17-18, 2000.

[13]

Kurosawa, K., Demedt, Y.: Optimum Traitor Tracing. Advances in Cryptology-EUROCRYPT '98, LNCS 1403, Springer-Verlag, 1999, pp. 145-157.

[14]

Naor, M., Pinkas, B.: Oblivious Transfer and Polynomial Evaluation. 31th ACM Symposium on Theory of Computing, ACM, 1999, pp. 245-254.

[15]

Peticolas, F., Anderson, R., Kuhn, M.: Information Hiding-A Survey. In Proceedings of the IEEE, Special Issue on Protection of Multimedia Content, IEEE Vol. 87(7), 1999, pp. 1062-1078.

[16]

Pfitzmann, B.: Trials of Traced Traitors. Information Hiding Workshop, LNCS 1174, Springer-Verlag, 1996, pp. 49-64.

[17]

Pfitzmann, B., Schunter, M.: Asymmetric Fingerprinting. Advances in Cryptology-EUROCRYPT '96, LNCS 1070, Springer-Verlag, 1996, pp. 84-95.

[18]

Pfitzmann, B., Waidner, M.: Anonymous Fingerprinting. Advances in Cryptology-EUROCRYPT '97, LNCS 1233, Springer-Verlag, 1997, pp. 88-102.

[19]

Pfitzmann, B., Waidner, M.: Asymmetric Fingerprinting for Larger Collusions. ACM Conference on Computer and Communication Security, ACM, 1997, pp. 151- 160.

[20]

Rabin, M. O.: How to Exchange Secrets by Oblivious Transfer. Technical Memo TR-81, Aiken Computation Laboratory, 1981.

[21]

Rivest, R., Shamir, A., Wagner, D.: Time-Lock Puzzles and Timed-Released Crypto. LCS Technical Memo MIT/LCS/TR-684, 1996, http://www.theory.lcs.mit.edu/~rivest/RivestShamirWagner-timelock.ps

[22]

Stinson, D., Wei, R.: Combinatorial Properties and Constructions for Traceability Schemes. SIAM Journal on Discrete Mathematics, Vol. 11(1), 1998, pp. 41-53.

[23]

You, C., Zhou, J., Lam, K.: On the Efficient Implementation of Fair Non-Repudiation. 1997 IEEE Computer Security Foundations Workshop, IEEE CS Press, 1997, pp. 126-132.

Cited By

Nematzadeh ACamp L(2010)Threat analysis of online health information systemProceedings of the 3rd International Conference on PErvasive Technologies Related to Assistive Environments10.1145/1839294.1839331(1-7)Online publication date: 23-Jun-2010
https://dl.acm.org/doi/10.1145/1839294.1839331

Recommendations

A New Asymmetric Watermarking Scheme for Copyright Protection

This letter proposes a new asymmetric watermarking scheme. In the proposed scheme, a non-full rank matrix is applied to an embedded watermark to form an asymmetric detection watermark. To detect the embedded watermark, the watermarked signal is ...
The Convertible Undeniable Multi-Signature Scheme Suitable for Digital Copyright Protection
ICHIT '08: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology

In this paper, the convertible undeniable multisignature scheme is proposed. An undeniable signature scheme has a property that a verifier can not authenticate the signature of the document without help of the signer. An undeniable multi-signature ...
Efficient structure-preserving signature scheme from standard assumptions
SCN'12: Proceedings of the 8th international conference on Security and Cryptography for Networks

We present an efficient signature scheme that facilitates Groth-Sahai proofs [25] of knowledge of a message, a verification key, and a valid signature on the message, without the need to reveal any of them. Such schemes are called structure-preserving. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings

EC-Web 2001: Proceedings of the Second International Conference on Electronic Commerce and Web Technologies

September 2001

347 pages

ISBN:3540425179

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 04 September 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Nematzadeh ACamp L(2010)Threat analysis of online health information systemProceedings of the 3rd International Conference on PErvasive Technologies Related to Assistive Environments10.1145/1839294.1839331(1-7)Online publication date: 23-Jun-2010
https://dl.acm.org/doi/10.1145/1839294.1839331

View Options

View options

Figures

Tables

Media

View Table of Conten