Sciweavers

1528 search results - page 4 / 306
» On Signatures for Communication Graphs
Sort
View
GBRPR
2009
Springer
14 years 2 months ago
Graph Matching Based on Node Signatures
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
Salim Jouili, Salvatore Tabbone
IACR
2011
104views more  IACR 2011»
12 years 7 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
FC
1998
Springer
134views Cryptology» more  FC 1998»
13 years 11 months ago
Group Blind Digital Signatures: A Scalable Solution to Electronic Cash
In this paper we construct a practical group blind signature scheme. Our scheme combines the already existing notions of blind signatures and group signatures. It is an extension o...
Anna Lysyanskaya, Zulfikar Ramzan
SCN
2008
Springer
105views Communications» more  SCN 2008»
13 years 7 months ago
Expressive Subgroup Signatures
In this work, we propose a new generalization of the notion of group signatures, that allows signers to cover the entire spectrum from complete disclosure to complete anonymity. Pr...
Xavier Boyen, Cécile Delerablée
ASIACRYPT
2009
Springer
14 years 2 months ago
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
Vadim Lyubashevsky