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

Bayesian Neural Network Based Encrypted Traffic Classification using Initial Handshake Packets

Abstract: Traffic classification has garnered significant attention from researchers owing to its applicability in a wide range of network management systems. The identification and categorization of network traffic are usually based on various parameters such as the port numbers, payload signatures, and statistical features. These methods face difficulty in classifying encrypted traffic flows for secure communication. We propose a novel payload-based classification that exploits unencrypted handshake packets, which are exchanged between the end hosts for transport layer security establishment. We use Bayesian neural network as the classifier, which takes cipher suite, compression method, and TLS extension information of the handshake packets as the inputs. We conducted comparative experiments to show that the proposed method outperforms other traditional payload-based classifiers.

Control method and electronic device

Abstract: An embodiment of the invention discloses a control method comprising the following steps: a first electronic device and a second electronic device shake hands with each other for voice communication; based on communication handshake processes, a second mobile network based on which communication handshake operation is conducted by the second electronic device; based on the second mobile network, a first mobile network based on which the first electronic device shakes hands with the second mobile network for communication is chosen; the communication handshake operation is conducted via the first mobile network and the second mobile network, voice transmitted in a communication channel is processed based on first bandwidth audio frequency parameters of the first mobile network and second bandwidth audio frequency parameters of the second mobile network, and first bandwidth of the first mobile network is matched with second bandwidth of the second mobile network. The embodiment of the invention also discloses an electronic device.

Analysis of a Randomized Dynamic Timetable Handshake Algorithm

Abstract: In this paper we introduce and study a handshake algorithm based on random delays. This algorithm can also be considered as a probabilistic distributed algorithm to find a (maximal) matching. Each process of the network generates a random time, chosen uniformly in the real interval [0,1] for each of its neighboring processes. The generated number is supposed to be a possible time for a handshake, if both processes are available at that time. Initially the number of potentially possible times proposed by the processes is twice the number of links between them. Whenever the clock reaches the smallest generated item, there will be a handshake between the process that proposes this time and the requested process and they cancel all other data from their timetable, informing their other neighboring processes, which in turn remove the times proposed by the two processes. The process continues in the remaining processes equipped with the updated timetable until the unit time 1 has expired. This algorithm is substantially more efficient than previous ones known to us, in that the expected number of handshakes per round is larger.

A practical approach to portscan detection in very high-speed links

Abstract: Port scans are continuously used by both worms and human attackers to probe for vulnerabilities in Internet facing systems. In this paper, we present a new method to efficiently detect TCP port scans in very high-speed links. The main idea behind our approach is to early discard those handshake packets that are not strictly needed to reliably detect port scans. We show that with just a couple of Bloom filters to track active servers and TCP handshakes we can easily discard about 85% of all handshake packets with negligible loss in accuracy. This significantly reduces both the memory requirements and CPU cost per packet. We evaluated our algorithm using packet traces and live traffic from 1 and 10 GigE academic networks. Our results show that our method requires less than 1 MB to accurately monitor a 10 Gb/s link, which perfectly fits in the cache memory of nowadays' general-purpose processors.

WebRTC Data Channel Establishment Protocol

Abstract: The WebRTC framework specifies protocol support for direct interactive rich communication using audio, video, and data between two peers' web-browsers. This document specifies a simple protocol for establishing symmetric Data Channels between the peers. It uses a two way handshake and allows sending of user data without waiting for the handshake to complete.