(Enter summary)
Abstract: We consider the problem of nding public-key digital signature
schemes with a transitive-closure property for signing the vertices and
edges of a (directed or undirected) nite 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 ecient
solution for undirected graphs, and leave the case for directed graphs
as an... (Update)
Cited by: More
Proxy Re-Signatures: New Definitions, Algorithms, and.. - Ateniese, Hohenberger (2005)
(Correct)
Append-Only Signatures - Kiltz, Mityagin, Panjwani, Raghavan (2005)
(Correct)
The One-More-RSA-Inversion Problems and the.. - Bellare.. (2001)
(Correct)
Active bibliography (related documents): More All
0.2: Homomorphic Signature Schemes - Johnson, Molnar, Song, Wagner (2002)
(Correct)
0.2: Towards Formal Analysis of Security Protocols - Mao, al. (1993)
(Correct)
0.2: Private Information Retrieval Using Trusted Hardware - Wang, Ding, Deng, Bao (2006)
(Correct)
Similar documents based on text: More All
0.6: A Transitive Signature Scheme Provably Secure Against.. - Zhu, Feng, Deng (2003)
(Correct)
0.3: An Efficient Signature Scheme for Route Aggregation - Chari, Rabin, Rivest (2002)
(Correct)
0.2: Zero-Knowledge with Public Keys - Reyzin (2001)
(Correct)
Related documents from co-citation: More All
7: The exact security of digital signatures---how to sign with RSA and Rabin
- Bellare, Rogaway - 1996
6: Incremental cryptography: the case of hashing and signing
- Bellare, Goldreich et al. - 1994
6: Accountable-subgroup multisignatures
- Micali, Ohta et al. - 2001
BibTeX entry: (Update)
S. Micali and R. Rivest. Transitive signature schemes. In RSA Conference 2002, 2002. http://citeseer.ist.psu.edu/micali02transitive.html More
@inproceedings{ micali02transitive,
author = "Silvio Micali and Ronald L. Rivest",
title = "Transitive Signature Schemes",
booktitle = "{CT}-{RSA}",
pages = "236-243",
year = "2002",
url = "citeseer.ist.psu.edu/micali02transitive.html" }
Citations (may not include all citations):
3972
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990 ACM
1065
Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1997 ACM
501
A digital signature scheme secure against adaptive chosen-me..
- Goldwasser, Micali et al. - 1988 ACM DBLP
326
Non-malleable cryptography
- Dolev, Dwork et al. - 1991 ACM
239
Blind signatures for untraceable payments (context) - Chaum - 1983 DBLP
159
Non-interactive and information-theoretic secure veri- able .. (context) - Pedersen - 1992
62
The transitive reduction of a directed graph (context) - Aho, Garey et al. - 1972 DBLP
46
On data banks and privacy homomorphisms (context) - Rivest, Adleman et al. - 1978
41
Cryptographically strong undeniable signatures
- Chaum, van Heijst et al. - 1992
35
Non-interactive cryptocomputing for NC
- Sander, Young et al. - 1999
21
Security without identication: Transaction systems to make b.. (context) - Chaum - 1985
20
Divertible protocols and atomic proxy cryptography (context) - Blaze, Bleumer et al. - 1998 DBLP
5
can you take advantage of someone without having to trust hi.. (context) - Feigenbaum, instances - 1986
4
and summary of discussions (context) - Feigenbaum, Merritt et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.lcs.mit.edu/~rivest/publications.html): More
Picking the Best Expert from a Sequence - Bergman, Rivest (1995)
(Correct)
Game Tree Searching by Min/Max Approximation - Rivest (1995)
(Correct)
Complete Variable-Length "Fix-Free" Codes - Gillman, Rivest (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC