56 search results - page 9 / 12 » An Efficient Group Signature Based on the Discrete Logarithm... |
169
click to vote
QCQC
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...
169
click to vote
CTRSA
2001
Springer
15 years 10 months ago
2001
Springer
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
158
click to vote
ICICS
2004
Springer
15 years 11 months ago
2004
Springer
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
167
click to vote
ACISP
2006
Springer
15 years 9 months ago
2006
Springer
The only known construction of identity-based signatures that can be proven secure in the standard model is based on the approach of attaching certificates to non-identity-based si...
171
click to vote
EUROCRYPT
1998
Springer
15 years 10 months ago
1998
Springer
We introduce a new cryptosystem with trapdoor decryption based on the di culty of computing discrete logarithms in the class group of the non-maximal imaginary quadratic order O q ...