IACR Archive     By conference     Most prolific     All committees     Most committees     Report errors     What's new

Proceedings of PKC 2005

Public Key Cryptography - PKC 2005, 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23-26, 2005, Proceedings , Springer
A New Related Message Attack on RSA., Oded Yacobi, Yacov Yacobi, pp. 1-8
 PDF  postscript BibTeX
Breaking a Cryptographic Protocol with Pseudoprimes., Daniel Bleichenbacher, pp. 9-15
 PDF  postscript BibTeX
Experimenting with Faults, Lattices and the DSA., David Naccache, Phong Q. Nguyen, Michael Tunstall, Claire Whelan, pp. 16-28
 PDF  postscript BibTeX
Securing RSA-KEM via the AES., Jakob Jonsson, Matthew J. B. Robshaw, pp. 29-46
 PDF  postscript BibTeX
One-Time Verifier-Based Encrypted Key Exchange., Michel Abdalla, Olivier Chevassut, David Pointcheval, pp. 47-64
 PDF  postscript BibTeX
Password-Based Authenticated Key Exchange in the Three-Party Setting., Michel Abdalla, Pierre-Alain Fouque, David Pointcheval, pp. 65-84
 PDF  postscript BibTeX
On the Optimization of Side-Channel Attacks by Advanced Stochastic Methods., Werner Schindler, pp. 85-103
 PDF  postscript BibTeX
Symmetric Subgroup Membership Problems., Kristian Gjøsteen, pp. 104-119
 PDF  postscript BibTeX
Optimizing Robustness While Generating Shared Secret Safe Primes., Emil Ong, John Kubiatowicz, pp. 120-137
 PDF  postscript BibTeX
Fast Multi-computations with Integer Similarity Strategy., Wu-Chuan Yang, Dah-Jyh Guan, Chi-Sung Laih, pp. 138-153
 PDF  postscript BibTeX
Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order., Endre Bangerter, Jan Camenisch, Ueli M. Maurer, pp. 154-171
 PDF  postscript BibTeX
Efficient k-Out-of-n Oblivious Transfer Schemes with Adaptive and Non-adaptive Queries., Cheng-Kang Chu, Wen-Guey Tzeng, pp. 172-183
 PDF  postscript BibTeX
Converse Results to the Wiener Attack on RSA., Ron Steinfeld, Scott Contini, Huaxiong Wang, Josef Pieprzyk, pp. 184-198
 PDF  postscript BibTeX
RSA with Balanced Short Exponents and Its Application to Entity Authentication., Hung-Min Sun, Cheng-Ta Yang, pp. 199-215
 PDF  postscript BibTeX
The Sampling Twice Technique for the RSA-Based Cryptosystems with Anonymity., Ryotaro Hayashi, Keisuke Tanaka, pp. 216-233
 PDF  postscript BibTeX
From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited., Julien Cathalo, Jean-Sébastien Coron, David Naccache, pp. 234-243
 PDF  postscript BibTeX
Tractable Rational Map Signature., Lih-Chung Wang, Yuh-Hua Hu, Feipei Lai, Chun-yen Chou, Bo-Yin Yang, pp. 244-257
 PDF  postscript BibTeX
Cryptanalysis of the Tractable Rational Map Cryptosystem., Antoine Joux, Sébastien Kunz-Jacques, Frédéric Muller, Pierre-Michel Ricordel, pp. 258-274
 PDF  postscript BibTeX
Large Superfluous Keys in Multivariate Quadratic Asymmetric Systems., Christopher Wolf, Bart Preneel, pp. 275-287
 PDF  postscript BibTeX
Cryptanalysis of HFEv and Internal Perturbation of HFE., Jintai Ding, Dieter Schmidt, pp. 288-301
 PDF  postscript BibTeX
A Generic Scheme Based on Trapdoor One-Way Permutations with Signatures as Short as Possible., Louis Granboulan, pp. 302-312
 PDF  postscript BibTeX
Cramer-Damgård Signatures Revisited: Efficient Flat-Tree Signatures Based on Factoring., Dario Catalano, Rosario Gennaro, pp. 313-327
 PDF  postscript BibTeX
The Security of the FDH Variant of Chaum's Undeniable Signature Scheme., Wakaha Ogata, Kaoru Kurosawa, Swee-Huay Heng, pp. 328-345
 PDF  postscript BibTeX
Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions., Ivan Damgård, Kasper Dupont, pp. 346-361
 PDF  postscript BibTeX
Improved Identity-Based Signcryption., Liqun Chen, John Malone-Lee, pp. 362-379
 PDF  postscript BibTeX
Efficient Multi-receiver Identity-Based Encryption and Its Application to Broadcast Encryption., Joonsang Baek, Reihaneh Safavi-Naini, Willy Susilo, pp. 380-397
 PDF  postscript BibTeX
CBE from CL-PKE: A Generic Construction and Efficient Schemes., Sattam S. Al-Riyami, Kenneth G. Paterson, pp. 398-415
 PDF  postscript BibTeX
A Verifiable Random Function with Short Proofs and Keys., Yevgeniy Dodis, Aleksandr Yampolskiy, pp. 416-431
 PDF  postscript BibTeX

[ IACR home page ] © IACR