31 search results - page 6 / 7 » Signatures on Randomizable Ciphertexts |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant of Matsumoto Imai cryptosystem C . However Patarin later found that Little Dragon ...
IJISEC
2007
13 years 7 months ago
2007
Universal Re-encryption allows El-Gamal ciphertexts to be re-encrypted without knowledge of their corresponding public keys. This has made it an enticing building block for anonymo...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
EUROCRYPT
2009
Springer
14 years 8 months ago
2009
Springer
A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish...
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...