000 06389nam a22006495i 4500
001 978-3-540-49649-6
003 DE-He213
005 20240423132526.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540496496
_9978-3-540-49649-6
024 7 _a10.1007/3-540-49649-1
_2doi
050 4 _aQA268
072 7 _aGPJ
_2bicssc
072 7 _aURY
_2bicssc
072 7 _aCOM083000
_2bisacsh
072 7 _aGPJ
_2thema
072 7 _aURY
_2thema
082 0 4 _a005.824
_223
245 1 0 _aAdvances in Cryptology — ASIACRYPT’98
_h[electronic resource] :
_bInternational Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, October 18–22, 1998, Proceedings /
_cedited by Kazuo Ohta, Dingyi Pei.
250 _a1st ed. 1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1998.
300 _aXII, 436 p. 2 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1514
505 0 _aPublic 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 -- Invited Talk -- 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 1 -- Cryptanalysis of Rijmen-Preneel Trapdoor Ciphers -- Improved Truncated Differential Attacks on SAFER -- Optimal Resistance Against the Davies and Murphy Attack -- Signature -- A Group Signature Scheme with Improved Efficiency (Extended Abstract) -- A Study on the Proposed Korean Digital Signature Algorithm -- Cryptanlysis 2 -- Cryptanalysis of the Original McEliece Cryptosystem -- Improving the Security of the McEliece Public-Key Cryptosystem -- Cryptanalysis in Prime Order Subgroups of Z n * -- Finite Automata -- Weak Invertibility of Finite Automata and Cryptanalysis on FAPKC -- Authentication Codes -- Bounds and Constructions for Multireceiver Authentication Codes -- Electronic Cash -- 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 -- Steam Ciphers -- ML-Sequences over Rings Z/(2e): I. Constructions of Nondegenerative ML-Sequences II. Injectivness of CompressionMappings of New Classes -- Analysis Methods for (Alleged) RC4 -- Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators -- Cryptographic Protocols -- 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 -- Key Escrow -- Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically) Extended Abstract -- New Cryptography -- Audio and Optical Cryptography -- Information Theory -- Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement -- Some Bounds and a Construction for Secure Broadcast Encryption.
520 _aASIACRYPT’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.
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aOperating systems (Computers).
650 0 _aElectronic data processing
_xManagement.
650 0 _aAlgorithms.
650 0 _aBusiness information services.
650 1 4 _aCryptology.
650 2 4 _aOperating Systems.
650 2 4 _aIT Operations.
650 2 4 _aAlgorithms.
650 2 4 _aIT in Business.
700 1 _aOhta, Kazuo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPei, Dingyi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540651093
776 0 8 _iPrinted edition:
_z9783662201732
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1514
856 4 0 _uhttps://doi.org/10.1007/3-540-49649-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188718
_d188718