A secure signature scheme from bilinear maps

Dan Boneh, Ilya Mironov, Victor Shoup

Research output: Contribution to journalArticle

Abstract

We present a new class of signature schemes based on properties of certain bilinear algebraic maps. These signatures are secure against existential forgery under a chosen message attack in the standard model (without using the random oracle model). Security is based on the computational Diffie-Hellman problem. The concrete schemes that we get are the most efficient provable discrete-log type signature schemes to date.

Original languageEnglish (US)
Pages (from-to)98-110
Number of pages13
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2612
StatePublished - 2003

Fingerprint

Bilinear Map
Signature Scheme
Random Oracle Model
Diffie-Hellman
Standard Model
Signature
Attack
Concretes
Class

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{7b5329a0fc834c4a99f1f2ed90211d35,
title = "A secure signature scheme from bilinear maps",
abstract = "We present a new class of signature schemes based on properties of certain bilinear algebraic maps. These signatures are secure against existential forgery under a chosen message attack in the standard model (without using the random oracle model). Security is based on the computational Diffie-Hellman problem. The concrete schemes that we get are the most efficient provable discrete-log type signature schemes to date.",
author = "Dan Boneh and Ilya Mironov and Victor Shoup",
year = "2003",
language = "English (US)",
volume = "2612",
pages = "98--110",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - A secure signature scheme from bilinear maps

AU - Boneh, Dan

AU - Mironov, Ilya

AU - Shoup, Victor

PY - 2003

Y1 - 2003

N2 - We present a new class of signature schemes based on properties of certain bilinear algebraic maps. These signatures are secure against existential forgery under a chosen message attack in the standard model (without using the random oracle model). Security is based on the computational Diffie-Hellman problem. The concrete schemes that we get are the most efficient provable discrete-log type signature schemes to date.

AB - We present a new class of signature schemes based on properties of certain bilinear algebraic maps. These signatures are secure against existential forgery under a chosen message attack in the standard model (without using the random oracle model). Security is based on the computational Diffie-Hellman problem. The concrete schemes that we get are the most efficient provable discrete-log type signature schemes to date.

UR - http://www.scopus.com/inward/record.url?scp=35248901398&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35248901398&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35248901398

VL - 2612

SP - 98

EP - 110

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -