Sciweavers

30 search results - page 6 / 6
» pkc 2005
Sort
View
MYCRYPT
2005
Springer
123views Cryptology» more  MYCRYPT 2005»
13 years 10 months ago
Optimization of the MOVA Undeniable Signature Scheme
This article presents optimization results on the recent MOVA undeniable signature scheme presented by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at ...
Jean Monnerat, Yvonne Anne Oswald, Serge Vaudenay
PKC
2005
Springer
167views Cryptology» more  PKC 2005»
13 years 10 months ago
Converse Results to the Wiener Attack on RSA
A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-...
Ron Steinfeld, Scott Contini, Huaxiong Wang, Josef...
PKC
2005
Springer
144views Cryptology» more  PKC 2005»
13 years 10 months ago
RSA with Balanced Short Exponents and Its Application to Entity Authentication
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
Hung-Min Sun, Cheng-Ta Yang
EUC
2005
Springer
13 years 10 months ago
Collision Attack on XTR and a Countermeasure with a Fixed Pattern
Public-key cryptosystem (PKC) is one of inevitable key technologies in order to accomplish fruitful security applications in ubiquitous computing systems. The ubiquitous computer o...
Dong-Guk Han, Tsuyoshi Takagi, Tae-Hyun Kim, Howon...
JUCS
2008
156views more  JUCS 2008»
13 years 4 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng