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: 🤝.

Hardware/Software co-design of public-key cryptography for SSL protocol execution in embedded systems

Abstract: Modern mobile devices like cell phones or PDAs allow for a level of network connectivity similar to that of standard PCs, making access to the Internet possible from anywhere at anytime. Going along with this evolution is an increasing demand for cryptographically secure network connections with such resource-restricted devices. The Secure Sockets Layer (SSL) protocol is the current de-facto standard for secure communication over an insecure network like the Internet and provides protection against eavesdropping, message forgery and replay attacks. To achieve this, the SSL protocol employs a set of computation-intensive cryptographic algorithms, in particular public-key algorithms, which can result in unacceptably long delays on devices with modest processing capabilities. In this paper we introduce a hardware/software co-design approach for accelerating SSL protocol execution in resource-restricted devices. The software part of our co-design consists of MatrixSSLTM, a lightweight SSL implementation into which we integrated elliptic curve cryptography (ECC) to speed up the public-key operations performed during the SSL handshake. The hardware part comprises a SPARC V8 compliant processor core with instruction set extensions to support the low-level arithmetic operations carried out in ECC. Our co-design executes a full SSL handshake using an elliptic curve over a 192-bit prime field in less than 300 msec when the SPARC processor is clocked at 20 MHz. A pure software implementation like OpenSSL is, depending on the field type and order, up to a factor of 10 slower than our co-design solution.

Method and system for estabilishing connection

Abstract: The invention relates to a method and system for establishing a first type of connection, wherein a handshake processing is performed with the other party of the first type of connection. If the handshake processing is successful, the first type of connection is established. If the handshake processing is not successful, i.e. the other party does not support the first type of connection, a fallback procedure is started to change the call to a second type of connection determined during the connection establishment. The change to the second type of connection may be performed directly or may be based on a call retry procedure. Thereby, inconvenient disconnections or error processings at the end terminals can be prevented.

Optimizing secure communications between a client authenticating server and a mobile client

Abstract: Systems and techniques are described for optimizing secure communications. Specifically, a first intermediary and a second intermediary can split-terminate a secure connection handshake or a handshake renegotiation between two computing devices. The first and second intermediaries can then optimize secure communications between the two computing devices.

A Fault-Tolerant Handshake Algorithm for Local Computations

Abstract: Distributed systems have been studied thoroughly. Many applications are based on huge systems and one of the main property an algorithm running on such systems should verified is fault-tolerance. This paper presents a new randomized algorithm to solve the handshake problem in a distributed system. This algorithm is designed for an asynchronous distributed network ofanonymous processes under the message passing communication protocol. In addition to its fault-tolerance, this algorithm is more effective than the existing ones thanks to its asynchronous aspect. To highlight its performance, we provide an experimental evaluation by comparing it to the most representative algorithm solving the handshake problem. The experimentation is done using Visidia, a tool for simulating and visualizing distributed algorithms.

Efficient Unlinkable Secret Handshakes for Anonymous Communications

Abstract: The technique of secret handshake is used as a fundamental building block for anonymous peer-to-peer communications over untrusted networks. However, the fact that most existing schemes fail to meet unlinkability causes the use of schemes to limit for practical use. In this paper, we provide new constructions for unlinkable secret handshake, allowing arbitrary two communication parties with the same role in either one single group or multiple groups to privately authenticate each other. Compared to previous works, our techniques have much better performance in terms of both computational and communication cost, while they obtain good security results.