TY - JOUR
T1 - Dynamic Authenticated Asymmetric Group Key Agreement With Sender Non-Repudiation and Privacy for Group-Oriented Applications
AU - Zhang, Rui
AU - Zhang, Lei
AU - Choo, Kim Kwang Raymond
AU - Chen, Tong
N1 - Publisher Copyright:
© 2004-2012 IEEE.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - Group-oriented applications generally support communications for multiple entities (e.g., users and/or devices) through open networks. Typical requirements of group communications include secrecy, authentication, sender non-repudiation, and sender privacy. However, conventional approaches such as group key agreement and broadcast encryption are generally not designed to achieve all these requirements simultaneously or efficiently. In this article, we propose a one-round dynamic authenticated asymmetric group key agreement with sender non-repudiation and privacy (DAAGKAwSNP) protocol. A key building block of our DAAGKAwSNP protocol is our proposed batch multi-signature scheme with strong unforgeability. We prove that the DAAGKAwSNP protocol achieves secrecy under chosen ciphertext attacks - CCA, assuming the intractability of the computational Diffie-Hellman and k-Bilinear Diffie-Hellman exponent problem. We also evaluate DAAGKAwSNP's performance to demonstrate its utility.
AB - Group-oriented applications generally support communications for multiple entities (e.g., users and/or devices) through open networks. Typical requirements of group communications include secrecy, authentication, sender non-repudiation, and sender privacy. However, conventional approaches such as group key agreement and broadcast encryption are generally not designed to achieve all these requirements simultaneously or efficiently. In this article, we propose a one-round dynamic authenticated asymmetric group key agreement with sender non-repudiation and privacy (DAAGKAwSNP) protocol. A key building block of our DAAGKAwSNP protocol is our proposed batch multi-signature scheme with strong unforgeability. We prove that the DAAGKAwSNP protocol achieves secrecy under chosen ciphertext attacks - CCA, assuming the intractability of the computational Diffie-Hellman and k-Bilinear Diffie-Hellman exponent problem. We also evaluate DAAGKAwSNP's performance to demonstrate its utility.
KW - Group communication
KW - secrecy
KW - sender non-repudaition
KW - sender privacy
UR - https://www.scopus.com/pages/publications/85122319240
U2 - 10.1109/TDSC.2021.3138445
DO - 10.1109/TDSC.2021.3138445
M3 - 文章
AN - SCOPUS:85122319240
SN - 1545-5971
VL - 20
SP - 492
EP - 505
JO - IEEE Transactions on Dependable and Secure Computing
JF - IEEE Transactions on Dependable and Secure Computing
IS - 1
ER -