This book constitutes the refereed proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography, PKC 2000, held in Melbourne, Victoria, Australia, in January 2000.
The 31 revised full papers presented were carefully reviewed and selected from 70 submissions. Among the topics addressed are cryptographic protocols, digital signature schemes, elliptic curve cryptography, discrete logarithm, authentication, encryption protocols, key recovery, time stamping, shared cryptography, certification, zero-knowledge proofs, auction protocols, and mobile communications security.
Author(s): Wen-Guey Tzeng (auth.), Hideki Imai, Yuliang Zheng (eds.)
Series: Lecture Notes in Computer Science 1751
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2000
Language: English
Pages: 490
Tags: Data Encryption; Algorithm Analysis and Problem Complexity; Operating Systems; Computer Communication Networks; Management of Computing and Information Systems
Front Matter....Pages -
A Practical and Secure Fault-Tolerant Conference-Key Agreement Protocol....Pages 1-13
An Efficient NICE-Schnorr-Type Signature Scheme....Pages 14-27
Identification of Bad Signatures in Batches....Pages 28-45
Some Remarks on a Fair Exchange Protocol....Pages 46-57
Gaudry’s Variant against C ab Curves....Pages 58-67
An Identification Scheme Based on Sparse Polynomials....Pages 68-74
A State-Based Model for Certificate Management Systems....Pages 75-92
Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence....Pages 93-112
The Composite Discrete Logarithm and Secure Authentication....Pages 113-128
Chosen-Ciphertext Security for Any One-Way Cryptosystem....Pages 129-146
Short Proofs of Knowledge for Factoring....Pages 147-166
Secure and Practical Tree-Structure Signature Schemes Based on Discrete Logarithms....Pages 167-177
All-or-Nothing Transform and Remotely Keyed Encryption Protocols....Pages 178-195
Security of Public Key Certificate Based Authentication Protocols....Pages 196-209
Efficient Implementation of Schoof’s Algorithm in Case of Characteristic 2....Pages 210-222
Key Recovery in Third Generation Wireless Communication Systems....Pages 223-237
Elliptic Curves with the Montgomery-Form and Their Cryptographic Applications....Pages 238-257
Certificates of Recoverability with Scalable Recovery Agent Security....Pages 258-275
Design Validations for Discrete Logarithm Based Signature Schemes....Pages 276-292
Optimally Efficient Accountable Time-Stamping....Pages 293-305
“Pseudorandom Intermixing”: A Tool for Shared Cryptography....Pages 306-325
RSA-Based Auto-recoverable Cryptosystems....Pages 326-341
Efficient and Fresh Certification....Pages 342-353
Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions....Pages 354-372
Cryptographic Approaches to Privacy in Forensic DNA Databases....Pages 373-390
Making Hash Functions from Block Ciphers Secure and Efficient by Using Convolutional Codes....Pages 391-404
Fast Implementation of Elliptic Curve Arithmetic in GF( p n )....Pages 405-421
An Auction Protocol Which Hides Bids of Losers....Pages 422-432
Forward Secrecy and Its Application to Future Mobile Communications Security....Pages 433-445
Selecting Cryptographic Key Sizes....Pages 446-465
A Structured ElGamal-Type Multisignature Scheme....Pages 466-483
Back Matter....Pages -
