24 search results - page 1 / 5 » A simple transitive signature scheme for directed trees |
TCS
2008
13 years 4 months ago
2008
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
CTRSA
2007
Springer
13 years 10 months ago
2007
Springer
In 2002, Micali and Rivest raised an open problem as to whether directed transitive signatures exist or not. In 2003, Hohenberger formalized the necessary mathematical criteria for...
IACR
2011
12 years 4 months ago
2011
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
PQCRYPTO
2010
13 years 8 months ago
2010
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
SIBGRAPI
2008
IEEE
13 years 11 months ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...