Constructing practical signcryption KEM from standard assumptions without random oracles

Xiangxue Li; Haifeng Qian; Yu Yu; Yuan Zhou; Jian Weng

doi:10.1007/978-3-642-38980-1_12

Constructing practical signcryption KEM from standard assumptions without random oracles

Xiangxue Li
, Haifeng Qian^*
, Yu Yu
, Yuan Zhou
, Jian Weng

^*Corresponding author for this work

Software Engineering Institute

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

We present a direct construction for signcryption Key Encapsulation Mechanism (KEM) without random oracles under standard complexity assumptions. Chosen-ciphertext security is proven in the standard model under the DBDH assumption, and unforgeability is proven in the standard model under the CDH assumption. The proof technique allows us to achieve strong unforgeability from the weakly unforgeable Waters signature. The validity of the ciphertext of our signcryption KEM can be verified publicly, without knowledge of the decryption key.

Original language	English
Title of host publication	Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings
Pages	186-201
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-38980-1_12
State	Published - 2013
Event	11th International Conference on Applied Cryptography and Network Security, ACNS 2013 - Banff, AB, Canada Duration: 25 Jun 2013 → 28 Jun 2013

Publication series

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

Conference

Conference	11th International Conference on Applied Cryptography and Network Security, ACNS 2013
Country/Territory	Canada
City	Banff, AB
Period	25/06/13 → 28/06/13

Keywords

KEM
Signcryption
Standard Assumption
Standard Model

Access to Document

10.1007/978-3-642-38980-1_12

Cite this

Li, X., Qian, H., Yu, Y., Zhou, Y., & Weng, J. (2013). Constructing practical signcryption KEM from standard assumptions without random oracles. In Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings (pp. 186-201). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7954 LNCS). https://doi.org/10.1007/978-3-642-38980-1_12

Li, Xiangxue ; Qian, Haifeng ; Yu, Yu et al. / Constructing practical signcryption KEM from standard assumptions without random oracles. Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings. 2013. pp. 186-201 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1f890d64bd864a578f5787e5d0ee497e,

title = "Constructing practical signcryption KEM from standard assumptions without random oracles",

abstract = "We present a direct construction for signcryption Key Encapsulation Mechanism (KEM) without random oracles under standard complexity assumptions. Chosen-ciphertext security is proven in the standard model under the DBDH assumption, and unforgeability is proven in the standard model under the CDH assumption. The proof technique allows us to achieve strong unforgeability from the weakly unforgeable Waters signature. The validity of the ciphertext of our signcryption KEM can be verified publicly, without knowledge of the decryption key.",

keywords = "KEM, Signcryption, Standard Assumption, Standard Model",

author = "Xiangxue Li and Haifeng Qian and Yu Yu and Yuan Zhou and Jian Weng",

year = "2013",

doi = "10.1007/978-3-642-38980-1\_12",

language = "英语",

isbn = "9783642389795",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "186--201",

booktitle = "Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings",

note = "11th International Conference on Applied Cryptography and Network Security, ACNS 2013 ; Conference date: 25-06-2013 Through 28-06-2013",

}

Li, X , Qian, H , Yu, Y, Zhou, Y & Weng, J 2013, Constructing practical signcryption KEM from standard assumptions without random oracles. in Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7954 LNCS, pp. 186-201, 11th International Conference on Applied Cryptography and Network Security, ACNS 2013, Banff, AB, Canada, 25/06/13. https://doi.org/10.1007/978-3-642-38980-1_12

Constructing practical signcryption KEM from standard assumptions without random oracles. / Li, Xiangxue ; Qian, Haifeng ; Yu, Yu et al.
Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings. 2013. p. 186-201 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7954 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Constructing practical signcryption KEM from standard assumptions without random oracles

AU - Li, Xiangxue

AU - Qian, Haifeng

AU - Yu, Yu

AU - Zhou, Yuan

AU - Weng, Jian

PY - 2013

Y1 - 2013

N2 - We present a direct construction for signcryption Key Encapsulation Mechanism (KEM) without random oracles under standard complexity assumptions. Chosen-ciphertext security is proven in the standard model under the DBDH assumption, and unforgeability is proven in the standard model under the CDH assumption. The proof technique allows us to achieve strong unforgeability from the weakly unforgeable Waters signature. The validity of the ciphertext of our signcryption KEM can be verified publicly, without knowledge of the decryption key.

AB - We present a direct construction for signcryption Key Encapsulation Mechanism (KEM) without random oracles under standard complexity assumptions. Chosen-ciphertext security is proven in the standard model under the DBDH assumption, and unforgeability is proven in the standard model under the CDH assumption. The proof technique allows us to achieve strong unforgeability from the weakly unforgeable Waters signature. The validity of the ciphertext of our signcryption KEM can be verified publicly, without knowledge of the decryption key.

KW - KEM

KW - Signcryption

KW - Standard Assumption

KW - Standard Model

UR - https://www.scopus.com/pages/publications/84879872677

U2 - 10.1007/978-3-642-38980-1_12

DO - 10.1007/978-3-642-38980-1_12

M3 - 会议稿件

AN - SCOPUS:84879872677

SN - 9783642389795

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

SP - 186

EP - 201

BT - Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings

T2 - 11th International Conference on Applied Cryptography and Network Security, ACNS 2013

Y2 - 25 June 2013 through 28 June 2013

ER -

Li X , Qian H , Yu Y, Zhou Y, Weng J. Constructing practical signcryption KEM from standard assumptions without random oracles. In Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings. 2013. p. 186-201. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-38980-1_12

Constructing practical signcryption KEM from standard assumptions without random oracles

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this