Skip to main content
SpringerLink
Log in

Pairing-Based Cryptography - Pairing 2010

4th International Conference, Yamanaka Hot Spring, Japan, December 13-15, 2010, Proceedings

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Marc Joye

    1. Technicolor, Security and Content Protection Labs, Cesson-Sévigné Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Atsuko Miyaji

    1. Japan Advanced Institute of Science and Technology (JAIST), Nomi, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Akira Otsuka

    1. National Institute of Advanced Industrial Science and Technoloy (AIST), Tokyo, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast-track proceedings

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

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

Included in the following conference series:

Conference proceedings info: Pairing 2010.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Table of contents (28 papers)

  1. Front Matter

    Download chapter PDF

  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

  4. Digital Signatures

    1. A New Construction of Designated Confirmer Signature and Its Application to Optimistic Fair Exchange

      • Qiong Huang, Duncan S. Wong, Willy Susilo
      Pages 41-61

    2. Anonymizable Signature and Its Construction from Pairings

      • Fumitaka Hoshino, Tetsutaro Kobayashi, Koutarou Suzuki
      Pages 62-77

    3. Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches

      • Brian J. Matt
      Pages 78-95

  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

    2. Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store Shares

      • Koen Simoens, Roel Peeters, Bart Preneel
      Pages 116-135

    3. Shorter Verifier-Local Revocation Group Signature with Backward Unlinkability

      • Lingbo Wei, Jianwei Liu
      Pages 136-146

  7. Invited Talk 2

    1. Pairing-Based Non-interactive Zero-Knowledge Proofs

      • Jens Groth
      Pages 206-206

  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

    3. A New Method for Constructing Pairing-Friendly Abelian Surfaces

      • Robert Dryło
      Pages 298-311
Back to top

Other volumes

  1. Pairing-Based Cryptography - Pairing 2010

Keywords

Editors and Affiliations

  • Technicolor, Security and Content Protection Labs, Cesson-Sévigné Cedex, France

    Marc Joye

  • Japan Advanced Institute of Science and Technology (JAIST), Nomi, Japan

    Atsuko Miyaji

  • National Institute of Advanced Industrial Science and Technoloy (AIST), Tokyo, Japan

    Akira Otsuka

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation