Chosen ciphertext security on hard membership decision groups: The case of semi-smooth subgroups of quadratic residues

Takashi Yamakawa, Shota Yamada, Koji Nuida, Goichiro Hanaoka, Noboru Kunihiro

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Nowadays, the chosen ciphertext (CCA) security is considered as the de facto standard security notion for public key encryption (PKE). CCA secure PKE schemes are often constructed on efficiently recognizable groups i.e., groups where the corresponding membership decision problem is easy. On the other hand, when we prove the CCA security of PKE schemes on not efficiently recognizable groups, much care are required. For example, even if a decryption query involves an unexpected element out of the group which causes a problem, the challenger cannot detect it due to the hardness of the membership decision for the group. However, such a possibility is often overlooked. As an example of such a group, in this paper, we consider the semi-smooth subgroup which was proposed by Groth (TCC 2005) for enhancing efficiency of factoring-based cryptographic primitives. Specifically, we propose a general technique to guarantee the CCA security of PKE schemes on the semi-smooth subgroup. Roughly speaking, we prove that for almost all natural “verification equations,” it is impossible to generate a query which does not consist of elements in the group and satisfies the equation if the factoring problem is hard. Hence, queries whose components are not in the group will be automatically rejected even though the simulator cannot recognize whether these components are in the group or not. By the same technique, we also prove that the strong Diffie-Hellman assumption holds on the “signed” semi-smooth subgroup under the factoring assumption, and improve the efficiency of a factoring-based noninteractive key exchange scheme by instantiating it on the semi-smooth subgroup.

Original languageEnglish
Title of host publicationSecurity and Cryptography for Networks - 9th International Conference, SCN 2014, Proceedings
EditorsMichel Abdalla, Roberto de Prisco
PublisherSpringer Verlag
Pages558-577
Number of pages20
ISBN (Electronic)9783319108780
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event9th International Conference on Security and Cryptography for Networks, SCN 2014 - Amalfi, Italy
Duration: Sep 3 2014Sep 5 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8642
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Conference on Security and Cryptography for Networks, SCN 2014
CountryItaly
CityAmalfi
Period9/3/149/5/14

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Chosen ciphertext security on hard membership decision groups: The case of semi-smooth subgroups of quadratic residues'. Together they form a unique fingerprint.

Cite this