Cantitate/Preț
Produs

Public Key Cryptography

Editat de Hideki Imai, Yuliang Zheng
en Limba Engleză Paperback – 5 ian 2000
This book constitutes the refereed proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography, PKC'98, held in Pacifico Yokohama, Japan, in February 1998.
The volume presents four invited contributions together with 18 revised full papers selected from 30 submissions. The papers address all current issues in research and design in the area including digital signature schemes, digital payment systems, electronic commerce, cryptographic protocols, as well as foundational issues like integer factorization, elliptic curve aspects, hash functions, finite fields, etc.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (3) 32136 lei  6-8 săpt.
  Springer – 24 iun 1998 32136 lei  6-8 săpt.
  Springer – 17 feb 1999 32441 lei  6-8 săpt.
  Springer – 5 ian 2000 33260 lei  6-8 săpt.

Preț: 33260 lei

Preț vechi: 41575 lei
-20%

Puncte Express: 499

Preț estimativ în valută:
5881 6744$ 5083£

Carte tipărită la comandă

Livrare economică 27 aprilie-11 mai


Specificații

ISBN-13: 9783540669678
ISBN-10: 3540669671
Pagini: 504
Ilustrații: XIV, 490 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.76 kg
Ediția:2000
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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 MobileCommunications Security.- Selecting Cryptographic Key Sizes.- A Structured ElGamal-Type Multisignature Scheme.

Caracteristici

Includes supplementary material: sn.pub/extras