Round-trip Message Research Articles

GOLPMA: GROUP ORIENTED LIGHTWEIGHT PAYLOAD-BASED MUTUAL AUTHENTICATION FOR SECURED IoT COMMUNICATION

The rise of the Internet of Things (IoT) has increased the emphasis on protecting device communication. The Constrained Application Protocol (CoAP) extensively utilizes Datagram Transport Layer Security (DTLS) to provide end-to-end security; however, DTLS has a high connection overhead. This work presents a new Group Oriented Lightweight Payload-based Mutual Authentication (GOLPMA) mechanism that authenticates clients and servers before permitting communication using the Advanced Encryption Standard (AES). GOLPMA combines and improves essential parts of the CoAP architecture, resulting in a low-overhead, dependable, and computationally efficient alternative to DTLS. The payload-based mutual authentication technique only requires two round-trip message exchanges and restricts the payload of each message to 256 bits. GOLPMA surpasses typical DTLS/CoAP techniques based on throughput, latency, packet delivery ratio, average response time, mean jitter, authentication time and energy consumption in two separate network topologies with 15 and 30 nodes when examined using the Cooja simulator on Contiki OS. The results suggest that GOLPMA could be a safe, low-power replacement for DTLS in IoT applications

RMWPaxos: Fault-Tolerant In-Place Consensus Sequences

Building consensus sequences based on distributed, fault-tolerant consensus, as used for replicated state machines, typically requires a separate distributed state for every new consensus instance. Allocating and maintaining this state causes significant overhead. In particular, freeing the distributed, outdated states in a fault-tolerant way is not trivial and adds further complexity and cost to the system. In this paper, we propose an extension to the single-decree Paxos protocol that can learn a sequence of consensus decisions 'in-place', i.e. with a single set of distributed states. Our protocol does not require dynamic log structures and hence has no need for distributed log pruning, snapshotting, compaction, or dynamic resource allocation. The protocol builds a fault-tolerant atomic register that supports arbitrary read-modify-write operations. We use the concept of consistent quorums to detect whether the previous consensus still needs to be consolidated or is already finished so that the next consensus value can be safely proposed. Reading a consolidated consensus is done without state modifications and is thereby free of concurrency control and demand for serialisation. A proposer that is not interrupted reaches agreement on consecutive consensus decisions within a single message round-trip per decision by preparing the acceptors eagerly with the previous request.

Lightweight non-distance-bounding means to address RFID relay attacks

A relay attack is accomplished by simply relaying messages between a prover (e.g., an RFID tag) and a verifier (e.g., an RFID reader) with the goal of convincing the verifier of its close physical proximity to the prover. In almost all relay attack scenarios, the verifier essentially communicates with a prover that is outside the verifier's read-range. Relay attacks are notorious since they occur without the knowledge of the reader and/or tag, and has the potential to cause damage to honest parties (here, RFID reader and/or tag). Almost all means to address relay attacks in RFID systems to date are based on the proximity check idea that involves the measurement of message round trip times between tag and reader. With the speed of light at play, such measurements need not necessarily be accurate and could result in the false assumption of relay attack absence. Our review of published literature on approaches that use non-distance-based means to address relay attacks revealed ambient conditions' potential. We critically evaluate ambient conditions and develop a lightweight mutual authentication protocol that is based on magnetometer readings to address relay attacks.

Automatic message compression with overload protection

In this paper, we show that it is possible to increase the message throughput of a large-scale industrial system by selectively compress messages. The demand for new high-performance message processing systems conflicts with the cost effectiveness of legacy systems. The result is often a mixed environment with several concurrent system generations. Such a mixed environment does not allow a complete replacement of the communication backbone to provide the increased messaging performance. Thus, performance-enhancing software solutions are highly attractive. Our contribution is (1) an online compression mechanism that automatically selects the most appropriate compression algorithm to minimize the message round trip time; (2) a compression overload mechanism that ensures ample resources for other processes sharing the same CPU. We have integrated 11 well-known compression algorithms/configurations and tested them with production node traffic. In our target system, automatic message compression results is a 9.6% reduction of message round trip time. The selection procedure is fully automatic and does not require any manual intervention. The automatic behavior makes it particularly suitable for large systems where it is difficult to predict future system behavior.

속성 기반 암호화 방식을 이용한 다중 서버 패스워드 인증 키 교환

