Efficient signcryption without random oracles

  • Qianhong Wu*
  • , Yi Mu
  • , Willy Susilo
  • , Fangguo Zhang
  • *Corresponding author for this work

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

Abstract

Signcryption is an asymmetric cryptographic method that simultaneously provides confidentiality and authenticity at a lower computational and communication overhead. A number of signcryption schemes have been proposed in the literature, but they are only proven to be secure in the random oracle model. In this paper, under rational computational assumptions, we propose a signcryption scheme from pairings that is proven secure without random oracles. The scheme is also efficient and comparable to the state-of-the-art signcryption schemes from pairings that is secure in the random oracle model.

Original languageEnglish
Title of host publicationAutonomic and Trusted Computing - Thrid International Conference, ATC 2006, Proceedings
PublisherSpringer Verlag
Pages449-458
Number of pages10
ISBN (Print)354038619X, 9783540386193
DOIs
StatePublished - 2006
Externally publishedYes
EventThrid International Conference on Autonomic and Trusted Computing, ATC 2006 - Wuhan, China
Duration: 3 Sep 20066 Sep 2006

Publication series

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

Conference

ConferenceThrid International Conference on Autonomic and Trusted Computing, ATC 2006
Country/TerritoryChina
CityWuhan
Period3/09/066/09/06

Fingerprint

Dive into the research topics of 'Efficient signcryption without random oracles'. Together they form a unique fingerprint.

Cite this