%0 Conference Proceedings
%T Security Analysis of Public Key Encryptions Based on Conjugacy Search Problem
%+ Akita University
%A Yamamura, Akihiro
%Z Part 2: The 2014 Asian Conference on Availability, Reliability and Security, AsiaARES 2014
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 2nd Information and Communication Technology - EurAsia Conference (ICT-EurAsia)
%C Bali, Indonesia
%Y David Hutchison
%Y Takeo Kanade
%Y Bernhard Steffen
%Y Demetri Terzopoulos
%Y Doug Tygar
%Y Gerhard Weikum
%Y Linawati
%Y Made Sudiana Mahendra
%Y Erich J. Neuhold
%Y A Min Tjoa
%Y Ilsun You
%Y Josef Kittler
%Y Jon M. Kleinberg
%Y Alfred Kobsa
%Y Friedemann Mattern
%Y John C. Mitchell
%Y Moni Naor
%Y Oscar Nierstrasz
%Y C. Pandu Rangan
%I Springer
%3 Information and Communication Technology
%V LNCS-8407
%P 554-563
%8 2014-04-14
%D 2014
%R 10.1007/978-3-642-55032-4_57
%K Conjugacy Search Problem
%K DDH Assumption
%K Monoid Action
%K Universal Hash Functions
%K Leftover Hash Lemma
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%Z TC 5
%Z TC 8
%2 https://inria.hal.science/hal-01397269/document
%2 https://inria.hal.science/hal-01397269/file/978-3-642-55032-4_57_Chapter.pdf
%L hal-01397269
%U https://inria.hal.science/hal-01397269
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC5
%~ IFIP-TC8
%~ IFIP-ICT-EURASIA
%~ IFIP-LNCS-8407