Sciweavers

112 search results - page 8 / 23
» Short Randomizable Signatures
Sort
View
LATINCRYPT
2010
13 years 5 months ago
A Lattice-Based Threshold Ring Signature Scheme
In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar’s code-based solution to use the short integer solution (SIS) problem as securi...
Pierre-Louis Cayrel, Richard Lindner, Markus R&uum...
IJNSEC
2008
129views more  IJNSEC 2008»
13 years 7 months ago
Repairing Efficient Threshold Group Signature Scheme
To enhance the efficiency of threshold group signature schemes, Yu and Chen, recently, proposed an efficient threshold group signature scheme. By using elliptic curves, the propos...
Zuhua Shao
ASIACRYPT
2006
Springer
13 years 11 months ago
Analysis of One Popular Group Signature Scheme
The group signature scheme [1], ACJT for short, is popular. In this paper we show that it is not secure. It does not satisfy exculpability. The group manager can sign on behalf of ...
Zhengjun Cao
ACNS
2008
Springer
132views Cryptology» more  ACNS 2008»
14 years 1 months ago
Generic Security-Amplifying Methods of Ordinary Digital Signatures
We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), fro...
Jin Li, Kwangjo Kim, Fangguo Zhang, Duncan S. Wong
PKC
2004
Springer
150views Cryptology» more  PKC 2004»
14 years 24 days ago
Undeniable Signatures Based on Characters: How to Sign with One Bit
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
Jean Monnerat, Serge Vaudenay