Topic
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: 🤝.
Papers published on a yearly basis
Papers
More filters
•
25 Mar 2015
13 citations
•
21 Jun 1984
TL;DR: In this paper, the authors proposed a gate circuit via the handshake line between two operation modules, whereby to detect coincidence of a data send ready state and a data accept ready state in two of the operation modules.
Abstract: Transfer of data can be controlled by connecting operation modules, which share a single-circuit data bus line, together by a single-circuit handshake line, allocating the timing of use of the data bus line by time-division techniques in synchronization with a handshake clock when sending out and accepting data among the operation modules, and forming a gate circuit via the handshake line between two of the operation modules, whereby to detect coincidence of a data send ready state and a data accept ready state in the two of the operation modules. The above controlling method permits use of fewer control line, simple pipeline processing, shorter standing time, etc.
13 citations
••
08 Jul 2014TL;DR: The characteristics of a handshake between humans are physically examined aiming at future experiments with a handshakeBetween a human and a robot, which shows that handshaking consists of four phases.
Abstract: Physical and social interaction between humans and robots are important for humanoid robotics. In this article the characteristics of a handshake between humans are physically examined aiming at future experiments with a handshake between a human and a robot. A special pair of data gloves has been designed to measure quantitative characteristics of a handshake ritual such as duration, strength of the grip, and frequency of the rhythmic movements. Experiment results show that handshaking consists of four phases. After a physical contact, a mutual synchrony appears between the two persons. A statistical analysis shows that the frequency of this synchronization is around 4 Hz and average strength of the grip is 2.5 N.
13 citations
••
03 Jul 2017TL;DR: A novel k-time authenticated secret handshake protocol where each authorized user is only allowed to use the credential for k times is proposed, and the security of the proposed protocol under some computational problems which are proved hard in the generic bilinear group model is proved.
Abstract: Secret handshake allows a group of authorized users to establish a shared secret key and at the same time authenticate each other anonymously A straightforward approach to design an unlinkable secret handshake protocol is to use either long-term certificate or one-time certificate provided by a trusted authority However, how to detect the misusing of certificates by an insider adversary is a challenging security issue when using those approaches for unlinkable secret handshake In this paper, we propose a novel k-time authenticated secret handshake (k-ASH) protocol where each authorized user is only allowed to use the credential for k times We formalize security models, including session key security and anonymity, for k-ASH, and prove the security of the proposed protocol under some computational problems which are proved hard in the generic bilinear group model The proposed protocol also achieved public traceability property if a user misuses the k-time credential
13 citations
•
06 Oct 2011TL;DR: In this article, role conflicts between peers are eliminated by determining which peer will act as a client and which peer would act as server in a secure connection handshake in peer-to-peer environments.
Abstract: Methods of establishing secure communication channels in peer-to-peer environments are provided that eliminate role conflicts between peers by determining which peer will act as a client and which the peer will act as a server in a secure connection handshake. In one embodiment, an attribute of the handshake messages are used in a tiebreaker process to determine which peer assumes the role of the server. In another embodiment, the attribute may be used to compute a wait period for each peer, or the wait period may be based on a random time period, and the peers cancel their request and resent requests after waiting their respective time periods.
13 citations