78 search results - page 4 / 16 » (Convertible) Undeniable Signatures Without Random Oracles |
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
PQCRYPTO
2010
13 years 11 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 ...
IJNSEC
2011
13 years 2 months ago
2011
We first analyze the security of a short signature scheme without random oracles called ZCSM scheme and point out that it cannot support unforgeable under the chosen message and ...
IJSN
2006
13 years 7 months ago
2006
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 ...