English
Related papers

Related papers: A Secure and Efficient Protocol for Group Key agre…

200 papers

Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale. Traditional quantum communication protocols consume pair-wise entanglement, which is sub-optimal for distributed…

Secure Device-to-Device (D2D) communication is becoming increasingly important with the ever-growing number of Internet-of-Things (IoT) devices in our daily life. To achieve secure D2D communication, the key agreement between different IoT…

Networking and Internet Architecture · Computer Science 2021-03-29 Weitao Xu , Zhenjiang Li , Wanli Xue , Xiaotong Yu , Bo Wei , Jia Wang , Chengwen Luo , Wei Li , Albert Y. Zomaya

Akiyama et al. (Int. J. Math. Indust., 2019) proposed a post-quantum key exchange protocol that is based on the hardness of solving a system of multivariate non-linear polynomial equations but has a design strategy different from ordinary…

Cryptography and Security · Computer Science 2022-05-20 Keita Suzuki , Koji Nuida

This paper investigates a robust positive consensus problem for a class of heterogeneous high-order multi-agent systems subject to external inputs. Compared with existing multi-agent consensus results, the most distinct feature of the…

Systems and Control · Electrical Eng. & Systems 2023-05-10 Ruonan Li , Yutao Tang , Shurong Li

Post-quantum cryptography is essential for securing digital communications against threats posed by quantum computers. Re-searchers have focused on developing algorithms that can withstand attacks from both classical and quantum computers,…

Cryptography and Security · Computer Science 2025-01-22 Juan Pedro Hecht , Hugo Daniel Scolnik

Users of quantum networks can securely communicate via so-called (quantum) conference key agreement --making their identities publicly known. In certain circumstances, however, communicating users demand anonymity. Here, we introduce a…

This document is a technical overview and discussion of our work, a protocol for secure group messaging. By secure we mean for the actual users i.e. end-to-end security, as opposed to "secure" for irrelevant third parties. Our work provides…

Cryptography and Security · Computer Science 2016-06-16 Ximin Luo , Guy Kloss

Distributed consensus protocols provide a mechanism for spreading information within clustered networks, allowing agents and clusters to make decisions without requiring direct access to the state of the ensemble. In this work, we propose a…

Systems and Control · Electrical Eng. & Systems 2025-12-12 Federico M. Zegers , Sean Phillips

Messaging between two parties and in the group setting has enjoyed widespread attention both in practice, and, more recently, from the cryptographic community. One of the main challenges in the area is constructing secure (end-to-end…

Cryptography and Security · Computer Science 2023-01-25 David Balbás , Daniel Collins , Phillip Gajland

Secure group-oriented communication is crucial to a wide range of applications in Internet of Things (IoT). Security problems related to group-oriented communications in IoT-based applications placed in a privacy-sensitive environment have…

Cryptography and Security · Computer Science 2018-08-03 Hongxiang Gu , Miodrag Potkonjak

In this work we provide a suite of protocols for group key management based on general semigroup actions. Construction of the key is made in a distributed and collaborative way. Examples are provided that may in some cases enhance the…

Information Theory · Computer Science 2016-07-29 Juan Antonio Lopez-Ramos , Joachim Rosenthal , Davide Schipani , Reto Schnyder

Since communication signals are publicly exposed while they transmit across space, Ad Hoc Networks (MANETs) are where secured communication is most crucial. Unfortunately, these systems are more open to intrusions that range from passive…

Cryptography and Security · Computer Science 2023-05-01 B. Murugeshwari , R. Amirthavalli , C. Bharathi Sri , S. Neelavathy Pari

We study the fundamental limits of multi-server secure aggregation over a two-hop network where multiple servers, each connected to a disjoint subset of users, jointly compute the sum of all users' inputs. The goal is to ensure that no…

Information Theory · Computer Science 2026-04-30 Zhou Li , Xiang Zhang , Jiguang He , Giuseppe Caire

In contrast to proof-of-work replication, Byzantine quorum systems maintain consistency across replicas with higher throughput modest energy consumption, and deterministic liveness guarantees. If complemented with heterogeneous trust and…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-08-26 Xiao Li , Mohsen Lesani

Three closely-related polynomial-based group key pre-distribution schemes have recently been proposed, aimed specifically at wireless sensor networks. The schemes enable any subset of a predefined set of sensor nodes to establish a shared…

Cryptography and Security · Computer Science 2026-03-20 Chris J Mitchell

Many emerging applications in mobile adhoc networks involve group-oriented communication. Multicast is an efficient way of supporting group oriented applications, mainly in mobile environment with limited bandwidth and limited power. For…

Cryptography and Security · Computer Science 2010-03-10 D. SuganyaDevi , G. Padmavathi

We revisit the problem of secret key agreement using interactive public communication for two parties and propose a new secret key agreement protocol. The protocol attains the secret key capacity for general observations and attains the…

Information Theory · Computer Science 2016-03-11 Masahito Hayashi , Himanshu Tyagi , Shun Watanabe

With the rapid development of vehicular ad hoc Network (VANET), it is gaining significant popularity and receiving increasing attentions from academics and industry in security and efficiency. To address security and efficiency issues, a…

Cryptography and Security · Computer Science 2016-11-29 Mu Han , Lei Hua , Shidian Ma

The robustness of distributed systems is usually phrased in terms of the number of failures of certain types that they can withstand. However, these failure models are too crude to describe the different kinds of trust and expectations of…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-12-11 Isaac C. Sheff , Robbert van Renesse , Andrew C. Myers

In this paper, a new key-agreement scheme is proposed and analyzed. In addition to being provably secure in shared secret key indistinguishability model, the scheme has an interesting feature: while using exponentiation over a cyclic…

Cryptography and Security · Computer Science 2021-06-08 Abdelhaliem Babiker