A Security-Mediated Encryption Scheme Based on ElGamal Variant
| Autor: | Muhammad Rezal Kamel Ariffin, Amir Hamzah Abd Ghafar, Muhammad Asyraf Asbullah, Boon Chian Tea |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Scheme (programming language)
Theoretical computer science Third party business.industry Computer science General Mathematics pairing-free security mediated encryption scheme security mediator Encryption Random oracle computational diffie-hellman problem Computational diffie hellman problem Key revocation Ciphertext Computer Science (miscellaneous) QA1-939 EIGamal variant business Engineering (miscellaneous) computer ElGamal encryption encryption Mathematics computer.programming_language fast revocation |
| Zdroj: | Mathematics, Vol 9, Iss 2642, p 2642 (2021) Mathematics Volume 9 Issue 21 |
| ISSN: | 2227-7390 |
| Popis: | Boneh et al. introduced mediated RSA (mRSA) in 2001 in an attempt to achieve faster key revocation for medium-sized organizations via the involvement of a security mediator (SEM) as a semi-trusted third party to provide partial ciphertext decryption for the receiver. In this paper, a pairing-free security mediated encryption scheme based on an ElGamal variant is proposed. The scheme features a similar setting as in the mediated RSA but with a different underlying primitive. We show that the proposed security mediated encryption scheme is secure indistinguishably against chosen-ciphertext attack (IND-CCA) in the random oracle via the hardness assumption of the computational Diffie-Hellman (CDH) problem. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|