1 option
Public Key Cryptography : Third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000, Proceedings / edited by Hideki Imai, Yuliang Zheng.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1751.
- Lecture Notes in Computer Science, 0302-9743 ; 1751
- Language:
- English
- Subjects (All):
- Data encryption (Computer science).
- Computer programming.
- Operating systems (Computers).
- Algorithms.
- Computer networks.
- Management information systems.
- Computer science.
- Cryptology.
- Programming Techniques.
- Operating Systems.
- Algorithm Analysis and Problem Complexity.
- Computer Communication Networks.
- Management of Computing and Information Systems.
- Local Subjects:
- Cryptology.
- Programming Techniques.
- Operating Systems.
- Algorithm Analysis and Problem Complexity.
- Computer Communication Networks.
- Management of Computing and Information Systems.
- Physical Description:
- 1 online resource (XIV, 490 pages).
- Edition:
- First edition 2000.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
- System Details:
- text file PDF
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-46588-1
- 9783540465881
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.