## Advances in Cryptology - ASIACRYPT 2002: 8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, December 1-5, 2002, Proceedings (Google eBook)This book constitutes the refereed proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2002, held in Singapore, in December 2002. |

### What people are saying - Write a review

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

### Contents

1 | |

A Variant of the CramerShoup Cryptosystem for Groups of Unknown Order | 27 |

Looking beyond XTR | 46 |

Bounds for Robust Metering Schemes and Their Relationship with A²code | 64 |

Unconditionally Secure Anonymous Encryption and Group Authentication | 81 |

Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model | 100 |

On the Impossibilities of Basing OneWay Permutations on Central Cryptographic Primitives | 110 |

A StatisticallyHiding Integer Commitment Scheme Based on Groups with Hidden Order | 125 |

A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2 | 311 |

A General Formula of the t nThreshold Visual Secret Sharing Scheme | 328 |

On Unconditionally Secure Robust Distributed Key Distribution Centers | 346 |

Short Signatures in the Random Oracle Model | 364 |

The Provable Security of GraphBased OneTime Signatures and Extensions to Algebraic Signature Schemes | 379 |

Transitive Signatures Based on Factoring and RSA | 397 |

1outofn Signatures from a Variety of Keys | 415 |

A Revocation Scheme with Minimal Storage at Receivers | 433 |

Efficient Oblivious Transfer in the BoundedStorage Model | 143 |

In How Many Ways Can You Write Rijndael? | 160 |

On the Security of RijndaelLike Structures against Differential and Linear Cryptanalysis | 176 |

Threshold Cryptosystems Based on Factoring | 192 |

Noninteractive DistributedVerifier Proofs and Proving Relations among Commitments | 206 |

Asynchronous Secure Communication Tolerating Mixed Adversaries | 224 |

Amplified Boomerang Attack against ReducedRound SHACAL | 243 |

Enhancing DifferentialLinear Cryptanalysis | 254 |

Cryptanalysis of Block Ciphers with Overdefined Systems of Equations | 267 |

Analysis of Neural Cryptography | 288 |

The Case of RSA and Discrete Logarithm | 299 |

Optimistic Mixing for ExitPolls | 451 |

Improved Construction of Nonlinear Resilient SBoxes | 466 |

An Upper Bound on the Number of mResilient Boolean Functions | 484 |

Group DiffieHellman Key Exchange Secure against Dictionary Attacks | 497 |

A Simple Characterization | 515 |

IDBased Blind Signature and Ring Signature from Pairings | 533 |

Hierarchical IDBased Cryptography | 548 |

Cryptointegrity | 567 |

Gummy and Conductive Silicone Rubber Fingers | 574 |

577 | |

### Common terms and phrases

adversary algorithm ASIACRYPT assume assumption attack authenticated bits blind signature block cipher Boolean functions broadcast chooses chosen ciphertext commitment scheme Computer Science construction Cramer-Shoup cryptosystem cryptanalysis Crypto cryptographic Cryptology cryptosystem decryption defined definition denote differential Diffie-Hellman digital signature distributed dual ciphers efficient elements encryption scheme equations Eurocrypt exists factor given hash function homomorphic ID-based input integer Lecture Notes Lemma linear LNCS lower bound matrix step method mix servers modulo multiplication node nonlinearity Notes in Computer obtain one-way one-way function operation output pair paper permutation plaintext players polynomial prime private key probability problem Proc proof protocol prove public key query random oracle model receiver result Rijndael ring signature rounds S-box Section sender session key SHACAL signature scheme signer Springer-Verlag subset key Theorem trapdoor unconditionally secure verifier XSL attack zero-knowledge