Visible to the public AMOUN: Lightweight Scalable Multi-recipient Asymmetric Cryptographic Scheme

TitleAMOUN: Lightweight Scalable Multi-recipient Asymmetric Cryptographic Scheme
Publication TypeConference Paper
Year of Publication2019
AuthorsMansour, Ahmad, Malik, Khalid M., Kaso, Niko
Conference Name2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC)
Keywordsasymmetric cryptography, Asymmetric Encryption, Cathode ray tubes, Chinese remainder theorem, chosen plaintext attack, communication overhead, compositionality, Computational efficiency, decryption, dynamic networks, Encryption, group membership changes, high computational cost, Human Behavior, lightweight AMOUN, lightweight scalable multirecipient asymmetric cryptographic scheme, Metrics, Multi-recipient Encryption, multiple recipients, MultiRSA, network resources, privacy, pubcrawl, Public key, public key cryptography, Resiliency, securing multiparty communication, security analysis, symmetric cryptography
AbstractSecuring multi-party communication is very challenging particularly in dynamic networks. Existing multi-recipient cryptographic schemes pose variety of limitations. These include: requiring trust among all recipients to make an agreement, high computational cost for both encryption and decryption, and additional communication overhead when group membership changes. To overcome these limitations, this paper introduces a novel multi-recipient asymmetric cryptographic scheme, AMOUN. This scheme enables the sender to possibly send different messages in one ciphertext to multiple recipients to better utilize network resources, while ensuring that each recipient only retrieves its own designated message. Security analysis demonstrates that proposed scheme is secure against well-known attacks. Evaluation results demonstrate that lightweight AMOUN outperforms RSA and Multi-RSA in terms of computational cost for both encryption and decryption. For a given prime size, in case of encryption, AMOUN achieves 86% and 98% lower average computational cost than RSA and Multi-RSA, respectively; while for decryption, it shows performance improvement of 98% compared to RSA and Multi-RSA.
DOI10.1109/CCWC.2019.8666617
Citation Keymansour_amoun_2019