Advances in Cryptology - ASIACRYPT 2001 7th International Conference on the Theory and Application of Cryptology and Information Security Gold Coast, Australia, December 9-13, 2001. Proceedings /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Boyd, Colin (Editor, http://id.loc.gov/vocabulary/relators/edt)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Edition: 1st ed. 2001.
• Series: Lecture Notes in Computer Science, 2248
• Subjects: Data encryption (Computer science).; Computer science-Mathematics.; Operating systems (Computers).; Algorithms.; Computer communication systems.; Management information systems.; Computer science.; Cryptology.; Discrete Mathematics in Computer Science.; Operating Systems.; Algorithm Analysis and Problem Complexity.; Computer Communication Networks.; Management of Computing and Information Systems.

The origins of the Asiacrypt series of conferences can be traced back to 1990, when the ?rst Auscrypt conference was held, although the name Asiacrypt was ?rst used for the 1991 conference in Japan. Starting with Asiacrypt 2000, the conference is now one of three annual conferences organized by the...

Table of Contents:

• Lattice Based Cryptography
• Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001
• On the Insecurity of a Server-Aided RSA Protocol
• The Modular Inversion Hidden Number Problem
• Human Identification
• Secure Human Identification Protocols
• Invited Talk
• Unbelievable Security Matching AES Security Using Public Key Systems
• Practical Public Key Cryptography
• A Probable Prime Test with Very High Confidence for n ? 1 mod 4
• Computation of Discrete Logarithms in
• Speeding Up XTR
• An Efficient Implementation of Braid Groups
• Cryptography Based on Coding Theory
• How to Achieve a McEliece-Based Digital Signature Scheme
• Efficient Traitor Tracing Algorithms Using List Decoding
• Block Ciphers
• Security of Reduced Version of the Block Cipher Camellia against Truncated and Impossible Differential Cryptanalysis
• Known-IV Attacks on Triple Modes of Operation of Block Ciphers
• Generic Attacks on Feistel Schemes
• A Compact Rijndael Hardware Architecture with S-Box Optimization
• Provable Security
• Provable Security of KASUMI and 3GPP Encryption Mode f8
• Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices
• Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case
• Threshold Cryptography
• Fully Distributed Threshold RSA under Standard Assumptions
• Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes
• Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
• Two-Party Protocols
• Oblivious Polynomial Evaluation and Oblivious Neural Learning
• Mutually Independent Commitments
• Zero Knowledge
• Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
• Responsive Round Complexity and Concurrent Zero-Knowledge
• Cryptographic Building Blocks
• Practical Construction and Analysis of Pseudo-Randomness Primitives
• Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
• Elliptic Curve Cryptography
• An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves
• Supersingular Curves in Cryptography
• Short Signatures from the Weil Pairing
• Self-Blindable Credential Certificates from the Weil Pairing
• Anonymity
• How to Leak a Secret
• Key-Privacy in Public-Key Encryption
• Provably Secure air Blind Signatures with Tight Revocation.