Advances in Cryptology - ASIACRYPT 2000

Cryptanalysis I.- Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers.- Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99.- Why Textbook ElGamal and RSA Encryption Are Insecure.- Cryptanalysis of the TTM Cryptosystem.- Attacking and Repairing Batch Verification Schemes.- IACR Distinguished Lecture.- Cryptography Everywhere.- Digital Signatures.- Security of Signed ElGamal Encryption.- From Fixed-Length to Arbitrary-Length RSA Padding Schemes.- Towards Signature-Only Signature Schemes.- A New Forward-Secure Digital Signature Scheme.- Unconditionally Secure Digital Signature Schemes Admitting Transferability.- Protocols I.- Efficient Secure Multi-party Computation.- Mix and Match: Secure Function Evaluation via Ciphertexts.- A Length-Invariant Hybrid Mix.- Attack for Flash MIX.- Distributed Oblivious Transfer.- Number Theoretic Algorithms.- Key Improvements to XTR.- Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders.- Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three.- Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems.- Symmetric-Key Schemes I.- Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis.- On the Pseudorandomness of Top-Level Schemes of Block Ciphers.- Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers.- Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography.- Protocols II.- Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes.- Addition of El Gamal Plaintexts.- Improved Methods to Perform Threshold RSA.- Commital Deniable Proofs and Electronic Campaign Finance.- Provably Secure Metering Scheme.- Invited Lecture.- CRYPTREC Project Cryptographic Evaluation Project for the Japanese Electronic Government.- Fingerprinting.- Anonymous