Paper 2009/566
New Cryptosystems From CSP-Based Self-Distributive Systems
Licheng Wang, Lihua Wang, Zhenfu Cao, Eiji Okamoto, and Jun Shao
Abstract
We propose new cryptosystems based on self-distributive systems that are defined by conjugator searching problems (CSP) in noncommutative groups. 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. Moreover, our proposal is instantiated with braid groups, and leads to a new braid-based encryption scheme and its security is directly rooted in the intractability assumption of CSP in braid groups.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Self-distributive systemsconjugator searching problemsbraid groupscryptosystems
- Contact author(s)
- wanglc cn @ gmail com
- History
- 2010-04-16: last of 4 revisions
- 2009-11-23: received
- See all versions
- Short URL
- https://ia.cr/2009/566
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/566,
author = {Licheng Wang and Lihua Wang and Zhenfu Cao and Eiji Okamoto and Jun Shao},
title = {New Cryptosystems From {CSP}-Based Self-Distributive Systems},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/566},
year = {2009},
url = {https://eprint.iacr.org/2009/566}
}
