Advances in Cryptology - ASIACRYPT'98 [electronic resource] : International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, October 18-22, 1998, Proceedings / edited by Kazuo Ohta, Dingyi Pei.
- 1st ed. 1998.
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
- Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 1514
Lecture Notes in Computer Science, 0302-9743 ; 1514
1 online resource (XII, 436 pages) : 2 illustrations
- Data encryption (Computer science)
Operating systems (Computers)
Management information systems.
- Local subjects:
Management of Computing and Information Systems.
Algorithm Analysis and Problem Complexity.
IT in Business.
- System Details:
- text file PDF
- 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.
- Public Key Cryptosystems
Generating RSA Moduli with a Predetermined Portion
Generation of Shared RSA Keys by Two Parties
An Attack on RSA Given a Small Fraction of the Private Key Bits
C ?+ * and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai
ECC/DLP and Factoring-Based Cryptography: A Tale of Two Families (Invited Lecture)
Elliptic Curve Cryptosystems
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
Efficient Implementation of Schoof's Algorithm
Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2 n
Construction of Secure Elliptic Cryptosystems Using CM Tests and Liftings
Elliptic Curve Discrete Logarithms and the Index Calculus
Cryptanalysis of Rijmen-Preneel Trapdoor Ciphers
Improved Truncated Differential Attacks on SAFER
Optimal Resistance Against the Davies and Murphy Attack
A Group Signature Scheme with Improved Efficiency (Extended Abstract)
A Study on the Proposed Korean Digital Signature Algorithm
Cryptanalysis of the Original McEliece Cryptosystem
Improving the Security of the McEliece Public-Key Cryptosystem
Cryptanalysis in Prime Order Subgroups of Z n *
Weak Invertibility of Finite Automata and Cryptanalysis on FAPKC
Bounds and Constructions for Multireceiver Authentication Codes
Fair Off-Line e-Cash Made Easy
Off-line Fair Payment Protocols using Convertible Signatures
Efficient Fair Exchange with Verifiable Confirmation of Signatures
Adaptively Secure Oblivious Transfer
ML-Sequences over Rings Z/(2e): I. Constructions of Nondegenerative ML-Sequences II. Injectivness of Compression Mappings of New Classes
Analysis Methods for (Alleged) RC4
Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators
A New and Efficient All-Or-Nothing Disclosure of Secrets Protocol
The Béguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure
Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically) Extended Abstract
Audio and Optical Cryptography
Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement
Some Bounds and a Construction for Secure Broadcast Encryption.
- Ohta, Kazuo, editor., Editor,
Pei, Dingyi, editor., Editor,
SpringerLink (Online service)
- Contained In:
- Springer eBooks
- Other format:
- Printed edition:
- Publisher Number:
- 10.1007/3-540-49649-1 doi
- Access Restriction:
- Restricted for use by site license.
|Location||Notes||Your Loan Policy|
|Description||Status||Barcode||Your Loan Policy|