127 search results - page 2 / 26 » On Cryptographic Schemes Based on Discrete Logarithms and Fa... |
AINA
2003
IEEE
13 years 8 months ago
2003
IEEE
In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm....
JOC
2006
13 years 5 months ago
2006
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
SCN
2004
Springer
13 years 10 months ago
2004
Springer
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...
ICICS
2004
Springer
13 years 10 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...
PKC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...