## Advances in Cryptology - ASIACRYPT 2001: 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, December 9-13, 2001 : ProceedingsThis book constitutes the refereed proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2001, held in Gold Coast, Australia in December 2001. The 33 revised full papers presented together with an invited paper were carefully reviewed and selected from 153 submissions. The papers are organized in topical sections on lattice based cryptography, human identification, practical public key cryptography, cryptography based on coding theory, block ciphers, provable security, threshold cryptography, two-party protocols, zero knowledge, cryptographic building blocks, elliptic curve cryptography, and anonymity. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Lattice Based Cryptography | 1 |

On the Insecurity of a ServerAided RSA Protocol | 21 |

The Modular Inversion Hidden Number Problem | 36 |

Copyright | |

32 other sections not shown

### Other editions - View all

Advances in Cryptology — ASIACRYPT 2001: 7th International Conference on ... Colin Boyd Limited preview - 2003 |

Advances in Cryptology - Asiacrypt 2001: 7th International Conference on the ... Colin Boyd No preview available - 2014 |

Advances in Cryptology — ASIACRYPT 2001: 7th International Conference on ... Colin Boyd No preview available - 2001 |

### Common terms and phrases

Advances in Cryptology adversary Alice apply ASIACRYPT assumption attack authentication bits block cipher braid chosen ciphertext codes codewords coefficients commitment commitment scheme complexity Computer Science Crypto cryptographic Cryptology cryptosystem decryption defined denote Diffie-Hellman discrete logarithm distribution efficient elements elliptic curves encryption scheme equation Eurocrypt exponentiation factors Feistel schemes finite field follows given Goppa codes hash function implementation IND-CCA input integer inversion lattice Lecture Notes Lemma linear LNCS log2 matrix mod q mode modulo Notes in Computer obtain output Paillier cryptosystem pairs parties permutation plaintext players polynomial precomputation probability problem Proc proof protocol pseudorandom pseudorandom permutation public key queries random oracle model randomly requires result Rijndael RSA modulus S-Box secret key semantic security servers session key shares sieve signature scheme simulator Springer-Verlag subgroup Theorem threshold threshold cryptosystem truncated differential vector verifier zero-knowledge