3. PKC 2000: Melbourne, Victoria, Australia

@proceedings{DBLP:conf/pkc/2000,
  editor    = {Hideki Imai and
               Yuliang Zheng},
  title     = {Public Key Cryptography, Third International Workshop on Practice
               and Theory in Public Key Cryptography, PKC 2000, Melbourne, Victoria,
               Australia, January 18-20, 2000, Proceedings},
  booktitle = {Public Key Cryptography},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1751},
  year      = {2000},
  isbn      = {3-540-66967-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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