International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - ASIACRYPT 2000, 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, Japan, December 3-7, 2000, Proceedings

Page	Title
1-13	Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
14-29	Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99
30-43	Why Textbook ElGamal and RSA Encryption Are Insecure
44-57	Cryptanalysis of the TTM Cryptosystem
58-71	Attacking and Repairing Batch Verification Schemes
72	Cryptography Everywhere
73-89	Security of Signed ElGamal Encryption
90-96	From Fixed-Length to Arbitrary-Length RSA Padding Schemes
97-115	Towards Signature-Only Signature Schemes
116-129	A New Forward-Secure Digital Signature Scheme
130-142	Unconditionally Secure Digital Signature Schemes Admitting Transferability
143-161	Efficient Secure Multi-party Computation
162-177	Mix and Match: Secure Function Evaluation via Ciphertexts
178-191	A Length-Invariant Hybrid Mix
192-204	Attack for Flash MIX
205-219	Distributed Oblivious Transfer
220-233	Key Improvements to XTR
234-247	Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders
248-258	Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three
259-273	Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems
274-288	Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis
289-302	On the Pseudorandomness of Top-Level Schemes of Block Ciphers
303-316	Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers
317-330	Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography
331-345	Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes
346-358	Addition of ElGamal Plaintexts
359-372	Improved Methods to Perform Threshold RSA
373-387	Commital Deniable Proofs and Electronic Campaign Finance
388-398	Provably Secure Metering Scheme
399-400	CRYPTREC Project - Cryptographic Evaluation Project for the Japanese Electronic Government
401-414	Anonymous Fingerprinting with Direct Non-repudiation
415-428	Efficient Anonymous Fingerprinting with Group Signatures
429-442	Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
443-457	Zero-Knowledge and Code Obfuscation
458-469	A Note on Security Proofs in the Generic Model
470-482	On Relationships among Avalanche, Nonlinearity, and Correlation Immunity
483-488	Cryptanalysis of the Yi-Lam Hash
489-502	Power Analysis, What Is Now Possible
503-516	Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications
517-530	The Security of Chaffing and Winnowing
531-545	Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
546-559	Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques
560-572	Proofs of Security for the Unix Password Hashing Algorithm
573-584	Trapdooring Discrete Logarithms on Elliptic Curves over Rings
585-598	Strengthening McEliece Cryptosystem
599-613	Password-Authenticated Key Exchange Based on RSA
614-628	Round-Efficient Conference Key Agreement Protocols with Provable Security