Name
Abstract | ||
|---|---|---|
We consider the problem of nding public-key digital signatureschemes with a transitive-closure property for signing the vertices andedges of a (directed or undirected) nite graph. More precisely, wewant the property that if Alice has signed edge (u; v) and she has alsosigned the edge (v; w) then Bob (or anyone) can derive from those twosignatures Alice's signature on the edge (u; w). We present an ecientsolution for undirected graphs, and leave the case for directed graphsas an... |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-45760-7_16 | The Cryptographer's Track at RSA Conference |
Keywords | Field | DocType |
transitive digital signature scheme,digital signatures,following property,legitimate signer,adaptive fashion,public-key cryptography,legitimate signature,new vertex,graph g,transitive signature schemes,transi- tive closure.,graphs,sign vertex,digital signature,public key cryptography,public key,transitive closure | Discrete mathematics,Graph,Vertex (geometry),Adaptive method,Computer science,Digital signature,Cryptosystem,Transitive closure,Public-key cryptography,Transitive relation | Conference |
ISBN | Citations | PageRank |
3-540-43224-8 | 60 | 4.58 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Silvio Micali | 1 | 11434 | 2581.31 |
| Ronald L. Rivest | 2 | 11992 | 3759.47 |