Advances in Cryptology - ASIACRYPT '96

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.