111 search results - page 10 / 23 » New Public Key Cryptosystems Based on the Dependent-RSA Prob... |
112
Voted
ASIACRYPT
2001
Springer
15 years 3 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
104
Voted
CARDIS
1998
Springer
15 years 3 months ago
1998
Springer
In this paper we describe new secure personalization schemes using proxy cryptography. We first introduce the context of a large scale smart card application such as an electronic ...
IACR
2011
13 years 11 months ago
2011
The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study th...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
79
Voted
AMC
2005
14 years 11 months ago
2005
Abstract. Key authentication is very important in secret communications and data security. Recently, Lee, Hwang and Li proposed a new public key authentication scheme for cryptosys...