Sciweavers

Share
6 search results - page 1 / 2
» Short Transitive Signatures for Directed Trees
Sort
View
IACR
2011
104views more  IACR 2011»
8 years 3 months ago
Short Transitive Signatures for Directed Trees
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 ...
Philippe Camacho, Alejandro Hevia
TCS
2008
9 years 3 months ago
A simple transitive signature scheme for directed trees
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...
Gregory Neven
CTRSA
2007
Springer
112views Cryptology» more  CTRSA 2007»
9 years 9 months ago
Directed Transitive Signature Scheme
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...
Xun Yi
PCM
2004
Springer
224views Multimedia» more  PCM 2004»
9 years 9 months ago
Fast and Robust Short Video Clip Search for Copy Detection
Query by video clip (QVC) has attracted wide research interests in multimedia information retrieval. In general, QVC may include feature extraction, similaritymeasure,databaseorgan...
Junsong Yuan, Ling-Yu Duan, Qi Tian, Surendra Rang...
AAECC
2006
Springer
102views Algorithms» more  AAECC 2006»
9 years 3 months ago
An effective proof of the well-foundedness of the multiset path ordering
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
Solange Coupet-Grimal, William Delobel
books