ASIACRYPT 2000 was the sixth annual ASIACRYPT conference. It was sp- sored by the International Association for Cryptologic Research (IACR) in - operation with the Institute of Electronics, Information, and Communication Engineers (IEICE). The ?rst conference with the name ASIACRYPT took place in 1991, and the series of ASIACRYPT conferences were held in 1994, 1996, 1998, and 1999, in cooperation with IACR. ASIACRYPT 2000 was the ?rst conference in the series to be sponsored by IACR. The conference received 140 submissions (1 submission was withdrawn by the authors later), and the program committee selected 45 of these for presen- tion. Extended abstracts of the revised versions of these papers are included in these proceedings. The program also included two invited lectures by Thomas Berson (Cryptography Everywhere: IACR Distinguished Lecture) and Hideki Imai (CRYPTREC Project – Cryptographic Evaluation Project for the Japanese Electronic Government). Abstracts of these talks are included in these proce- ings. The conference program also included its traditional “rump session” of short, informal or impromptu presentations, kindly chaired by Moti Yung. Those p- sentations are not re?ected in these proceedings. The selection of the program was a challenging task as many high quality submissions were received. The program committee worked very hard to evaluate the papers with respect to quality, originality, and relevance to cryptography. I am extremely grateful to the program committee members for their en- mous investment of time and e?ort in the di?cult and delicate process of review and selection.
Author(s): Alex Biryukov, Adi Shamir (auth.), Tatsuaki Okamoto (eds.)
Series: Lecture Notes in Computer Science 1976
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2000
Language: English
Pages: 636
Tags: Data Encryption; Mathematics of Computing; Algorithm Analysis and Problem Complexity; Management of Computing and Information Systems; Computer Communication Networks
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers....Pages 1-13
Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt ’99....Pages 14-29
Why Textbook ElGamal and RSA Encryption Are Insecure....Pages 30-43
Cryptanalysis of the TTM Cryptosystem....Pages 44-57
Attacking and Repairing Batch Verification Schemes....Pages 58-71
Cryptography Everywhere....Pages 72-72
Security of Signed ElGamal Encryption....Pages 73-89
From Fixed-Length to Arbitrary-Length RSA Padding Schemes....Pages 90-96
Towards Signature-Only Signature Schemes....Pages 97-115
A New Forward-Secure Digital Signature Scheme....Pages 116-129
Unconditionally Secure Digital Signature Schemes Admitting Transferability....Pages 130-142
Efficient Secure Multi-party Computation....Pages 143-161
Mix and Match: Secure Function Evaluation via Ciphertexts....Pages 162-177
A Length-Invariant Hybrid Mix....Pages 178-191
Attack for Flash MIX....Pages 192-204
Distributed Oblivious Transfer....Pages 205-219
Key Improvements to XTR....Pages 220-233
Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders....Pages 234-247
Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three....Pages 248-258
Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems....Pages 259-273
Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis....Pages 274-288
On the Pseudorandomness of Top-Level Schemes of Block Ciphers....Pages 289-302
Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers....Pages 303-316
Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography....Pages 317-330
Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes....Pages 331-345
Addition of El Gamal Plaintexts....Pages 346-358
Improved Methods to Perform Threshold RSA....Pages 359-372
Commital Deniable Proofs and Electronic Campaign Finance....Pages 373-387
Provably Secure Metering Scheme....Pages 388-398
CRYPTREC Project Cryptographic Evaluation Project for the Japanese Electronic Government....Pages 399-400
Anonymous Fingerprinting with Direct Non-repudiation....Pages 401-414
Efficient Anonymous Fingerprinting with Group Signatures....Pages 415-428
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems....Pages 429-442
Zero-Knowledge and Code Obfuscation....Pages 443-457
A Note on Security Proofs in the Generic Model....Pages 458-469
On Relationships among Avalanche, Nonlinearity, and Correlation Immunity....Pages 470-482
Cryptanalysis of the Yi-Lam Hash....Pages 483-488
Power Analysis, What Is Now Possible.......Pages 489-502
Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications....Pages 503-516
The Security of Chaffing and Winnowing....Pages 517-530
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm....Pages 531-545
Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques....Pages 546-559
Proofs of Security for the Unix Password Hashing Algorithm....Pages 560-572
Trapdooring Discrete Logarithms on Elliptic Curves over Rings....Pages 573-584
Strengthening McEliece Cryptosystem....Pages 585-598
Password-Authenticated Key Exchange Based on RSA....Pages 599-613
Round-Efficient Conference Key Agreement Protocols with Provable Security....Pages 614-627
