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 Inter- tional Association for Cryptologic Research (IACR). The continuing success of Asiacrypt is in no small part due to the e?orts of the Asiacrypt Steering C- mittee (ASC) and the strong support of the IACR Board of Directors. There were 153 papers submitted to Asiacrypt 2001 and 33 of these were accepted for inclusion in these proceedings. The authors of every paper, whether accepted or not, made a valued contribution to the success of the conference. Sending out rejection noti?cations to so many hard working authors is one of the most unpleasant tasks of the Program Chair. The review process lasted some 10 weeks and consisted of an initial refe- eing phase followed by an extensive discussion period. My heartfelt thanks go to all members of the Program Committee who put in extreme amounts of time to give their expert analysis and opinions on the submissions. All papers were reviewed by at least three committee members; in many cases, particularly for those papers submitted by committee members, additional reviews were obt- ned. Specialist reviews were provided by an army of external reviewers without whom our decisions would have been much more di?cult.
Author(s): Craig Gentry, Jakob Jonsson, Jacques Stern, Michael Szydlo (auth.), Colin Boyd (eds.)
Series: Lecture Notes in Computer Science 2248
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2001
Language: English
Pages: 601
Tags: Data Encryption; Discrete Mathematics in Computer Science; Operating Systems; Algorithm Analysis and Problem Complexity; Computer Communication Networks; Management of Computing and Information Systems
Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001....Pages 1-20
On the Insecurity of a Server-Aided RSA Protocol....Pages 21-35
The Modular Inversion Hidden Number Problem....Pages 36-51
Secure Human Identification Protocols....Pages 52-66
Unbelievable Security Matching AES Security Using Public Key Systems ....Pages 67-86
A Probable Prime Test with Very High Confidence for n ≡ 1 mod 4....Pages 87-106
Speeding Up XTR....Pages 107-124
An Efficient Implementation of Braid Groups....Pages 125-143
How to Achieve a McEliece-Based Digital Signature Scheme....Pages 144-156
Efficient Traitor Tracing Algorithms Using List Decoding....Pages 157-174
Security of Reduced Version of the Block Cipher Camellia against Truncated and Impossible Differential Cryptanalysis....Pages 175-192
Known-IV Attacks on Triple Modes of Operation of Block Ciphers....Pages 193-207
Generic Attacks on Feistel Schemes....Pages 208-221
A Compact Rijndael Hardware Architecture with S-Box Optimization....Pages 222-238
Provable Security of KASUMI and 3GPP Encryption Mode f 8....Pages 239-254
Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices....Pages 255-271
Provably Authenticated Group Diffie-Hellman Key Exchange — The Dynamic Case....Pages 272-289
Fully Distributed Threshold RSA under Standard Assumptions....Pages 290-309
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes....Pages 310-330
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks....Pages 331-350
Oblivious Polynomial Evaluation and Oblivious Neural Learning....Pages 351-368
Mutually Independent Commitments....Pages 369-384
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank....Pages 385-401
Responsive Round Complexity and Concurrent Zero-Knowledge....Pages 402-421
Practical Construction and Analysis of Pseudo-Randomness Primitives....Pages 422-441
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions....Pages 442-459
An Extension of Kedlaya’s Point-Counting Algorithm to Superelliptic Curves....Pages 460-479
Supersingular Curves in Cryptography....Pages 480-494
Short Signatures from the Weil Pairing....Pages 495-513
Self-Blindable Credential Certificates from the Weil Pairing....Pages 514-532
How to Leak a Secret....Pages 533-551
Key-Privacy in Public-Key Encryption....Pages 552-565
Provably Secure air Blind Signatures with Tight Revocation....Pages 566-582
....Pages 583-601
