Abstract
Traitor tracing schemes deter traitors from giving away their keys to decrypt the contents by enabling the data supplier to identify the source of a redistributed copy. In asymmetric schemes, the supplier can also convince an arbiter of this fact.
Another approach to the same goal was suggested by Dwork, Lotspiech and Naor, so called self-enforcement schemes. In these schemes, traitors have to either divulge their private sensitive information or distribute fairly large amount of data. However, the same private information must be revealed to the data supplier, which invokes the necessity of more discussion about the model underlying this scheme.
In this paper, we present an efficient asymmetric self-enforcement scheme, which also supports the asymmetric traceability without any trusted third parties, assuming the situation where the authenticity of the exponent of each subscriber's sensitive information bound to the subject entity is publicly certified, such as PKI derived from discrete logarithm based cryptosystems. In our scheme, the sensitive information needs not to be revealed to any entities. As far as we know, there has never been any proposal of asymmetric self-enforcement schemes. Furthermore, our scheme is as efficient as the previous most efficient symmetric or asymmetric traitor tracing schemes proposed so far.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Bellare and S. Micali, “Non-interactive oblivious transfer and applications,” Advances in Cryptology-CRYPTO’ 89, LNCS 435, Springer-Verlag, pp.547–557, 1990
D. Bleichenbacher and P.Q. Nguyen, “Noisy Polynomial Interpolation and Noisy Chinese Remaindering,” Advances in Cryptology-EUROCRYPT 2000, LNCS 1807, Springer-Verlag, pp.53–69, 2000
D. Boneh and M. Franklin, “An Efficient Public Key Traitor Tracing Scheme,” Advances in Cryptology-CRYPTO’ 99, LNCS 1666, Springer-Verlag, pp.338–353,1999
B. Chor, A. Fiat and M. Naor, “Tracing Traitors,” Advances in Cryptology-CRYPTO’ 94, LNCS 839, Springer-Verlag, pp.257–270, 1994
C. Dwork, J. Lotspiech and M. Naor, “Digital Signets: Self-Enforcing Protection of Digital Information,” Proc. of 28th ACM Symposium on Theory of Computing(STOC), pp.489–498, 1996
P. Kocher, J. Jaffe and B. Jun, “Differential Power Analysis,” Advances in Cryptology-CRYPTO’ 99, LNCS 1666, Springer-Verlag, pp.388–397, 1999
K. Kurosawa and Y. Desmedt, “Optimum Traitor Tracing and Asymmetric Schemes,” Advances in Cryptology-EUROCRYPT’ 98, LNCS 1403, Springer-Verlag, pp.145–157, 1998
J.L. Massey, “Shift Register Synthesis and BCH Decoding,” IEEE Transactions on Information Theory, vol. IT-15, No.1, pp.122–127, January 1969
M. Naor and B. Pinkas, “Oblivious Transfer and Polynomial Evaluation,” Proc. of 31th ACM Symposium on Theory of Computing(STOC), pp.245–254, 1999
B. Pfitzmann, “Trials of Traced Traitors,” Proc. of Information Hiding, First International Workshop, LNCS 1174, Springer-Verlag, pp.49–64,1996
B. Pfitzmann and M. Waidner, “Asymmetric Fingerprinting for Lager Collusions,” Proc. of ACM Conference on Computer and Communication Security, pp.151–160,1997
T. Sander and A. Ta-Shma, “Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems,” Proc. of Financial Cryptography: Third International Conference, FC’99, LNCS 1648, Springer-Verlag, pp.46–61, 1999
D.R. Stinson and R. Wei, “Key Preassigned Traceability Schemes for Broadcast Encryption,Proc. of SAC’ 98, LNCS 1556, Springer-Verlag, pp.144–156, 1998
N.R. Wagner, “Fingerprinting,” Proc. of IEEE 1983 Symposium on Security and Privacy, April, pp.18–22, 1983
Y. Watanabe, G. Hanaoka and H. Imai, “Asymmetric Public-Key Traitor Tracing without Trusted Agents,” Proc. of the Symposium on Information Theory and Its Application (SITA 2000), October, 2000
Y. Watanabe, G. Hanaoka and H. Imai, “Efficient Asymmetric Public-Key Traitor Tracing without Trusted Agents,”to appear in Proc. of the RSA Conference Cryptographer’s Track, April, 2001 (to be published in LNCS)
Y. Watanabe, H. Komaki, G. Hanaoka and H. Imai, “Asymmetric Traitor Tracing based on Oblivious Polynomial Evaluation,” (in Japanese) IEICE Technical Report, ISEC, September, 2000
S.B. Wicker, “Error Control Systems for Digital Communication and Storage,” Prentice-Hall, Inc., 1995
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Komaki, H., Watanabe, Y., Hanaoka, G., Imai, H. (2001). Efficient Asymmetric Self-Enforcement Scheme with Public Traceability. In: Kim, K. (eds) Public Key Cryptography. PKC 2001. Lecture Notes in Computer Science, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44586-2_17
Download citation
DOI: https://doi.org/10.1007/3-540-44586-2_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41658-6
Online ISBN: 978-3-540-44586-9
eBook Packages: Springer Book Archive