Topics in Cryptology - CT-RSA 2009

Identity-Based Encryption.- Adaptive-ID Secure Revocable Identity-Based Encryption.- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations.- Universally Anonymous IBE Based on the Quadratic Residuosity Assumption.- Protocol Analysis.- Attacks on the DECT Authentication Mechanisms.- Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1.- Two-Party Protocols.- Key Insulation and Intrusion Resilience over a Public Channel.- Statistically Hiding Sets.- Adaptively Secure Two-Party Computation with Erasures.- More Than Signatures.- Short Redactable Signatures Using Random Trees.- Divisible On-Line/Off-Line Signatures.- Collisions for Hash Functions.- Speeding up Collision Search for Byte-Oriented Hash Functions.- Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security.- Cryptanalysis.- A Statistical Saturation Attack against the Block Cipher PRESENT.- Practical Attacks on Masked Hardware.- Cryptanalysis of CTC2.- Alternative Encryption.- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model.- Square, a New Multivariate Encryption Scheme.- Privacy and Anonymity.- Communication-Efficient Private Protocols for Longest Common Subsequence.- Key-Private Proxy Re-encryption.- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems.- Effciency Improvements.- Practical Short Signature Batch Verification.- Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity.- Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients.- Multi-PartyProtocols.- Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values.- Local Sequentiality Does Not Help for Concurrent Composition.- Security of Encryption Schemes.- Breaking and