Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal.
In order to prove the ElGamal CCA(Chosen Ciphertext Attack) security in the random oracle model, it is necessary to use the group where ICDH(Interactive Computational Diffie Hellman) assumption holds. Until now, only bilinear group with complex algebraic structure has been known as the ICDH group. I...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2023-01-01
|
| Series: | PLoS ONE |
| Online Access: | https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0294840&type=printable |
| _version_ | 1827585979003699200 |
|---|---|
| author | Gyu Chol Kim Hyon A Ji Yong Bok Jong Gwang Hyok Kim Hak Su Kim |
| author_facet | Gyu Chol Kim Hyon A Ji Yong Bok Jong Gwang Hyok Kim Hak Su Kim |
| author_sort | Gyu Chol Kim |
| collection | DOAJ |
| description | In order to prove the ElGamal CCA(Chosen Ciphertext Attack) security in the random oracle model, it is necessary to use the group where ICDH(Interactive Computational Diffie Hellman) assumption holds. Until now, only bilinear group with complex algebraic structure has been known as the ICDH group. In this paper, we introduce the ICDH group with simple algebraic structure. In other words, we prove that ICDH assumption holds in the integer group with composite modulus. On the basis of this, we propose the CCA secure hashed ElGamal and its fast variant to speed up decryption by parallel processing. Our parallel scheme has the fastest decryption among all CCA secure PKE(Public Key Encryption) schemes implemented in integer group and gives the possibility that ElGamal protocol could be practical when the big modulus numbers are used to resist the quantum attack. |
| first_indexed | 2024-03-08T23:54:26Z |
| format | Article |
| id | doaj.art-1e05cb0891cf4867942b385ae546f83f |
| institution | Directory Open Access Journal |
| issn | 1932-6203 |
| language | English |
| last_indexed | 2024-03-08T23:54:26Z |
| publishDate | 2023-01-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS ONE |
| spelling | doaj.art-1e05cb0891cf4867942b385ae546f83f2023-12-13T05:32:28ZengPublic Library of Science (PLoS)PLoS ONE1932-62032023-01-011811e029484010.1371/journal.pone.0294840Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal.Gyu Chol KimHyon A JiYong Bok JongGwang Hyok KimHak Su KimIn order to prove the ElGamal CCA(Chosen Ciphertext Attack) security in the random oracle model, it is necessary to use the group where ICDH(Interactive Computational Diffie Hellman) assumption holds. Until now, only bilinear group with complex algebraic structure has been known as the ICDH group. In this paper, we introduce the ICDH group with simple algebraic structure. In other words, we prove that ICDH assumption holds in the integer group with composite modulus. On the basis of this, we propose the CCA secure hashed ElGamal and its fast variant to speed up decryption by parallel processing. Our parallel scheme has the fastest decryption among all CCA secure PKE(Public Key Encryption) schemes implemented in integer group and gives the possibility that ElGamal protocol could be practical when the big modulus numbers are used to resist the quantum attack.https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0294840&type=printable |
| spellingShingle | Gyu Chol Kim Hyon A Ji Yong Bok Jong Gwang Hyok Kim Hak Su Kim Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal. PLoS ONE |
| title | Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal. |
| title_full | Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal. |
| title_fullStr | Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal. |
| title_full_unstemmed | Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal. |
| title_short | Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal. |
| title_sort | possibility of decryption speed up by parallel processing in cca secure hashed elgamal |
| url | https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0294840&type=printable |
| work_keys_str_mv | AT gyucholkim possibilityofdecryptionspeedupbyparallelprocessinginccasecurehashedelgamal AT hyonaji possibilityofdecryptionspeedupbyparallelprocessinginccasecurehashedelgamal AT yongbokjong possibilityofdecryptionspeedupbyparallelprocessinginccasecurehashedelgamal AT gwanghyokkim possibilityofdecryptionspeedupbyparallelprocessinginccasecurehashedelgamal AT haksukim possibilityofdecryptionspeedupbyparallelprocessinginccasecurehashedelgamal |