ASIACRYPT’98, the international conference covering all aspects of theory and application of cryptology and information security, is being held at Beijing Friendship Hotel from October 18 to 22. This is the fourth of the Asiacrypt conferences. ASIACRYPT’98 is sponsored by the State Key Laboratory of Information Security (SKLOIS), University of Science and Technology of China (USTC), and the Asiacrypt Steering Committee (ASC), in cooperation with the International Association for Cryptology Research (IACR). The 16-member Program Committee organized the scientific program and considered 118 submissions. Of these, 32 were accepted for presentation. The authors’ affiliations of the 118 submissions and the 32 accepted papers range over 18 and 13 countries or regions, respectively. The submitted version of each paper was sent to all members of the Program Committee and was extensively examined by at least three committee members and/or outside experts. The review process was rigorously blinded and the anonymity of each submission are maintained until the selection was completed. We followed the traditional policy that each member of the Program Committee could be an author of at most one accepted paper. These proceedings contain the revised versions of the 32 contributed talks as well as a short note written by one invited speaker. Comments from the Program Committee were taken into account in the revisions. However, the authors (not the committee) bear full responsibility for the contents of their papers.
Author(s): Arjen K. Lenstra (auth.), Kazuo Ohta, Dingyi Pei (eds.)
Series: Lecture Notes in Computer Science 1514
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1998
Language: English
Pages: 436
City: Berlin; New York
Tags: Data Encryption; Operating Systems; Management of Computing and Information Systems; Algorithm Analysis and Problem Complexity; Business Information Systems
Generating RSA Moduli with a Predetermined Portion....Pages 1-10
Generation of Shared RSA Keys by Two Parties....Pages 11-24
An Attack on RSA Given a Small Fraction of the Private Key Bits....Pages 25-34
ECC/DLP and Factoring-Based Cryptography: A Tale of Two Families (Invited Lecture)....Pages 35-50
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates....Pages 50-50
Efficient Implementation of Schoof’s Algorithm....Pages 51-65
Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F 2 n ....Pages 66-79
Construction of Secure Elliptic Cryptosystems Using CM Tests and Liftings....Pages 80-94
Elliptic Curve Discrete Logarithms and the Index Calculus....Pages 95-109
Cryptanalysis of Rijmen-Preneel Trapdoor Ciphers....Pages 110-125
Improved Truncated Differential Attacks on SAFER....Pages 126-132
Optimal Resistance Against the Davies and Murphy Attack....Pages 133-147
A Group Signature Scheme with Improved Efficiency (Extended Abstract)....Pages 148-159
A Study on the Proposed Korean Digital Signature Algorithm....Pages 160-174
Cryptanalysis of the Original McEliece Cryptosystem....Pages 175-186
Improving the Security of the McEliece Public-Key Cryptosystem....Pages 187-199
Weak Invertibility of Finite Automata and Cryptanalysis on FAPKC....Pages 200-213
Bounds and Constructions for Multireceiver Authentication Codes....Pages 214-226
Fair Off-Line e-Cash Made Easy....Pages 227-241
Off-line Fair Payment Protocols using Convertible Signatures....Pages 242-256
Efficient Fair Exchange with Verifiable Confirmation of Signatures....Pages 257-270
Adaptively Secure Oblivious Transfer....Pages 271-285
ML-Sequences over Rings Z/(2 e ): I. Constructions of Nondegenerative ML-Sequences II. Injectivness of Compression Mappings of New Classes....Pages 286-299
Analysis Methods for (Alleged) RC4....Pages 300-314
Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators....Pages 315-326
A New and Efficient All-Or-Nothing Disclosure of Secrets Protocol....Pages 327-341
The Béguin-Quisquater Server-Aided RSA Protocol from Crypto ’95 is not Secure....Pages 342-356
Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically) Extended Abstract....Pages 357-371
Audio and Optical Cryptography....Pages 372-379
Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement....Pages 380-391
Some Bounds and a Construction for Secure Broadcast Encryption....Pages 392-404
....Pages 405-419
