Advances in Cryptology -- ASIACRYPT '96 : International Conference on the Theory and Applications of Cryptology and Information Security Kyongju, Korea, November 3-7, 1996 Proceedings / edited by Kwangjo Kim, Tsutomu Matsumoto.
By: International Conference on the Theory and Applications of Cryptology and Information Security (1996 : Kyongju, Korea)
Contributor(s): Kim, Kwangjo | Matsumoto, TsutomuMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 1163.Publisher: Berlin, Heidelberg : Springer-Verlag, 1996Description: 1 online resource : v.: digitalContent type: text Media type: computer Carrier type: online resourceISBN: 9783540707073; 3540707077Subject(s): Computer science | Computer Communication Networks | Operating systems (Computers) | Data encryption (Computer science) | Coding theory | Computer software | Combinatorial analysis | Coding theory | Combinatorial analysis | Computer science | Computer software | Data encryption (Computer science) | Operating systems (Computers)Genre/Form: Electronic books. Additional physical formats: Printed edition:: No titleDDC classification: 005.8/2 LOC classification: QA76.9.A25 | I5553 1996Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
This book constitutes the strictly refereed proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT '96, held in Kyongju, Korea, in November 1996. The 31 revised full papers presented together with three invited contributions were carefully selected from a total of 124 submissions. The papers are organized in topical sections on discrete log based systems, efficient algorithms, hash functions and block cyphers, cryptographic protocols, signature and identification, visual secret sharing, key distribution, Boolean functions, electronic cash, special signatures, stream ciphers, and hard problems.
A message recovery signature scheme equivalent to DSA over elliptic curves -- Cryptographic protocols based on real-quadratic A-fields (extended abstract) -- Minding your p's and q's -- Authenticated multi-party key agreement -- Cryptography and the internet: Lessons and challenges -- Generating standard DSA signatures without long inversion -- A fast software implementation for arithmetic operations in GF(2n) -- Hash functions based on block ciphers and quaternary codes -- Generalized Feistel networks -- On applying linear cryptanalysis to IDEA -- A multi-recastable ticket scheme for electronic elections -- Some remarks on a receipt-free and universally verifiable Mix-type voting scheme -- Observations on non-repudiation -- On the efficiency of one-time digital signatures -- A hidden cryptographic assumption in no-transferable indentification schemes -- Electronic money and key management from global and regional points of view -- Limiting the visible space visual secret sharing schemes and their application to human identification -- Towards characterizing when information-theoretic secret key agreement is possible -- Key sharing based on the wire-tap channel type II concept with noisy main channel -- Generalization of higher order SAC to vector output Boolean functions -- On the correlation immune functions and their nonlinearity -- How to date blind signatures -- Provably secure blind signature schemes -- Cost-effective payment schemes with privacy regulation -- Mis-representation of identities in e-cash schemes and how to prevent it -- "Indirect discourse proofs": Achieving efficient Fair Off-Line e-cash -- The validation of cryptographic algorithms -- Convertible group signatures -- How to utilize the transformability of digital signatures for solving the oracle problem -- On the risk of disruption in several multiparty signature schemes -- Correlation attacks on cascades of clock controlled shift registers -- Conditional correlation attack on nonlinear filter generators -- The cryptographic security of the syndrome decoding problem for rank distance codes -- A World Wide Number Field Sieve factoring record: On to 512 bits.