Skip to main content
Springer Nature Link
Log in

Progress in Cryptology - VIETCRYPT 2006

First International Conference on Cryptology in Vietnam, Hanoi, Vietnam, September 25-28, 2006, Revised Selected Papers

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Phong Q. Nguyen

    1. Département d’Informatique, École Normale Supérieure, Paris Cedex 05, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4341)

Part of the book sub series: Security and Cryptology (LNSC)

Included in the following conference series:

Conference proceedings info: VIETCRYPT 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (25 papers)

  1. Front Matter

    Download chapter PDF

  2. Signatures and Lightweight Cryptography

    1. Probabilistic Multivariate Cryptography

      • Aline Gouget, Jacques Patarin
      Pages 1-18

    2. Short 2-Move Undeniable Signatures

      • Jean Monnerat, Serge Vaudenay
      Pages 19-36

    3. Searching for Compact Algorithms: cgen

      • M. J. B. Robshaw
      Pages 37-49

  3. Invited Talk

    1. On Pairing-Based Cryptosystems

      • Tatsuaki Okamoto
      Pages 50-66

  4. Pairing-Based Cryptography

    1. A New Signature Scheme Without Random Oracles from Bilinear Pairings

      • Fangguo Zhang, Xiaofeng Chen, Willy Susilo, Yi Mu
      Pages 67-80

    2. Efficient Dynamic k-Times Anonymous Authentication

      • Lan Nguyen
      Pages 81-98

    3. Side Channel Analysis of Practical Pairing Implementations: Which Path Is More Secure?

      • Claire Whelan, Mike Scott
      Pages 99-114

  5. Algorithmic Number Theory

    1. Factorization of Square-Free Integers with High Bits Known

      • Bagus Santoso, Noboru Kunihiro, Naoki Kanayama, Kazuo Ohta
      Pages 115-130

    2. Scalar Multiplication on Koblitz Curves Using Double Bases

      • Roberto Avanzi, Francesco Sica
      Pages 131-146

    3. Compressed Jacobian Coordinates for OEF

      • Fumitaka Hoshino, Tetsutaro Kobayashi, Kazumaro Aoki
      Pages 147-156

  6. Ring Signatures and Group Signatures

    1. On the Definition of Anonymity for Ring Signatures

      • Miyako Ohkubo, Masayuki Abe
      Pages 157-174

    2. Escrowed Linkability of Ring Signatures and Its Applications

      • Sherman S. M. Chow, Willy Susilo, Tsz Hon Yuen
      Pages 175-192

    3. Dynamic Fully Anonymous Short Group Signatures

      • Cécile Delerablée, David Pointcheval
      Pages 193-210

  7. Hash Functions

    1. Formalizing Human Ignorance

      • Phillip Rogaway
      Pages 211-228

    2. Discrete Logarithm Variants of VSH

      • Arjen K. Lenstra, Daniel Page, Martijn Stam
      Pages 229-242

    3. How to Construct Sufficient Conditions for Hash Functions

      • Yu Sasaki, Yusuke Naito, Jun Yajima, Takeshi Shimoyama, Noboru Kunihiro, Kazuo Ohta
      Pages 243-259

  8. Cryptanalysis

    1. Improved Fast Correlation Attack on the Shrinking and Self-shrinking Generators

      • Kitae Jeong, Jaechul Sung, Seokhie Hong, Sangjin Lee, Jaeheon Kim, Deukjo Hong
      Pages 260-270

    2. On the Internal Structure of Alpha-MAC

      • Jianyong Huang, Jennifer Seberry, Willy Susilo
      Pages 271-285

    3. A Weak Key Class of XTEA for a Related-Key Rectangle Attack

      • Eunjin Lee, Deukjo Hong, Donghoon Chang, Seokhie Hong, Jongin Lim
      Pages 286-297
Back to top

Other volumes

  1. Progress in Cryptology - VIETCRYPT 2006

Editors and Affiliations

  • Département d’Informatique, École Normale Supérieure, Paris Cedex 05, France

    Phong Q. Nguyen

Bibliographic Information

Publish with us

Policies and ethics

Back to top