New constructions of public-key encryption schemes from conjugacy search problems

Lihua Wang; Licheng Wang; Zhenfu Cao; Eiji Okamoto; Jun Shao

doi:10.1007/978-3-642-21518-6_1

New constructions of public-key encryption schemes from conjugacy search problems

Lihua Wang^*
, Licheng Wang^*
, Zhenfu Cao
, Eiji Okamoto
, Jun Shao

^*Corresponding author for this work

Japan National Institute of Information and Communications Technology
Beijing University of Posts and Telecommunications
Shanghai Jiao Tong University
University of Tsukuba
Zhejiang Gongshang University

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

15 Citations (Scopus)

Abstract

We propose new public-key encryption schemes based on the conjugacy search problems (CSP) over noncommutative monoids. Under the newly developed cryptographic assumptions, our basic construction is proven IND-CPA secure in the standard model. Then, we describe two extensions: The first is proven IND-CCA secure in the random oracle model, while the second achieves the IND-CCA security in the standard model. Finally, our proposal is instantiated by using the monoid of matrices over truncated multivariable polynomials over rings. Meanwhile, we also give a discussion on the possibility to instantiate our schemes with braid groups.

Original language	English
Title of host publication	Information Security and Cryptology - 6th International Conference, Inscrypt 2010, Revised Selected Papers
Pages	1-17
Number of pages	17
DOIs	https://doi.org/10.1007/978-3-642-21518-6_1
Publication status	Published - 2011
Externally published	Yes
Event	6th China International Conference on Information Security and Cryptology, Inscrypt 2010 - Shanghai, China Duration: 20 Oct 2010 → 24 Oct 2010

Publication series

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

Conference

Conference	6th China International Conference on Information Security and Cryptology, Inscrypt 2010
Country/Territory	China
City	Shanghai
Period	20/10/10 → 24/10/10

Keywords

braid groups
conjugacy search problems
public-key encryption
truncated multivariable polynomials over rings

Access to Document

10.1007/978-3-642-21518-6_1

Cite this

Wang, L., Wang, L., Cao, Z., Okamoto, E., & Shao, J. (2011). New constructions of public-key encryption schemes from conjugacy search problems. In Information Security and Cryptology - 6th International Conference, Inscrypt 2010, Revised Selected Papers (pp. 1-17). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6584 LNCS). https://doi.org/10.1007/978-3-642-21518-6_1

Wang, Lihua ; Wang, Licheng ; Cao, Zhenfu et al. / New constructions of public-key encryption schemes from conjugacy search problems. Information Security and Cryptology - 6th International Conference, Inscrypt 2010, Revised Selected Papers. 2011. pp. 1-17 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{4dcccc54273f409ca574862f980553b6,

title = "New constructions of public-key encryption schemes from conjugacy search problems",

abstract = "We propose new public-key encryption schemes based on the conjugacy search problems (CSP) over noncommutative monoids. Under the newly developed cryptographic assumptions, our basic construction is proven IND-CPA secure in the standard model. Then, we describe two extensions: The first is proven IND-CCA secure in the random oracle model, while the second achieves the IND-CCA security in the standard model. Finally, our proposal is instantiated by using the monoid of matrices over truncated multivariable polynomials over rings. Meanwhile, we also give a discussion on the possibility to instantiate our schemes with braid groups.",

keywords = "braid groups, conjugacy search problems, public-key encryption, truncated multivariable polynomials over rings",

author = "Lihua Wang and Licheng Wang and Zhenfu Cao and Eiji Okamoto and Jun Shao",

year = "2011",

doi = "10.1007/978-3-642-21518-6\_1",

language = "English",

isbn = "9783642215179",

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

pages = "1--17",

booktitle = "Information Security and Cryptology - 6th International Conference, Inscrypt 2010, Revised Selected Papers",

note = "6th China International Conference on Information Security and Cryptology, Inscrypt 2010 ; Conference date: 20-10-2010 Through 24-10-2010",

}

Wang, L, Wang, L, Cao, Z, Okamoto, E & Shao, J 2011, New constructions of public-key encryption schemes from conjugacy search problems. in Information Security and Cryptology - 6th International Conference, Inscrypt 2010, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6584 LNCS, pp. 1-17, 6th China International Conference on Information Security and Cryptology, Inscrypt 2010, Shanghai, China, 20/10/10. https://doi.org/10.1007/978-3-642-21518-6_1

New constructions of public-key encryption schemes from conjugacy search problems. / Wang, Lihua; Wang, Licheng; Cao, Zhenfu et al.
Information Security and Cryptology - 6th International Conference, Inscrypt 2010, Revised Selected Papers. 2011. p. 1-17 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6584 LNCS).

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

TY - GEN

T1 - New constructions of public-key encryption schemes from conjugacy search problems

AU - Wang, Lihua

AU - Wang, Licheng

AU - Cao, Zhenfu

AU - Okamoto, Eiji

AU - Shao, Jun

PY - 2011

Y1 - 2011

N2 - We propose new public-key encryption schemes based on the conjugacy search problems (CSP) over noncommutative monoids. Under the newly developed cryptographic assumptions, our basic construction is proven IND-CPA secure in the standard model. Then, we describe two extensions: The first is proven IND-CCA secure in the random oracle model, while the second achieves the IND-CCA security in the standard model. Finally, our proposal is instantiated by using the monoid of matrices over truncated multivariable polynomials over rings. Meanwhile, we also give a discussion on the possibility to instantiate our schemes with braid groups.

AB - We propose new public-key encryption schemes based on the conjugacy search problems (CSP) over noncommutative monoids. Under the newly developed cryptographic assumptions, our basic construction is proven IND-CPA secure in the standard model. Then, we describe two extensions: The first is proven IND-CCA secure in the random oracle model, while the second achieves the IND-CCA security in the standard model. Finally, our proposal is instantiated by using the monoid of matrices over truncated multivariable polynomials over rings. Meanwhile, we also give a discussion on the possibility to instantiate our schemes with braid groups.

KW - braid groups

KW - conjugacy search problems

KW - public-key encryption

KW - truncated multivariable polynomials over rings

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

U2 - 10.1007/978-3-642-21518-6_1

DO - 10.1007/978-3-642-21518-6_1

M3 - Conference contribution

AN - SCOPUS:79960825348

SN - 9783642215179

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

SP - 1

EP - 17

BT - Information Security and Cryptology - 6th International Conference, Inscrypt 2010, Revised Selected Papers

T2 - 6th China International Conference on Information Security and Cryptology, Inscrypt 2010

Y2 - 20 October 2010 through 24 October 2010

ER -

Wang L, Wang L, Cao Z, Okamoto E, Shao J. New constructions of public-key encryption schemes from conjugacy search problems. In Information Security and Cryptology - 6th International Conference, Inscrypt 2010, Revised Selected Papers. 2011. p. 1-17. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-21518-6_1

New constructions of public-key encryption schemes from conjugacy search problems

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this