Program - ASIACRYPT 2005

December 4, 2005
14.00 - 17.00Tutorial
Prof. Tanja Lange
Topic : Pairing Based Cryptography
December 5, 2005
08.00 - 09.45Registration
09.45 - 10.00Welcome Address
Prof. C Pandu Rangan, General Chair, ASIACRYPT 2005
10.00 - 11.00Invited Lecture     [Chair: Bimal Roy]
Prof. Bart Preneel
11.00 - 11.30Tea Break
11.30 - 13.00Session I : Signatures     [Chair : Colin Boyd]
    Universal Designated Verifier Signature Proof
        Joonsang Baek, Reihaneh Safavi-Naini, Willy Susilo
    Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs
        Craig Gentry, David Molnar, Zulfikar Ramzan
    Universally Convertible Directed Signatures
        Fabien Laguillaumie, Pascal Paillier, Damien Vergnaud
13.00 - 14.00Lunch
14.00 - 16.00Session II : Algebra and Number Theory     [Chair: Nicolas Sendrier]
    Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
        Pascal Paillier, Damien Vergnaud
    Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
        David Jao, Stephen D. Miller, Ramarathnam Venkatesan
    Adapting Density Attacks to Low-Weight Knapsacks
        Phong Q. Nguyên, Jacques Stern
    Efficient and Secure Elliptic Curve Point Multiplication using Double-Base Chains
        Vassil Dimitrov, Laurent Imbert, Pradeep Kumar Mishra
16.00 - 16.15Tea Break
16.15 - 17.15Session III : Information and Quantum Theory     [Chair: Rana Barua]
    Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
        Renato Renner, Stefan Wolf
    Quantum Anonymous Transmissions
        Matthias Christandl, Stephanie Wehner
December 6, 2005
09.30 - 10.30Session IV : Provable Security     [Chair: Kapil Paranjape]
    Server-Aided Verification: Theory and Practice
        Marc Girault, David Lefranc
    Errors in Computational Complexity Proofs for Protocols
        Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock
10.30 - 11.00Tea Break
11.00 - 13.00Session V : Privacy and Anonymity     [Chair: Rei Safavi Naini]
    Privacy-Preserving Graph Algorithms in the Semi-Honest Model
        Justin Brickell, Vitaly Shmatikov
    Spreading Alerts Quietly and the Subgroup Escape Problem
        James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy
    A Sender Verifiable Mix-Net and a New Proof of a Shuffle
        Douglas Wikström
    Universally Anonymizable Public-Key Encryption
        Ryotaro Hayashi, Keisuke Tanaka
13.00 - 14.00Lunch
14.00Trip to Mahabalipuram followed by Conference Dinner
December 7, 2005
09.00 - 11.00Session VI : Block Ciphers and Hash Functions     [Chair: P.K. Saxena]
    New Improvements of Davies-Murphy Cryptanalysis
        Sebastien Kunz-Jacques, Frédéric Muller
    A Related-Key Rectangle Attack on the Full KASUMI
        Eli Biham, Orr Dunkelman, Nathan Keller
    Some Attacks Against a Double Length Hash Proposal
        Lars R. Knudsen, Frédéric Muller
    A Failure-Friendly Design Principle for Hash Functions
        Stefan Lucks
11.00 - 11.30Tea Break
11.30 - 13.00Session VII : Stream Cipher Cryptanalysis     [Chair: Phong Nguyên]
    Linear Cryptanalysis of the TSC Family of Stream Ciphers
        Frédéric Muller, Thomas Peyrin
    A Practical Attack on the Fixed RC4 in the WEP Mode
        Itsik Mantin
    A Near-Practical Attack against B mode of HBB
        Joydip Mitra
13.00 - 14.00Lunch
14.00 - 15.30Session VIII : Cryptanalytic Techniques     [Chair: Orr Dunkelman]
    Fast Computation of Large Distributions and Its Cryptographic Applications
        Alexander Maximov, Thomas Johansson
    An Analysis of the XSL Algorithm
        Carlos Cid, Gaëtan Leurent
    New Applications of Time Memory Data Tradeoffs
        Jin Hong, Palash Sarkar
15.30 - 15.45Tea Break
15.45 - 17.15Session IX : Bilinear Maps     [Chair: Tanja Lange]
    Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application
        Yumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, Hideki Imai
    Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
        Paulo S. L. M. Barreto, Benoît Libert, Noel McCullagh, Jean-Jacques Quisquater
    Verifier-Local Revocation Group Signature Schemes with Backward Un-linkability from Bilinear Maps
        Toru Nakanishi, Nobuo Funabiki
18.00 - 19.00Rump Session (with Tea and Snacks)
December 8, 2005
09.00 - 10.30Session X : Key Agreement     [Chair: Kouichi Sakurai]
    Modular Security Proofs for Key Agreement Protocols
        Caroline Kudla, Kenneth G. Paterson
    A Simple Threshold Authenticated Key Exchange from Short Secrets
        Michel Abdalla, Olivier Chevassut, Pierre-Alain Fouque, David Pointcheval
    Examining Indistinguishability-Based Proof Models for Key Establishment Protocols
        Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock
10.30 - 11.00Tea Break
11.00 - 12.30Session XI : Multiparty Computation     [Chair: Kwangjo Kim]
    Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
        Martin Hirt, Jesper Buus Nielsen
    Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast En- cryption and Efficient Instantiations
        Nuttapong Attrapadung, Hideki Imai
    Revealing Additional Information in Two-Party Computations
        Andreas Jakoby, Maciej Liskiewicz
12.30 - 13.30Lunch
13.30 - 15.00Session XII : Zero Knowledge and Secret Sharing     [Chair: Eiji Okamato]
    Gate Evaluation Secret Sharing and Secure One-Round Two-Party Com- putation
        Vladimir Kolesnikov
    Parallel Multi-Party Computation from Linear Multi-Secret Sharing Schemes
        Zhifang Zhang, Mulan Liu, Liangliang Xiao
    Updatable Zero-Knowledge Databases
        Moses Liskov