Short Signature Scheme From Bilinear Pairings

Abstract

The first short signature scheme is proposed by Boneh, Lynn, and Shacham (BLS). This scheme uses the properties of bilinear pairings on certain elliptic curves. The main problem in BLS scheme is the use of special hash function. To deal with this problem, many cryptographic schemes were proposed with cryptographic hash functions such as MD5, SHA-1. In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is constructed by Bilinear Inverse-Square Die-Hellman Problem (BISDHP) and does not require any special hash function. The exact security proofs are also explained in the random oracle model. We give the implementation and comparison results of the BLS and ZSS (Zhang, Safavi, and Susilo) schemes. Furthermore, We use this signature scheme to construct a ring signature scheme.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 2010
Accession Number
ADA546410

Entities

People

  • Baris B. Kirlar
  • Omer Sever
  • Sedat Akleylek
  • Zaliha Yuce

Organizations

  • Middle East Technical University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Additives (Chemicals)
  • Algorithms
  • Applied Mathematics
  • Computations
  • Cryptography
  • Demographic Cohorts
  • Information Operations
  • Information Systems
  • Mathematics
  • Microarchitecture
  • Middle East
  • Polynomials
  • Probability
  • Security
  • Security Protocols
  • Standards

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Cybersecurity.
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Military History