Pairing-Based Cryptography - Pairing 2010

4th International Conference, Yamanaka Hot Spring, Japan, December 2010. Proceedings

  • Marc Joye
  • Atsuko Miyaji
  • Akira Otsuka
Conference proceedings Pairing 2010

DOI: 10.1007/978-3-642-17455-1

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

Table of contents (28 papers)

  1. Front Matter
  2. Efficient Software Implementation

    1. An Analysis of Affine Coordinates for Pairing Computation
      Kristin Lauter, Peter L. Montgomery, Michael Naehrig
      Pages 1-20
    2. High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
      Jean-Luc Beuchat, Jorge E. González-Díaz, Shigeo Mitsunari, Eiji Okamoto, Francisco Rodríguez-Henríquez, Tadanori Teruya
      Pages 21-39
  3. Invited Talk 1

  4. Digital Signatures

  5. Cryptographic Protocols

    1. Oblivious Transfer with Access Control : Realizing Disjunction without Duplication
      Ye Zhang, Man Ho Au, Duncan S. Wong, Qiong Huang, Nikos Mamoulis, David W. Cheung et al.
      Pages 96-115
  6. Key Agreement

  7. Invited Talk 2

  8. Applications: Code Generation, Time-Released Encryption, Cloud Computing

    1. Designing a Code Generator for Pairing Based Cryptographic Functions
      Luis J. Dominguez Perez, Michael Scott
      Pages 207-224
    2. Efficient Generic Constructions of Timed-Release Encryption with Pre-open Capability
      Takahiro Matsuda, Yasumasa Nakai, Kanta Matsuura
      Pages 225-245
    3. Optimal Authenticated Data Structures with Multilinear Forms
      Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos
      Pages 246-264
  9. Point Encoding and Pairing-Friendly Curves

    1. Deterministic Encoding and Hashing to Odd Hyperelliptic Curves
      Pierre-Alain Fouque, Mehdi Tibouchi
      Pages 265-277
    2. Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time
      Jean-Gabriel Kammerer, Reynald Lercier, Guénaël Renault
      Pages 278-297

About these proceedings


Hashing Tate pairing abelian surfaces algorithms calculus cryptographic functions cryptography data structures efficient encryption hash functions hyperelliptic curves id-based encryption key exchange pairing-based signa supersingular curves

Editors and affiliations

  • Marc Joye
    • 1
  • Atsuko Miyaji
    • 2
  • Akira Otsuka
    • 3
  1. 1.Technicolor, Security and Content Protection LabsCesson-Sévigné CedexFrance
  2. 2.Japan Advanced Institute of Science and Technology (JAIST)NomiJapan
  3. 3.National Institute of Advanced Industrial Science and Technoloy (AIST)TokyoJapan

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-17454-4
  • Online ISBN 978-3-642-17455-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349