Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Publications of asiacrypt 2001
Preface and frontmatter
Page
Title
1-20
Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001
21-35
On the Insecurity of a Server-Aided RSA Protocol
36-51
The Modular Inversion Hidden Number Problem
52-66
Secure Human Identification Protocols
67-86
Unbelievable Security. Matching AES Security Using Public Key Systems
87-106
A Probable Prime Test with Very High Confidence for n equiv 1 mod 4
107-124
Computation of Discrete Logarithms in F
2
607
125-143
Speeding Up XTR
144-156
An Efficient Implementation of Braid Groups
157-174
How to Achieve a McEliece-Based Digital Signature Scheme
175-192
Efficient Traitor Tracing Algorithms Using List Decoding
193-207
Security of Reduced Version of the Block Cipher Camellia against Truncated and Impossible Differential Cryptanalysis
208-221
Known-IV Attacks on Triple Modes of Operation of Block Ciphers
222-238
Generic Attacks on Feistel Schemes
239-254
A Compact Rijndael Hardware Architecture with S-Box Optimization
255-271
Provable Security of KASUMI and 3GPP Encryption Mode f8
272-289
Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices
290-309
Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case
310-330
Fully Distributed Threshold RSA under Standard Assumptions
331-350
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes
351-368
Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks
369-384
Oblivious Polynomial Evaluation and Oblivious Neural Learning
385-401
Mutually Independent Commitments
402-421
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
422-441
Responsive Round Complexity and Concurrent Zero-Knowledge
442-459
Practical Construction and Analysis of Pseudo-Randomness Primitives
460-479
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
480-494
An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves
495-513
Supersingular Curves in Cryptography
514-532
Short Signatures from the Weil Pairing
533-551
Self-Blindable Credential Certificates from the Weil Pairing
552-565
How to Leak a Secret
566-582
Key-Privacy in Public-Key Encryption
583-602
Provably Secure Fair Blind Signatures with Tight Revocation