Password authenticated key exchange (PAKE) is a protocol that a client stores its password to a server, authenticates itself using its password and shares a session ke y with the server. In multi-server PAKE, a client splits its password and stores them to several servers separately. Unless all the servers are compromised, client's password will not be disclosed in the multi-server setting. In attribute-based encryption (ABE), a sender encrypts a message M using a set of attributes and then a receiver decrypts it using the same set of attributes. In this paper, we introduce multi-server PAKE protocol that utilizes a set of attributes of ABE as a client's password. In the protocol, the client and servers do not need to create additional public/private key pairs because the password is used as a set of public keys. Also, the client and the servers exchange only one round-trip message per server. The protocol is secure against dictionary attacks. We prove our system is secure in a proposed threat model. Finally we show feasibility through evaluating the execution time of the protocol.

FLAP: An Efficient WLAN Initial Access Authentication Protocol

Nowadays, with the rapid increase of WLAN-enabled mobile devices and the more widespread use of WLAN, it is increasingly important to have a more efficient initial link setup mechanism, and there is a demand for a faster access authentication method faster than the current IEEE 802.11i. In this paper, through experiments we observe that the authentication delay of 802.11i is intolerable under some scenarios, and we point that the main reason resulting in such inefficiency is due to its design from the framework perspective which introduces too many messages. To overcome this drawback, we propose an efficient initial access authentication protocol, FLAP, which realizes the authentications and key distribution through two roundtrip messages. We formally prove that our scheme is more secure than the four-way handshake protocol. Our practical measurement result indicates that FLAP can improve the efficiency of EAP-TLS by 94.7 percent. Extensive simulations are conducted in different scenarios, and the results demonstrate that when a WLAN gets crowded the advantage of FLAP becomes more salient. Furthermore, a simple and practical method is presented to make FLAP compatible with 802.11i.

Masking the overhead of protocol layering

Protocol layering has been advocated as a way of dealing with the complexity of computer communication. It has also been criticized for its performance overhead. In this paper, we present some insights in the design of protocols, and how these insights can be used to mask the overhead of layering, in a way similar to client caching in a file system. With our techniques, we achieve an order of magnitude improvement in end-to-end message latency in the Horus communication framework. Over an ATM network, we are able to do a round-trip message exchange, of varying levels of semantics, in about 170 µseconds, using a protocol stack of four layers that were written in ML, a high-level functional language.

YACKOS on a shared-memory multiprocessor

Yackos(yet another communication-kernel operating system)is designed for high speed, low latency inter-process communication. Speed is obtained by avoiding context switches and presenting to processes a low-level interface. Processes avoid context switches when passing messages by sharing data with the kernel. Yackos message passing was first implemented above Unix on Sequent shared-memory multiprocessors where round-trip messages can be passed in under 200 microseconds. It was then ported to both Sun and Vax workstations.

Performance of an edge-to-edge protocol in a simulated X.25/X.75 packet network

Roundtrip message response time was measured on a simulated packet network subjected to message traffic from interactive users. The links had impairments of errors and propagation delay. Each virtual circuit had its own edge-to-edge protocol. With no link-level protocol in place, the edge-to-edge protocol yielded good performance, provided that the edge-to-edge timeout threshold accounted for network delays due to packet queuing. A link-level protocol with too small a window (such as three) caused excessive network congestion and was worse than no link-level protocol at all. With a sufficient window, the link protocol offered an improvement under high-error conditions with light loads, but the improvement lessened as the load increased.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

A Study of Data Multiplexing Techniques and Delay Performance

This paper is concerned with the study of data multiplexing techniques which provide local distribution for user populations whose source characteristics may be categorized as Inquiry/Response. The techniques studied are Polling, Random Access, and a Loop System. In each method a group of users is multiplexed onto the same line which is connected to a Central Processor. The Central Processor forms the interface between the local system and long haul facilities, but does no computation on arriving messages other than to route them appropriately. The advantage of such systems is flexibility of operation and economy through sharing of equipment at the Central Processor. We focus our attention on the average round-trip message delay and use this as a measure for comparisons of the three techniques. Source models, in terms of calls per busy hour and number of bits per message for users as well as for computer responses, are developed which are appropriate in an Inquiry/Response context. Other factors taken into consideration are transmission rates, synchronization delay time, and allocation of available capacity to the transmission of overhead information, such as polling messages and acknowledgment traffic. The results of the study are presented in graphic form, where the average delay due to traffic in the system is plotted as a function of the number of stations. Principal conclusions can be summarized as follows: Polling — It is found that this system is sensitive to the synchronization delay which takes place each time a user station transmits to the central facility. For reasonable choices of system parameters as many as 100 stations can share the Central Processor without exceeding an average of 1-second round trip message delay. Random Access — This system is not sensitive to synchronization delay. Over most of the range of load parameters, the Random Access system shows lower average delay than the other two systems. Loop System — The study revealed that this system has average delay