Advances in Cryptology - ASIACRYPT 2005: 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 11th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2005, held in Chennai, India in December 2005.

The 37 revised full papers presented were carefully reviewed and selected from 237 submissions. The papers are organized in topical sections on algebra and number theory, multiparty computation, zero knowledge and secret sharing, information and quantum theory, privacy and anonymity, cryptanalytic techniques, stream cipher cryptanalysis, block ciphers and hash functions, bilinear maps, key agreement, provable security, and digital signatures.

Author(s): Pascal Paillier, Damien Vergnaud (auth.), Bimal Roy (eds.)
Series: Lecture Notes in Computer Science 3788 : Security and Cryptology
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005

Language: English
Pages: 706
Tags: Data Encryption; Operating Systems; Algorithm Analysis and Problem Complexity; Management of Computing and Information Systems; Computer Communication Networks; Discrete Mathematics in Computer Science

Front Matter....Pages -
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log....Pages 1-20
Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?....Pages 21-40
Adapting Density Attacks to Low-Weight Knapsacks....Pages 41-58
Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains....Pages 59-78
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation....Pages 79-99
Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations....Pages 100-120
Revealing Additional Information in Two-Party Computations....Pages 121-135
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation....Pages 136-155
Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes....Pages 156-173
Updatable Zero-Knowledge Databases....Pages 174-198
Simple and Tight Bounds for Information Reconciliation and Privacy Amplification....Pages 199-216
Quantum Anonymous Transmissions....Pages 217-235
Privacy-Preserving Graph Algorithms in the Semi-honest Model....Pages 236-252
Spreading Alerts Quietly and the Subgroup Escape Problem....Pages 253-272
A Sender Verifiable Mix-Net and a New Proof of a Shuffle....Pages 273-292
Universally Anonymizable Public-Key Encryption....Pages 293-312
Fast Computation of Large Distributions and Its Cryptographic Applications....Pages 313-332
An Analysis of the XSL Algorithm....Pages 333-352
New Applications of Time Memory Data Tradeoffs....Pages 353-372
Linear Cryptanalysis of the TSC Family of Stream Ciphers....Pages 373-394
A Practical Attack on the Fixed RC4 in the WEP Mode....Pages 395-411
A Near-Practical Attack Against B Mode of HBB....Pages 412-424
New Improvements of Davies-Murphy Cryptanalysis....Pages 425-442
A Related-Key Rectangle Attack on the Full KASUMI....Pages 443-461
Some Attacks Against a Double Length Hash Proposal....Pages 462-473
A Failure-Friendly Design Principle for Hash Functions....Pages 474-494
Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application....Pages 495-514
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps....Pages 515-532
Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps....Pages 533-548
Modular Security Proofs for Key Agreement Protocols....Pages 549-565
A Simple Threshold Authenticated Key Exchange from Short Secrets....Pages 566-584
Examining Indistinguishability-Based Proof Models for Key Establishment Protocols....Pages 585-604
Server-Aided Verification: Theory and Practice....Pages 605-623
Errors in Computational Complexity Proofs for Protocols....Pages 624-643
Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature)....Pages 644-661
Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs....Pages 662-681
Universally Convertible Directed Signatures....Pages 682-701
Back Matter....Pages -