Advances in Cryptology - ASIACRYPT 2008

14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings

Editors:

ISBN: 978-3-540-89254-0 (Print) 978-3-540-89255-7 (Online)

Table of contents (34 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Multi-Party Computation

    1. Book Chapter

      Pages 1-18

      MPC vs. SFE : Unconditional and Computational Security

    2. Book Chapter

      Pages 19-36

      Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes

    3. Book Chapter

      Pages 37-53

      Graph Design for Secure Multiparty Computation over Non-Abelian Groups

  3. Invited Talk

    1. Book Chapter

      Pages 54-54

      Some Perspectives on Complexity-Based Cryptography

  4. Cryptographic Protocols I

    1. Book Chapter

      Pages 55-73

      A Modular Security Analysis of the TLS Handshake Protocol

    2. Book Chapter

      Pages 74-89

      Ambiguous Optimistic Fair Exchange

    3. Book Chapter

      Pages 90-107

      Compact Proofs of Retrievability

    4. Book Chapter

      Pages 108-124

      On the Security of HB# against a Man-in-the-Middle Attack

  5. Cryptographic Hash Functions I

    1. Book Chapter

      Pages 125-142

      Hash Functions from Sigma Protocols and Improvements to VSH

    2. Book Chapter

      Pages 143-160

      Slide Attacks on a Class of Hash Functions

    3. Book Chapter

      Pages 161-178

      Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography

  6. Cryptographic Protocols II

    1. Book Chapter

      Pages 179-197

      Universally Composable Adaptive Oblivious Transfer

    2. Book Chapter

      Pages 198-215

      A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting

    3. Book Chapter

      Pages 216-233

      Towards Robust Computation on Encrypted Data

    4. Book Chapter

      Pages 234-252

      Efficient Protocols for Set Membership and Range Proofs

  7. Cryptographic Hash Functions II

    1. Book Chapter

      Pages 253-271

      Preimage Attacks on 3, 4, and 5-Pass HAVAL

    2. Book Chapter

      Pages 272-289

      How to Fill Up Merkle-Damgård Hash Functions

    3. Book Chapter

      Pages 290-307

      Limits of Constructive Security Proofs

  8. Public-Key Cryptography I

    1. Book Chapter

      Pages 308-325

      Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption

    2. Book Chapter

      Pages 326-343

      Twisted Edwards Curves Revisited

previous Page of 2