Transitive Signature Schemes (2002)
| Venue: | IN PROCEEDINGS OF RSA 2002, VOLUME 2271 OF LNCS |
| Citations: | 45 - 8 self |
BibTeX
@INPROCEEDINGS{Micali02transitivesignature,
author = {Silvio Micali and Ronald L. Rivest},
title = {Transitive Signature Schemes},
booktitle = {IN PROCEEDINGS OF RSA 2002, VOLUME 2271 OF LNCS},
year = {2002},
pages = {236--243},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We consider the problem of finding public-key digital signature schemes with a transitive-closure property for signing the vertices and edges of a (directed or undirected) finite graph. More precisely, we want the property that if Alice has signed edge (u, v) and she has also signed the edge (v, w) then Bob (or anyone) can derive from those two signatures Alice's signature on the edge (u, w). We present an efficient solution for undirected graphs, and leave the case for directed graphs as an open problem.
Citations
| 7320 | Introduction to Algorithms - CORMEN, LEISERSON, et al. - 1985 |
| 410 | Nonmalleable cryptography - Dolev, Dwork, et al. - 2000 |
| 132 | The transitive reduction of a directed graph - Aho - 1972 |
| 125 | signatures for untraceable payments - Blind - 1983 |
| 62 | Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer - Chaum, Heijst, et al. - 1992 |
| 52 | Divertible protocols and atomic proxy cryptography - Blaze, Bleumer, et al. - 1998 |
| 14 | Security without Identi Transaction Systems to Make Bib Brother Obsolete - Chaum |
| 1 | Encrypting problem instances: Or...can you take advantage of someone without having to trust him - Feigenbaum - 1986 |
