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

Bimal Kumar Roy (Herausgeber)

Buch | Softcover

XIV, 706 Seiten

2005 | 2005
Springer Berlin (Verlag)
978-3-540-30684-9 (ISBN)

Artikel merken

Asiacrypt, the annual conference of cryptology sponsored by IACR is now 11 years old. Asiacrypt 2005 was held during December 4 8, 2005, at Hotel Taj Coromandel,Chennai,India.This conferencewasorganizedby theInternational Association for Cryptologic Research (IACR) in cooperation with the Indian Institute of Technology (IIT), Chennai. Thisyearatotalof237papersweresubmittedtoAsiacrypt2005.Thesubm- sionscoveredallareasofcryptographicresearchrepresentingthecurrentstateof work in the crypto community worldwide. Each paper was blind reviewed by at least three members of the Program Committee and papers co-authored by the PC members were reviewed by at least six members. This ?rst phase of review by the PC members was followed by a detailed discussion on the papers. At the end of the reviewing process 37 papers were accepted and were presented at the conference. The proceedings contain the revised versionsof the accepted papers. In addition we were fortunate to have Prof. Andrew Yao and Prof. Bart Preneel as invited speakers. Based on a discussion and subsequent voting among the PC members, the Best Paper Award for this year s Asiacrypt was conferred to Pascal Paillier and Damien Vergnaud for the paper entitled Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log. I would like to thank the following people. First, the General Chair, Prof.

Algebra and Number Theory.- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log.- Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?.- Adapting Density Attacks to Low-Weight Knapsacks.- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains.- Multiparty Computation.- Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation.- Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations.- Revealing Additional Information in Two-Party Computations.- Zero Knowledge and Secret Sharing.- Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation.- Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes.- Updatable Zero-Knowledge Databases.- Information and Quantum Theory.- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification.- Quantum Anonymous Transmissions.- Privacy and Anonymity.- Privacy-Preserving Graph Algorithms in the Semi-honest Model.- Spreading Alerts Quietly and the Subgroup Escape Problem.- A Sender Verifiable Mix-Net and a New Proof of a Shuffle.- Universally Anonymizable Public-Key Encryption.- Cryptanalytic Techniques.- Fast Computation of Large Distributions and Its Cryptographic Applications.- An Analysis of the XSL Algorithm.- Stream Cipher Cryptanalysis.- New Applications of Time Memory Data Tradeoffs.- Linear Cryptanalysis of the TSC Family of Stream Ciphers.- A Practical Attack on the Fixed RC4 in the WEP Mode.- A Near-Practical Attack Against B Mode of HBB.- Block Ciphers and Hash Functions.- New Improvements of Davies-Murphy Cryptanalysis.- A Related-Key Rectangle Attack on the Full KASUMI.- Some Attacks Against a DoubleLength Hash Proposal.- A Failure-Friendly Design Principle for Hash Functions.- Bilinear Maps.- Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application.- Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps.- Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps.- Key Agreement.- Modular Security Proofs for Key Agreement Protocols.- A Simple Threshold Authenticated Key Exchange from Short Secrets.- Examining Indistinguishability-Based Proof Models for Key Establishment Protocols.- Provable Security.- Server-Aided Verification: Theory and Practice.- Errors in Computational Complexity Proofs for Protocols.- Signatures.- Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature).- Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs.- Universally Convertible Directed Signatures.

Erscheint lt. Verlag	24.11.2005
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Security and Cryptology
Zusatzinfo	XIV, 706 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	1013 g
Themenwelt	Informatik ► Theorie / Studium ► Kryptologie
Schlagworte	Algorithm analysis and problem complexity • anonymity • Block Ciphers • Communication • Complexity • Cryptanalysis • cryptographic protocols • cryptography • Cryptology • Data Security • DES • digital signature schemes • Distributed Computing • Elliptic Curves • Information • Information Theory • Kryptographie / Kryptologie • privacy • Public Key Cryptography • security • signcryption • Stream Ciphers • Zero Knowledge
ISBN-10	3-540-30684-6 / 3540306846
ISBN-13	978-3-540-30684-9 / 9783540306849
Zustand	Neuware