PKC
2004
Springer
13 years 10 months ago
2004
Springer
In a practical system, a message is often encrypted more than once by different encryptions, here called multiple encryption, to enhance its security. Additionally, new features ...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
PKC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construc...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Bellare, Boldyreva, Desai, and Pointcheval [1] recently proposed a new security requirement of the encryption schemes called “keyprivacy.” It asks that the encryption...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
PKC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
PKC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identi...