Abstract
Illegal distribution of signed documents can be considered as one of serious problems of digital signatures. In this paper, to solve the problem, we propose three protocols concerning signature schemes. These schemes achieve not only traceability of an illegal user but also universal verifiability. The first scheme is a basic scheme which can trace an illegal receiver, and the generation and tracing of a signed document are simple and efficient. However, in this scheme, it is assumed that a signer is honest. The second scheme gives another tracing method which does not always assume that a signer is honest. Furthermore, in the method, an illegal user can be traced by an authority itself, hence, it is efficient in terms of communication costs. However, in this scheme it is assumed that there exists only a legal verification algorithm. Thus, in general, this scheme cannot trace a modified signed document which is accepted by a modified verification algorithm. The third one is a scheme which requires no trusted signer and allows a modified verification algorithm. It can trace an illegal receiver or even a signer in such a situation. All of our schemes are constructed by simple combinations of standard signature schemes, consequently, one can flexibly choose suitable building blocks for satisfying requirements for a system.
The second author is supported by a research fellowship from Japan Society for the Promotion of Science (JSPS).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Abe and J. Camenisch, “Partially Blind Signature Schemes,” In Proc. of the 1007 Symposium on Cryptography and Information Security (SCIS’97), Fukuoka, Japan, 1997.
M. Abe and E. Fujisaki, “How to Date Blind Signatures,” In Advances in Cryptology — ASIACRYPT’96, LNCS 1163, pp. 244–251, Springer-Verlag, 1996.
M. Abe and T. Okamoto, “Provably Secure Partially Blind Signatures,” In Advances in Cryptology — CRYPTO 2000, LNCS 1880, pp. 271–286, Springer-Verlag, 2000.
G. Ateniese, J. Camenisch, M. Joye and G. Tsudik, “A Practical and Provable Secure Coalition-Resistant Group Signature Scheme,” In Advances in Cryptology-CRYPTO2000, LNCS 1880, pp. 255–270, Springer-Verlag, 2000.
N. Asokan, V. Shoup and M. Waidner, “Optimistic Fair Exchange of Digital Signatures,” In Advances in Cryptology — EUROCRYPT’98, LNCS 1403, pp. 591–606, Springer-Verlag, 1998.
K. Baba, K. Iwamura, Y. Zheng and H. Imai, “A Protocol to Detect Who Has Leaked a Signed Document,” In Proc. of the 1999 Symposium on Cryptography and Information Security (SCIS’99), Kobe, Japan, pp. 257–262, 1999.
S. Brands, “Untraceable Off-line Cash in Wallets with Observers,” In Advances in Cryptology — CRYPTO’ 93, LNCS 773, pp. 302–318, Springer-Verlag, 1994.
J. Camenisch and M. Stadler, “Efficient Group Signature Schemes for Large Groups,” In Advances in Cryptology — CRYPTO’97, LNCS 1296, pp. 410–424, Springer-Verlag, 1997.
D. Chaum, “Zero-Knowledge Undeniable Signatures,” In Advances in Cryptology — EUROCRYPT’90, LNCS 473, pp. 458–464, Springer-Verlag, 1991.
D. Chaum, “Designated Confirmer Signatures,” In Advances in Cryptology — EUROCRYPT’94, LNCS 950, pp. 86–91, Springer-Verlag, 1994.
D. Chaum and H. van Antwerpen, “Undeniable Signatures,” In Advances in Cryptology — CRYPTO’89, LNCS 435, pp. 212–216, Springer-Verlag, 1990.
D. Chaum and E. van Heyst, “Group Signatures,” In Advances in Cryptology — EUROCRYPT’91, LNCS 547, pp. 257–265, Springer-Verlag, 1991.
A. Fiat and A. Shamir, “How to Prove Yourself: Practical Solutions to Identification and Signature Problems,” In Advances in Cryptology-CRYPTO’86, LNCS 263, pp. 186–194, Springer-Verlag, 1987.
B. Pfitzmann and M. Waidner, “Anonymous Fingerprinting,” In Advances in Cryptology — EUROCRYPT’97, LNCS 1233, pp. 88–102, Springer-Verlag, 1997.
C. P. Schnorr, “Efficient Identification and Signatures for Smart Cards,” In Advances in Cryptology — EUROCRYPT’89, LNCS 434, pp. 688–689, Springer-Verlag, 1990.
Y. Watanabe, Y. Zheng and H. Imai, “Traitor Traceable Signature Scheme,” In Proc. of ISIT2000, Sorrento, Italy, pp. 462, 2000.
Y. Watanabe, Y. Zheng and H. Imai, “Software Copyright Protection in the Presence of Corrupted Providers,” In Proc. of International Symposium on Information Theory and Its Applications(ISITA2000), Honolulu, Hawaii, U.S.A., pp. 501–504, 2000.
Y. Zheng, “Digital Signcryption or How to Achieve Cost(Signature & Encryption) ≪ Cost(Signature) + Cost(Encryption),” In Advances in Cryptology-CRYPTO’97, LNCS 1294, pp. 165–179, Springer-Verlag, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yonezawa, S., Hanaoka, G., Shikata, J., Imai, H. (2002). Traceability Schemes for Signed Documents* . In: Chan, A.H., Gligor, V. (eds) Information Security. ISC 2002. Lecture Notes in Computer Science, vol 2433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45811-5_20
Download citation
DOI: https://doi.org/10.1007/3-540-45811-5_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44270-7
Online ISBN: 978-3-540-45811-1
eBook Packages: Springer Book Archive