Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Youngkyung | - |
dc.contributor.author | Lee, Dong Hoon | - |
dc.contributor.author | Park, Jong Hwan | - |
dc.date.accessioned | 2021-12-08T18:41:26Z | - |
dc.date.available | 2021-12-08T18:41:26Z | - |
dc.date.created | 2021-08-30 | - |
dc.date.issued | 2020-11 | - |
dc.identifier.issn | 0925-1022 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/130385 | - |
dc.description.abstract | The security of public-key encryption (PKE) schemes in a multi-user setting is aimed at capturing real-world scenarios in which an adversary could attack multiple users and multiple ciphertexts of its choice. However, the fact that a real-world adversary can also mount key-exposure attacks for a set of multiple public keys requires us to consider a more realistic notion of security in multi-user settings. In this study, we establish the security notion of PKE in a multi-user settingwith corruptions, where an adversary is able to issue (adaptive) encryption, decryption, and corruption (i.e., private key) queries. We then propose the first practical PKE scheme whose security is proven in a multi-user setting with corruptions. The security of our scheme is based on the computational Diffie-Hellman (CDH) assumption and is proven to be tightly chosen-ciphertext secure in a random oracle model. Our scheme essentially follows the recently proposed modular approach of combining KEM and augmented DEM in a multi-user setting, but we show that this modular approach works well in a multi-user setting with corruptions. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.subject | PUBLIC-KEY ENCRYPTION | - |
dc.title | Tightly CCA-secure encryption scheme in a multi-user setting with corruptions | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Dong Hoon | - |
dc.identifier.doi | 10.1007/s10623-020-00794-z | - |
dc.identifier.scopusid | 2-s2.0-85090241507 | - |
dc.identifier.wosid | 000565511200002 | - |
dc.identifier.bibliographicCitation | DESIGNS CODES AND CRYPTOGRAPHY, v.88, no.11, pp.2433 - 2452 | - |
dc.relation.isPartOf | DESIGNS CODES AND CRYPTOGRAPHY | - |
dc.citation.title | DESIGNS CODES AND CRYPTOGRAPHY | - |
dc.citation.volume | 88 | - |
dc.citation.number | 11 | - |
dc.citation.startPage | 2433 | - |
dc.citation.endPage | 2452 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | PUBLIC-KEY ENCRYPTION | - |
dc.subject.keywordAuthor | Public-key encryption | - |
dc.subject.keywordAuthor | Multi-user setting with corruptions | - |
dc.subject.keywordAuthor | CDH | - |
dc.subject.keywordAuthor | Tight security | - |
dc.subject.keywordAuthor | Random oracle model | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.