Efficient signcryption key encapsulation without random oracles

Fagen Li, Masaaki Shirase, Tsuyoshi Takagi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Recently, Tan proposed an insider secure signcryption key encapsulation mechanism (KEM) and an insider secure signcryption tag- KEM. His schemes are secure without random oracles (in the standard model). In this paper, we proposed a more efficient construction for signcryption KEM and tag-KEM. We prove their semantic security and existential unforgeability in the standard model. Compared to Tańs schemes, our corresponding schemes have 20% faster speed in the key encapsulation, 33% faster speed in the key decapsulation, 33% shorter public key, 60% shorter private key, and |p| bits shorter ciphertext.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - 4th International Conference, Inscrypt 2008, Revised Selected Papers
Pages47-59
Number of pages13
DOIs
Publication statusPublished - Jul 15 2009
Event4th International Conference on Information Security and Cryptology, Inscrypt 2008 - Beijing, China
Duration: Dec 14 2008Dec 17 2008

Publication series

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

Other

Other4th International Conference on Information Security and Cryptology, Inscrypt 2008
CountryChina
CityBeijing
Period12/14/0812/17/08

Fingerprint

Signcryption
Random Oracle
Encapsulation
Standard Model
Semantic Security
Public key
Semantics

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Li, F., Shirase, M., & Takagi, T. (2009). Efficient signcryption key encapsulation without random oracles. In Information Security and Cryptology - 4th International Conference, Inscrypt 2008, Revised Selected Papers (pp. 47-59). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5487). https://doi.org/10.1007/978-3-642-01440-6_6

Efficient signcryption key encapsulation without random oracles. / Li, Fagen; Shirase, Masaaki; Takagi, Tsuyoshi.

Information Security and Cryptology - 4th International Conference, Inscrypt 2008, Revised Selected Papers. 2009. p. 47-59 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5487).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, F, Shirase, M & Takagi, T 2009, Efficient signcryption key encapsulation without random oracles. in Information Security and Cryptology - 4th International Conference, Inscrypt 2008, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5487, pp. 47-59, 4th International Conference on Information Security and Cryptology, Inscrypt 2008, Beijing, China, 12/14/08. https://doi.org/10.1007/978-3-642-01440-6_6
Li F, Shirase M, Takagi T. Efficient signcryption key encapsulation without random oracles. In Information Security and Cryptology - 4th International Conference, Inscrypt 2008, Revised Selected Papers. 2009. p. 47-59. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-01440-6_6
Li, Fagen ; Shirase, Masaaki ; Takagi, Tsuyoshi. / Efficient signcryption key encapsulation without random oracles. Information Security and Cryptology - 4th International Conference, Inscrypt 2008, Revised Selected Papers. 2009. pp. 47-59 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7edfbd2075674f639b47cb0cf44e8ce9,
title = "Efficient signcryption key encapsulation without random oracles",
abstract = "Recently, Tan proposed an insider secure signcryption key encapsulation mechanism (KEM) and an insider secure signcryption tag- KEM. His schemes are secure without random oracles (in the standard model). In this paper, we proposed a more efficient construction for signcryption KEM and tag-KEM. We prove their semantic security and existential unforgeability in the standard model. Compared to Tańs schemes, our corresponding schemes have 20{\%} faster speed in the key encapsulation, 33{\%} faster speed in the key decapsulation, 33{\%} shorter public key, 60{\%} shorter private key, and |p| bits shorter ciphertext.",
author = "Fagen Li and Masaaki Shirase and Tsuyoshi Takagi",
year = "2009",
month = "7",
day = "15",
doi = "10.1007/978-3-642-01440-6_6",
language = "English",
isbn = "9783642014390",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "47--59",
booktitle = "Information Security and Cryptology - 4th International Conference, Inscrypt 2008, Revised Selected Papers",

}

TY - GEN

T1 - Efficient signcryption key encapsulation without random oracles

AU - Li, Fagen

AU - Shirase, Masaaki

AU - Takagi, Tsuyoshi

PY - 2009/7/15

Y1 - 2009/7/15

N2 - Recently, Tan proposed an insider secure signcryption key encapsulation mechanism (KEM) and an insider secure signcryption tag- KEM. His schemes are secure without random oracles (in the standard model). In this paper, we proposed a more efficient construction for signcryption KEM and tag-KEM. We prove their semantic security and existential unforgeability in the standard model. Compared to Tańs schemes, our corresponding schemes have 20% faster speed in the key encapsulation, 33% faster speed in the key decapsulation, 33% shorter public key, 60% shorter private key, and |p| bits shorter ciphertext.

AB - Recently, Tan proposed an insider secure signcryption key encapsulation mechanism (KEM) and an insider secure signcryption tag- KEM. His schemes are secure without random oracles (in the standard model). In this paper, we proposed a more efficient construction for signcryption KEM and tag-KEM. We prove their semantic security and existential unforgeability in the standard model. Compared to Tańs schemes, our corresponding schemes have 20% faster speed in the key encapsulation, 33% faster speed in the key decapsulation, 33% shorter public key, 60% shorter private key, and |p| bits shorter ciphertext.

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

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

U2 - 10.1007/978-3-642-01440-6_6

DO - 10.1007/978-3-642-01440-6_6

M3 - Conference contribution

AN - SCOPUS:67650159580

SN - 9783642014390

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 47

EP - 59

BT - Information Security and Cryptology - 4th International Conference, Inscrypt 2008, Revised Selected Papers

ER -