Sciweavers

326 search results - page 8 / 66
» Digital Signature Scheme Based on a New Hard Problem
Sort
View
IJSN
2006
96views more  IJSN 2006»
14 years 11 months ago
A new signature scheme without random oracles
In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new ...
Chik How Tan
ASIACRYPT
2001
Springer
15 years 3 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
ATC
2007
Springer
15 years 6 months ago
Identity-Based Proxy Signature from Pairings
A proxy signature scheme allows an entity to delegate its signing capability to another entity (proxy) in such a way that the proxy can sign messages on behalf of the delegator. Pr...
Wei Wu, Yi Mu, Willy Susilo, Jennifer Seberry, Xin...
TCS
2008
14 years 11 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
CCS
2010
ACM
14 years 12 months ago
Synchronized aggregate signatures: new definitions, constructions and applications
An aggregate signature scheme is a digital signature scheme where anyone given n signatures on n messages from n users can aggregate all these signatures into a single short signa...
Jae Hyun Ahn, Matthew Green, Susan Hohenberger