Security Analysis of Public Key Encryptions Based on Conjugacy Search Problem

Abstract : We report a fatal flaw of CSP-ElG scheme, one of public key encryptions based on conjugacy search problem proposed in INSCRYPT 2010. It does not satisfy the security property claimed as it is. We also discuss imperfections of security proofs of the other proposals: CSP-hElG and CSP-CS schemes. Following the technique given by Gennaro et al. to smooth a distribution of DH transform outputs, we introduce a computational assumption related to monoid actions and fix the CSP-ElG scheme using a universal hash function and the leftover hash lemma.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-01397269
Contributor : Hal Ifip <>
Submitted on : Tuesday, November 15, 2016 - 4:05:37 PM
Last modification on : Wednesday, November 16, 2016 - 1:04:11 AM
Long-term archiving on : Thursday, March 16, 2017 - 1:40:02 PM

File

978-3-642-55032-4_57_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Akihiro Yamamura. Security Analysis of Public Key Encryptions Based on Conjugacy Search Problem. 2nd Information and Communication Technology - EurAsia Conference (ICT-EurAsia), Apr 2014, Bali, Indonesia. pp.554-563, ⟨10.1007/978-3-642-55032-4_57⟩. ⟨hal-01397269⟩

Share

Metrics

Record views

96

Files downloads

126