Transitive Signature Scheme for Directed Trees

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E86-A, Issue 5, 2003, Pages 1120-1126

  Kuwakado, Hidenori ^a   Tanaka, Hatsukazu ^a  

^a KOBE UNIVERSITY   (Japan)

Author keywords

Fail stop signature; Graph; Transitive signature; Tree

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY;

TRANSITIVE SIGNATURE;

TREES (MATHEMATICS);

EID: 0141903389     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. D. Chaum, "Blind signatures for untraceable payment," Advances in Cryptology - Proc. CRYPTO'82, pp. 199-203, Plenum Press, 1983.
2. W. Diffie and M.E. Hellman, "New directions in cryptography," IEEE Trans. Inf. Theory, vol.IT-22, no.6, pp.644-654, 1976.
3. E. van Heijst, T.P. Pedersen, and B. Pfitzmann, "New constructions of fail-stop signatures and lower bounds," Advances in Cryptology - CRYPTO'92, Lecture Notes in Computer Science, vol.740, pp.15-30, 1993.
4. E. van Heyst and T.P. Pedersen, "How to make efficient fail-stop signatures," Advances in Cryptology - EUROCRYPT'91, Lecture Notes in Computer Science, vol.547, pp.257-265, 1991.
5. S. Micali and R.L. Rivest, "Transitive signature schemes," Topics in Cryptology - CT-RSA 2002, Lecture Notes in Computer Science, vol.2271, pp.236-243, 2002.
6. T.P. Pedersen, "Non-interactive and information-theoretic secure verifiable secret sharing," Advances in Cryptology - CRYPTO'91, Lecture Notes in Computer Science, vol.576, pp.129-140, 1992.