Transitive Signature Schemes

  • Silvio Micali
  • Ronald L. Rivest
Conference paper

DOI: 10.1007/3-540-45760-7_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2271)
Cite this paper as:
Micali S., Rivest R.L. (2002) Transitive Signature Schemes. In: Preneel B. (eds) Topics in Cryptology — CT-RSA 2002. CT-RSA 2002. Lecture Notes in Computer Science, vol 2271. Springer, Berlin, Heidelberg

Abstract

We introduce and provide the first example of a transitive digital signature scheme. Informally, this is a way to digitally sign vertices and edges of a dynamically growing, transitively closed, graph G so as to guarantee the following properties:

Given the signatures of edges (u, v) and (v,w), anyone can easily derive the digital signature of the edge (u,w).

It is computationaly hard for any adversary to forge the digital signature of any new vertex or other edge of G, even if he can request the legitimate signer to digitally sign any number of G’s vertices and edges of his choice in an adaptive fashion (i.e., even if he can choose which vertices and edges the legitimate signer should sign next after he sees the legitimate signatures of the ones requested so far).

Keywords

public-key cryptography digital signatures graphs transitive closure 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Silvio Micali
    • 1
  • Ronald L. Rivest
    • 1
  1. 1.Laboratory for Computer ScienceMassachusetts Institute of TechnologyCambridge

Personalised recommendations