Transitive signature schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2271, Issue , 2002, Pages 236-243

  Micali, Silvio ^a   Rivest, Ronald L ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Digital signatures; Graphs; Public key cryptography; Transitive closure

Indexed keywords

AUTHENTICATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

DIGITAL SIGNATURE SCHEMES; GRAPH G; GRAPHS; TRANSITIVE CLOSURE; TRANSITIVE SIGNATURE SCHEME;

GRAPH THEORY;

EID: 84944878224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45760-7_16     Document Type: Conference Paper

References (15)

1. A. V. Aho, M. R. Garey, and J. D. Ullman. The transitive reduction of a directed graph. SIAM J. Comput., 1:131–137, 1972.
2. Matt Blaze, Gerrit Bleumer, and Martin Strauss. Divertible protocols and atomic proxy cryptography. In Kaisa Nyberg, editor, Proceedings EUROCRYPT’98, pages 127–144. Springer, 1998.
3. D. Chaum, E. van Heijst, and B. Pfitzmann. Cryptographically strong undeniable signatures, unconditionally secure for the signer. In J. Feigenbaum, editor, Proceedings CRYPTO’91, pages 470–484. Springer, 1992. Lecture Notes in Computer Science No. 576.
4. David Chaum. Blind signatures for untraceable payments. In R. L. Rivest, A. Sherman, and D. Chaum, editors, Proceedings CRYPTO 82, pages 199–203, New York, 1983. Plenum Press.
5. David Chaum. Security without identification: Transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030–1044, Oct 1985.
6. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press/McGraw-Hill, 1990.
7. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In Proc. STOC’91, pages 542–552. ACM, 1991.
8. Joan Feigenbaum. Encrypting problem instances: Or…can you take advantage of someone without having to trust him? In H. C. Williams, editor, Proceedings CRYPTO 85, pages 477–488. Springer, 1986. Lecture Notes in Computer Science No. 218.
9. Joan Feigenbaum and Michael Merritt. Open questions, talk abstracts, and summary of discussions. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 2, pages 1–45, 1991.
10. Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM, 17(2):281–308, April 1988.
11. Robert Johnson, David Molnar, Dawn Song, and David Wagner. Homomorphic signature schemes. In Topics in Cryptology—CT-RSA 2002, pages 244–262. Springer, 2002. Lecture Notes in Computer Science No. 2271 (This Volume).
12. Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
13. T.P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In J. Feigenbaum, editor, Proceedings CRYPTO’91, pages 129–140. Springer, 1992. Lecture Notes in Computer Science No. 576.
14. Ronald L. Rivest, Leonard Adleman, and Michael L. Dertouzos. On data banks and privacy homomorphisms. In R. DeMillo, D. Dobkin, A. Jones, and R. Lipton, editors, Foundations of Secure Computation, pages 169–180. Academic Press, 1978.
15. 1. In Proceedings 40th IEEE Symposium on Foundations of Computer Science, pages 554–566, New York, 1999. IEEE.