scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: In this paper, the Handshake between Invisible and Visible Hands is described as a "handshake between invisible and visible hands" in the context of the Swedish Quest for a Tripolar Institutional Framework.
Abstract: (1993). The Handshake between Invisible and Visible Hands. International Studies of Management & Organization: Vol. 23, Beyond Markets and Hierarchies: A Swedish Quest for a Tripolar Institutional Framework, pp. 87-106.

26 citations

01 Jan 1991
TL;DR: A formal method is introduced to compare CP-O programs, by estimating their size and speed when implemented as handshake circuits, and this method is applied to twoCP-O designs for dynamic programming.
Abstract: The CP-O programming language is described as an interface between the design of a system and its implementation as a VLSI layout. Before its translation into a VLSI layout, a Cp·O program is translated into a so-called handshake circuit. This circuit is optimised and its speed and size are estimated. The translation method and the optimisations are described. Furthermore, a formal method is introduced to compare CP-O programs, by estimating their size and speed when implemented as handshake circuits. The method is applied to two CP-O designs for dynamic programming.

25 citations

Patent
25 Nov 1986
TL;DR: In this paper, a method and system for generating a synchronized handshake between communicating parts of a digital system operating from a common clock is described, where a request signal is sent from an initiating station (10) to a responding station (12). The responding station acknowledges receipt of the request by sending an acknowledge signal back to the initiating station, thereby completing a so-called handshake.
Abstract: A method and system are provided for generating a synchronized handshake between communicating parts of a digital system operating from a common clock. A request signal is sent from an initiating station (10) to a responding station (12). The responding station acknowledges receipt of the request by sending an acknowledge signal back to the initiating station, thereby completing a so-called handshake. In accordance with the invention both the request and acknowledge signal are pulses of a fixed duration greater than one but less than two clock cycles. A new request signal may be transmitted concurrently with the reception of an acknowledge signal, resulting in a maximum handshake rate of one half of the common clock rate.

25 citations

Proceedings ArticleDOI
02 Oct 2005
TL;DR: This paper examines the problem of control overhead in handshake circuits and proposes new handshake component specifications and implementations that significantly reduce this overhead and are shown to produce a doubling of the performance of a 32-bit processor without making any changes to the original description.
Abstract: The development of robust synthesis techniques and tools is important if asynchronous design is to gain more widespread acceptance. Handshake circuits are a method of constructing asynchronous circuits from a set of modular components connected by handshake channels. They offer a level of abstraction above a particular target technology or implementation style. The Balsa system employs the handshake circuit approach and has demonstrated that it can be used to rapidly generate large, robust circuits. This speed and flexibility is currently achieved at the cost of performance. This paper examines the problem of control overhead in handshake circuits and proposes new handshake component specifications and implementations that significantly reduce this overhead. These changes are incorporated into the Balsa synthesis system and are shown to produce a doubling of the performance of a 32-bit processor without making any changes to the original description.

25 citations

Journal ArticleDOI
01 Oct 2019
TL;DR: This paper model the privacy guarantees of TLS 1.3 when parties execute a full handshake or use a session resumption, covering all the handshake modes of TLS, and prove that TLS1.3 protects the privacy of its users at least against passive adversaries, contrary to TLS 1-2.
Abstract: TLS (Transport Layer Security) is a widely deployed protocol that plays a vital role in securing Internet traffic. Given the numerous known attacks for TLS 1.2, it was imperative to change and even redesign the protocol in order to address them. In August 2018, a new version of the protocol, TLS 1.3, was standardized by the IETF (Internet Engineering Task Force). TLS 1.3 not only benefits from stronger security guarantees , but aims to protect the identities of the server and client by encrypting messages as soon as possible during the authentication. In this paper, we model the privacy guarantees of TLS 1.3 when parties execute a full handshake or use a session resumption, covering all the handshake modes of TLS. We build our privacy models on top of the one defined by Hermans et al. for RFIDs (Radio Frequency Identification Devices) that mostly targets authentication protocols. The enhanced models share similarities to the Bellare-Rogaway AKE (Authenticated Key Exchange) security model and consider adversaries that can compromise both types of participants in the protocol. In particular, modeling session resumption is non-trivial, given that session resumption tickets are essentially a state transmitted from one session to another and such link reveals information on the parties. On the positive side, we prove that TLS 1.3 protects the privacy of its users at least against passive adversaries, contrary to TLS 1.2, and against more powerful ones.

25 citations


Network Information
Related Topics (5)
The Internet
213.2K papers, 3.8M citations
79% related
Social network
42.9K papers, 1.5M citations
74% related
Wireless
133.4K papers, 1.9M citations
74% related
Encryption
98.3K papers, 1.4M citations
73% related
Wireless network
122.5K papers, 2.1M citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202358
2022140
202137
202065
201991
201877