Identity-based verifiably encrypted signatures without random oracles

  • Lei Zhang*
  • , Qianhong Wu
  • , Bo Qin
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

Fair exchange protocol plays an important role in electronic commerce in the case of exchanging digital contracts. Verifiably encrypted signatures provide an optimistic solution to these scenarios with an off-line trusted third party. In this paper, we propose an identity-based verifiably encrypted signature scheme. The scheme is non-interactive to generate verifiably encrypted signatures and the resulting encrypted signature consists of only four group elements. Based on the computational Diffie-Hellman assumption, our scheme is proven secure without using random oracles. To the best of our knowledge, this is the first identity-based verifiably encrypted signature scheme provably secure in the standard model.

Original languageEnglish
Title of host publicationProvable Security - Third International Conference, ProvSec 2009, Proceedings
Pages76-89
Number of pages14
DOIs
StatePublished - 2009
Externally publishedYes
Event3rd International Conference on Provable Security, ProvSec 2009 - Guangzhou, China
Duration: 11 Nov 200913 Nov 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5848 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Provable Security, ProvSec 2009
Country/TerritoryChina
CityGuangzhou
Period11/11/0913/11/09

Keywords

  • Fair exchange
  • Identity-based cryptography
  • Provable security
  • Verifiably encrypted signature

Fingerprint

Dive into the research topics of 'Identity-based verifiably encrypted signatures without random oracles'. Together they form a unique fingerprint.

Cite this