Progress in Cryptology - INDOCRYPT 2005

6th International Conference on Cryptology in India, Bangalore, India, December 10-12, 2005, Proceedings
2005
ISBN: 978-3-540-30805-8
Verlag: Springer Berlin Heidelberg

Buch, Englisch, 420 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1350 g

Reihe: Security and Cryptology

the respective papers. Our thanks go to all the Program members and the external reviewers (a list of them is included in the proceedings) who put in their valuable time and e?ort in providing important feedbackto the authors.We thank V. KumarMurty ofthe UniversityofToronto for kindly agreeing to present the invited talk. The talk has been included in the proceedings.

Zielgruppe

Research

Autoren/Hrsg.

Maitra, Subhamoy

Venkatesan, Ramarathnam

Madhavan, C.E. Veni

Fachgebiete

• Mathematik | Informatik EDV | Informatik Technische Informatik Externe Speicher & Peripheriegeräte
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Mathematik | Informatik EDV | Informatik Betriebssysteme Windows Betriebssysteme
• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Informationstheorie, Kodierungstheorie
• Mathematik | Informatik EDV | Informatik Technische Informatik Systemverwaltung & Management
• Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Technische Informatik Computersicherheit Kryptographie, Datenverschlüsselung

Inhaltsverzeichnis

Invited Talk.- Abelian Varieties and Cryptography.- Sequences.- Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences.- Period of Streamcipher Edon80.- Boolean Function and S-Box.- On the Algebraic Immunity of Symmetric Boolean Functions.- On Highly Nonlinear S-Boxes and Their Inability to Thwart DPA Attacks.- Hash Functions.- How to Construct Universal One-Way Hash Functions of Order r.- Towards Optimal Double-Length Hash Functions.- Design Principles.- Near Optimal Algorithms for Solving Differential Equations of Addition with Batch Queries.- Design Principles for Combiners with Memory.- Cryptanalysis I.- Cryptanalysis of the Quadratic Generator.- Attack the Dragon.- Two Algebraic Attacks Against the F-FCSRs Using the IV Mode.- Cryptanalysis of Keystream Generator by Decimated Sample Based Algebraic and Fast Correlation Attacks.- Time Memory Trade-Off.- TMD-Tradeoff and State Entropy Loss Considerations of Streamcipher MICKEY.- Time-Memory Trade-Offs: False Alarm Detection Using Checkpoints.- Cryptanalysis II.- Cryptanalysis of Barni et al. Watermarking Scheme.- Completion Attacks and Weak Keys of Oleshchuk’s Public Key Cryptosystem.- New Constructions.- An Optimal Subset Cover for Broadcast Encryption.- MaTRU: A New NTRU-Based Cryptosystem.- Anonymous Password-Based Authenticated Key Exchange.- Pairings.- Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism.- Reconsideration on the Security of the Boneh-Franklin Identity-Based Encryption Scheme.- Signatures.- Short Undeniable Signatures Without Random Oracles: The Missing Link.- Short Threshold Signature Schemes Without Random Oracles.- Applications.- Attacking an Asynchronous Multi-party Contract Signing Protocol.- Fairness and Correctness in Case of a Premature Abort.-E-Cash.- Short E-Cash.- A Universally Composable Scheme for Electronic Cash.- Implementations.- Energy-Privacy Trade-Offs in VLSI Computations.- Modified Serial Multipliers for Type-IV Gaussian Normal Bases.- Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic.- SCA Resistant Parallel Explicit Formula for Addition and Doubling of Divisors in the Jacobian of Hyperelliptic Curves of Genus 2.