Abstract
In this paper we propose a model for anonymous traceability scheme with unconditional security. The model uses two subsystems: an authentication code with arbiter (A3-code) and an asymmetric traceability with unconditional security.We analyse security of the system against possible attacks and show that security parameters of the system can be described in terms of those of the two subsystems. We give an example construction for the model.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Boneh and J. Shaw. Collusion-secure finger printing for digital data. In Advancesin Cryptology-CRYPTO’95, Lecture Notes in Computer Science, volume 963,pages 453–465. Springer-Verlag, Berlin, Heidelberg, New York, 1995. 250
D. Boneh and J. Shaw. Collusion-secure fingerprinting for digital data. IEEE Transactions on Information Theory, Vol.44 No.5:1897–1905, 1998. 250
E. F. Brickell and D. R. Stinson. Authentication codes with multiple arbiters. In Advances in Cryptology-EUROCRYPT’88, Lecture Notes in Computer Science,volume 330, pages 51–55. Springer-Verlag, Berlin, Heidelberg, New York, 1988.251
Y. Desmedt and M. Yung. Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter’s attack. In Advances in Cryptology-CRYPTO’90, Lecture Notes in Computer Science, volume 537, pages 177–188.Springer-Verlag, Berlin, Heidelberg, New York, 1990. 251
T. Johansson. Further results on asymmetric authentication schemes. Information and Computation, 151:100–133, 1999. 251, 251, 259, 259, 260
K. Kurosawa and Y. Desmedt. Optimum traitor tracing and asymmetric schemes.In Advances in Cryptology-EUROCRYPT’98, Lecture Notes in Computer Science,volume 1462, pages 502–517. Springer-Verlag, Berlin, Heidelberg, New York, 1998.250
B. Pfitzmann and A-R. Sadeghi. Coin-based anonymous fingerprinting. In Advances in Cryptology-EUROCRYPT’99, Lecture Notes in Computer Science, volume1592, pages 150–164. Springer-Verlag, Berlin, Heidelberg, New York, 1999.250, 251
B. Pfitzmann and M. Waidner. Anonymous fingerprinting. In Advances in Cryptology-EUROCRYPT’97, Lecture Notes in Computer Science, volume 1233, pages88–102. Springer-Verlag, Berlin, Heidelberg, New York, 1997. 250
R. Safavi-Naini and Y. Wang. A combinatorial approach to asymmetric traitor tracing. In Computing and Combinatorics, 6th Annual International Conference,COCOON 2000, Lecture Notes in Computer Science, volume 1858, pages 416–425.Springer-Verlag, Berlin, Heidelberg, New York, 2000. 251, 252, 252, 259, 260, 260
D. Stinson and R. Wei. Combinatorial properties and constructions of traceability schemes and framproof codes. SIAM Journal on Discrete Mathematics, 11:41–53,1998. 250
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Safavi-Naini, R., Wang, Y. (2000). Anonymous Traceability Schemes with Unconditional Security. In: Roy, B., Okamoto, E. (eds) Progress in Cryptology —INDOCRYPT 2000. INDOCRYPT 2000. Lecture Notes in Computer Science, vol 1977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44495-5_22
Download citation
DOI: https://doi.org/10.1007/3-540-44495-5_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41452-0
Online ISBN: 978-3-540-44495-4
eBook Packages: Springer Book Archive