Handshake

About: Handshake is a research topic. Over the lifetime, 1105 publications have been published within this topic receiving 15166 citations. The topic is also known as: 🤝.

Separating Crypto Negotiation and Communication

Abstract: Secure transport protocols often consist of three logically distinct components: transport, control (handshake), and record protection. Typically, such a protocol contains a single module that is responsible for all three functions. However, in many cases, this coupling is unnecessary. For example, while cryptographic context and endpoint capabilities need to be known before encrypted application data can be sent on a specific transport connection, there is otherwise no technical constraint that a cryptographic handshake must be performed on said connection. This document recommends a logical separation between transport, control, and record components of secure transport protocols. We compare existing protocols such as Transport Layer Security, QUIC, and IKEv2+ESP in the context of this logical separation.

Privacy Preservation Authentication: Group Secret Handshake with Multiple Groups

Abstract: The technique of group secret handshake (GSH) has been used to help the members affiliated with the same group in achieving private authentication. After executing GSH protocols, the participants affiliated with the group can compute a shared secret key, or generate a public encryption key while the true participants can self-compute their decryption keys. This paper presents a concrete GSH protocol with Multiple Groups. Only a legitimate member can prove that it belongs to a set of legitimate affiliations, but which affiliation it belongs to will not be leaked. The Group Authority can reveal the real identities of the fellows in the proposed scheme after analyzing the flow of communication. The proposed scheme can provide affiliation-hiding and detectability. In addition, it achieves Perfect Forward Secrecy.

A Case Study in Modeling a Fault-tolerant Satellite System Through Implementation of Dynamic Reconfiguration via Handshake

Abstract: Fault tolerance of satellite systems is critical for ensuring the success of the space mission. To minimize redundancy of the on-board equipment, the satellite systems should rely on dynamic reconfiguration in case of failures of some of their components. In this paper, modeling and implementation of a handshake procedure has been presented that becomes a crucial part of the dynamic reconfiguration process of a satellite subsystem for data processing. The model for handshake methodology is specialized software for quickly and successfully recovering from the crisis and failure situation of the satellite system.

Practical Neighbor Discovery in Multi-carrier Ad Hoc Networks with Directional Antennas

Abstract: Neighbor discovery is a crucial step to establish links among the nodes in ad hoc network. Most existing researches on neighbor discovery are based on 1-way or 2-way handshake mechanism in single-carrier system, where nodes send 1-way or 2-way messages without getting acknowledgement from their neighbors. However, when the node scale becomes huge, the 1-way and 2-way handshake algorithms may increase the collision probability, which leads to a huge discovery time. In this paper, considering the multi-carrier system, we proposed a Multi-Hop Algorithm (MHA) to discover all the nodes using multiple 3-way handshake when the number of nodes is unknown beforehand. It can be applied in both the multi-hop and 1-hop scenario. Besides, the upper and lower bounds of the expected time to discover all the nodes are deduced. When there are four carriers in the system, the gap between the expected time and upper and lower bounds are only about 8.48% and 7.66%, respectively. It means that the theoretical bounds can serve as the effective guidance for the expected time. Through extensive simulations, we demonstrate that MHA can significantly decrease the expected time with the help of multi-carrier.