Public key cryptography : third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000 : proceedings / Hideki Imai, Yuliang Zheng (eds.).

By: (3rd : International Workshop on Practice and Theory in Public Key Cryptography (3rd : 2000 : Melbourne, Vic.)
Contributor(s): Imai, Hideki, 1943- | Zheng, Yuliang, 1962-
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 1751.Publisher: Berlin ; New York : Springer, ©2000Description: 1 online resource (xi, 483 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540465881; 354046588XSubject(s): Computer security -- Congresses | Computers -- Access control -- Congresses | Data encryption (Computer science) -- Congresses | Public key cryptography -- Congresses | Computer security | Computers -- Access control | Data encryption (Computer science) | Public key cryptography | Cryptografie | Chipkaart | ComputerbeveiligingGenre/Form: Kongress | Melbourne (2000) | Electronic books. | Conference papers and proceedings. | Congressen (vorm) | Conference papers and proceedings. Additional physical formats: Print version:International Workshop on Practice and Theory in Public Key Cryptography (3rd : 2000 : Melbourne, Vic.): Public key cryptography : third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000 : proceedingsDDC classification: 005.8/2 LOC classification: QA76.9.A25 | I567 2000Other classification: 54.62 | AB 55 | PM 580 | DAT 465f | SS 4800 Online resources: Click here to access online
Contents:
A Practical and Secure Fault-Tolerant Conference-Key Agreement Protocol -- An Efficient NICE-Schnorr-Type Signature Scheme -- Identification of Bad Signatures in Batches -- Some Remarks on a Fair Exchange Protocol -- Gaudry's Variant against C ab Curves -- An Identification Scheme Based on Sparse Polynomials -- A State-Based Model for Certificate Management Systems -- Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence -- The Composite Discrete Logarithm and Secure Authentication -- Chosen-Ciphertext Security for Any One-Way Cryptosystem -- Short Proofs of Knowledge for Factoring -- Secure and Practical Tree-Structure Signature Schemes Based on Discrete Logarithms -- All-or-Nothing Transform and Remotely Keyed Encryption Protocols -- Security of Public Key Certificate Based Authentication Protocols -- Efficient Implementation of Schoof's Algorithm in Case of Characteristic 2 -- Key Recovery in Third Generation Wireless Communication Systems -- Elliptic Curves with the Montgomery-Form and Their Cryptographic Applications -- Certificates of Recoverability with Scalable Recovery Agent Security -- Design Validations for Discrete Logarithm Based Signature Schemes -- Optimally Efficient Accountable Time-Stamping -- "Pseudorandom Intermixing": A Tool for Shared Cryptography -- RSA-Based Auto-recoverable Cryptosystems -- Efficient and Fresh Certification -- Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions -- Cryptographic Approaches to Privacy in Forensic DNA Databases -- Making Hash Functions from Block Ciphers Secure and Efficient by Using Convolutional Codes -- Fast Implementation of Elliptic Curve Arithmetic in GF(p n) -- An Auction Protocol Which Hides Bids of Losers -- Forward Secrecy and Its Application to Future Mobile Communications Security -- Selecting Cryptographic Key Sizes -- A Structured ElGamal-Type Multisignature Scheme.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

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.

A Practical and Secure Fault-Tolerant Conference-Key Agreement Protocol -- An Efficient NICE-Schnorr-Type Signature Scheme -- Identification of Bad Signatures in Batches -- Some Remarks on a Fair Exchange Protocol -- Gaudry's Variant against C ab Curves -- An Identification Scheme Based on Sparse Polynomials -- A State-Based Model for Certificate Management Systems -- Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence -- The Composite Discrete Logarithm and Secure Authentication -- Chosen-Ciphertext Security for Any One-Way Cryptosystem -- Short Proofs of Knowledge for Factoring -- Secure and Practical Tree-Structure Signature Schemes Based on Discrete Logarithms -- All-or-Nothing Transform and Remotely Keyed Encryption Protocols -- Security of Public Key Certificate Based Authentication Protocols -- Efficient Implementation of Schoof's Algorithm in Case of Characteristic 2 -- Key Recovery in Third Generation Wireless Communication Systems -- Elliptic Curves with the Montgomery-Form and Their Cryptographic Applications -- Certificates of Recoverability with Scalable Recovery Agent Security -- Design Validations for Discrete Logarithm Based Signature Schemes -- Optimally Efficient Accountable Time-Stamping -- "Pseudorandom Intermixing": A Tool for Shared Cryptography -- RSA-Based Auto-recoverable Cryptosystems -- Efficient and Fresh Certification -- Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions -- Cryptographic Approaches to Privacy in Forensic DNA Databases -- Making Hash Functions from Block Ciphers Secure and Efficient by Using Convolutional Codes -- Fast Implementation of Elliptic Curve Arithmetic in GF(p n) -- An Auction Protocol Which Hides Bids of Losers -- Forward Secrecy and Its Application to Future Mobile Communications Security -- Selecting Cryptographic Key Sizes -- A Structured ElGamal-Type Multisignature Scheme.

There are no comments for this item.

to post a comment.

Powered by Koha