Efficient ID-based proxy signature and proxy signcryption form bilinear pairings

  • Qin Wang*
  • , Zhenfu Cao
  • *Corresponding author for this work

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

15 Scopus citations

Abstract

In this paper, based on bilinear pairings, we would like to construct an identity based proxy signature scheme and an identity based proxy signcryption scheme without secure channel. We also analyze the two proposed schemes from efficiency point of view and show that they are more efficient than the existed ones. What's more, our proposed schemes satisfy all of the security requirements to proxy signature and proxy signcryption schemes assuming the CDH problem and BDH problem are hard to solve.

Original languageEnglish
Title of host publicationComputational Intelligence and Security - International Conference, CIS 2005, Proceedings
PublisherSpringer Verlag
Pages167-172
Number of pages6
ISBN (Print)3540308199, 9783540308195
DOIs
StatePublished - 2005
Externally publishedYes
EventInternational Conference on Computational Intelligence and Security, CIS 2005 - Xi'an, China
Duration: 15 Dec 200519 Dec 2005

Publication series

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

Conference

ConferenceInternational Conference on Computational Intelligence and Security, CIS 2005
Country/TerritoryChina
CityXi'an
Period15/12/0519/12/05

Fingerprint

Dive into the research topics of 'Efficient ID-based proxy signature and proxy signcryption form bilinear pairings'. Together they form a unique fingerprint.

Cite this