Security Analysis of Public Key Encryptions Based on Conjugacy Search Problem - Information and Communication Technology Access content directly
Conference Papers Year : 2014

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.
Fichier principal
Vignette du fichier
978-3-642-55032-4_57_Chapter.pdf (103.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01397269 , version 1 (15-11-2016)

Licence

Attribution

Identifiers

Cite

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⟩
81 View
103 Download

Altmetric

Share

Gmail Facebook X LinkedIn More