Sciweavers

30 search results - page 3 / 6
» pkc 2005
Sort
View
PKC
2005
Springer
94views Cryptology» more  PKC 2005»
14 years 3 months ago
The Security of the FDH Variant of Chaum's Undeniable Signature Scheme
In this paper, we first introduce a new kind of adversarial goal called forge-and-impersonate in undeniable signature schemes. Note that forgeability does not necessarily imply im...
Wakaha Ogata, Kaoru Kurosawa, Swee-Huay Heng
PKC
2005
Springer
93views Cryptology» more  PKC 2005»
14 years 3 months ago
Optimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
Emil Ong, John Kubiatowicz
PKC
2005
Springer
114views Cryptology» more  PKC 2005»
14 years 3 months ago
Cryptanalysis of the Tractable Rational Map Cryptosystem
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show co...
Antoine Joux, Sébastien Kunz-Jacques, Fr&ea...
PKC
2005
Springer
192views Cryptology» more  PKC 2005»
14 years 3 months ago
Securing RSA-KEM via the AES
RSA-KEM is a popular key encapsulation mechanism that combines the RSA trapdoor permutation with a key derivation function (KDF). Often the details of the KDF are viewed as orthogo...
Jakob Jonsson, Matthew J. B. Robshaw
PKC
2005
Springer
109views Cryptology» more  PKC 2005»
14 years 3 months ago
Fast Multi-computations with Integer Similarity Strategy
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...
Wu-Chuan Yang, Dah-Jyh Guan, Chi-Sung Laih