E-Book, Englisch, Band 1751, 490 Seiten, eBook
Imai / Zheng Public Key Cryptography
Erscheinungsjahr 2004
ISBN: 978-3-540-46588-1
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
Third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000, Proceedings
E-Book, Englisch, Band 1751, 490 Seiten, eBook
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-46588-1
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
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.
