We achieve the optimal round by transferring an interactive proof system to a non-interactive version, while preserving its security capability. Research ...

Round-Efficient Conference Key Agreement Protocols with Provable Security ; Wen-Guey Tzeng · Zhi-Jia Tzeng · DOI: 10.1007/3-540-44448-3_47 · Search ePrint ...

In this paper we consider the distributed conference key (conference key agreement) protocol. We present two round-efficient conference key agreement protocols, ...

We achieve the optimal round by transferring an interactive proof system to a non-interactive version, while preserving its security capability. 1.1 Related ...

Dive into the research topics of 'Round-efficient conference key agreement protocols with provable security'. Together they form a unique fingerprint. Sort by ...

A protocol meeting the bound is presented and it is proved it is secure in Bellare and Rogaway's model, which is much more efficient than other conference ...

We present a protocol meeting the bound and prove it is secure in Bellare and Rogaway's model. The protocol is much more efficient than other conference key ...

In this paper, we propose GDH key agreement protocols based on the secret sharing scheme. In addition, we use a one-way key confirmation and digital ...

For practical applications, efficiency is a critical concern in designing group key agreement in addition to provable security. In particular, number of rounds ...

Nov 14, 2024 · The proposed protocol employs scalar point multiplications over a prime field elliptic curve group, enabling secure and efficient CKA operations ...