Sciweavers

56 search results - page 9 / 12
» An Efficient Group Signature Based on the Discrete Logarithm...
Sort
View
95
Voted
QCQC
1998
Springer
110views Communications» more  QCQC 1998»
15 years 3 months ago
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
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 ...
Michele Mosca, Artur Ekert
98
Voted
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
15 years 4 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
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 ...
Daniel R. L. Brown, Donald Byron Johnson
ICICS
2004
Springer
15 years 5 months ago
Factorization-Based Fail-Stop Signatures Revisited
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...
Katja Schmidt-Samoa
ACISP
2006
Springer
15 years 3 months ago
Efficient Identity-Based Signatures Secure in the Standard Model
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...
Kenneth G. Paterson, Jacob C. N. Schuldt
EUROCRYPT
1998
Springer
15 years 3 months ago
A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption
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 ...
Detlef Hühnlein, Michael J. Jacobson Jr., Sac...