Abstract is missing.
- A Practical and Secure-Fault-Tolerant Conferenc-Key Agreement ProtocolWen-Guey Tzeng. 1-13
- An Efficient NICE-Schnorr-Type Signature SchemeDetlef Hühnlein, Johannes Merkle. 14-27
- Identification of Bad Signatures in BatchesJaroslaw Pastuszak, Dariusz Michatek, Josef Pieprzyk, Jennifer Seberry. 28-45
- Some Remarks on a Fair Exchange ProtocolJianying Zhou, Robert H. Deng, Feng Bao. 46-57
- Gaudry s Variant against C::ab:: CurvesSeigo Arita. 58-67
- An Identification Scheme Based on Sparse PolynomialsWilliam D. Banks, Daniel Lieman, Igor Shparlinski. 68-74
- A State-Based Model for Certificate Management SystemsChuchang Liu, Maris A. Ozols, Marie Henderson, Anthony Cant. 75-92
- Confidence Valuation in a Public-Key Infrastructure Based on Uncertain EvidenceReto Kohlas, Ueli M. Maurer. 93-112
- The Composite Discrete Logarithm and Secure AuthenticationDavid Pointcheval. 113-128
- Chosen-Ciphertext Security for Any One-Way CryptosystemDavid Pointcheval. 129-146
- Short Proofs of Knowledge for FactoringGuillaume Poupard, Jacques Stern. 147-166
- Secure and Practical Tree-Structure Signature Schemes Based on Discrete LogarithmsXiaoyun Wang, Lucas Chi Kwong Hui, K. P. Chow, Wai Wan Tsang, C. F. Chong, H. W. Chan. 167-177
- All-or-Nothing Transform and Remotely Keyed Encription ProtocolsSang Uk Shin, Weon Shin, Kyung Hyune Rhee. 178-195
- Security of Public Key Certificate Based Authentication ProtocolsWu Wen, Takamichi Saito, Fumio Mizoguchi. 196-209
- Efficient Implementation of Schoof s Algorithm in Case of Characteristic 2Tetsuya Izu, Jun Kogure, Kazuhiro Yokoyama. 210-222
- Key Recovery in Third Generation Wireless Communication SystemsJuanma González Nieto, DongGook Park, Colin Boyd, Ed Dawson. 223-237
- Elliptic Curves with the Montgomery-Form and Their Cryptographic ApplicationsKatsuyuki Okeya, Hiroyuki Kurumatani, Kouichi Sakurai. 238-257
- Certificates of Recoverability with Scale Recovery Agent SecurityEric R. Verheul. 258-275
- Design Validations for Discrete Logarithm Based Signature SchemesErnest F. Brickell, David Pointcheval, Serge Vaudenay, Moti Yung. 276-292
- Optimally Efficient Accountable Time-StampingAhto Buldas, Helger Lipmaa, Berry Schoenmakers. 293-305
- Psyeudorandom Intermixing : A Tool for Shared CryptographyYair Frankel, Philip D. MacKenzie, Moti Yung. 306-325
- RSA-Based Auto-recoverable CryptosystemsAdam Young, Moti Yung. 326-341
- Efficient and Fresh CerificationIrene Gassko, Peter Gemmell, Philip D. MacKenzie. 342-353
- Efficient Zero-Knowledge Proofs of Knowledge Without Intractability AssumptionsRonald Cramer, Ivan Damgård, Philip D. MacKenzie. 354-373
- Cryptographic Approaches to Provacy in Forensic DNA DatabasesPhilip Bohannon, Markus Jakobsson, Sukamol Srikwan. 373-390
- Making Hash Functions From Block Ciphers Secure and Efficient by Using Convolutional CodesToro Inoue, Kouichi Sakurai. 391-404
- Fast Implementation of Elliptic Curve Arithmetic in GF(p:::n:::)Chae Hoon Lim, Hyo Sun Hwang. 405-421
- An Auction Protocol Which Hides Bids of LosersKazue Sako. 422-432
- Forward Secrecy and Its Application to Future Mobile Communications SecurityDongGook Park, Colin Boyd, Sang-Jae Moon. 433-445
- Selecting Cryptographic Key SizesArjen K. Lenstra, Eric R. Verheul. 446-465
- A Structured ElGamal-Type Multisignature SchemeMike Burmester, Yvo Desmedt, Hiroshi Doi, Masahiro Mambo, Eiji Okamoto, Mitsuru Tada, Yuko Yoshifuji. 466-483