This paper introduces a high-security post-quantum stateless hash-based signature scheme that signs hundreds of messages per second on a modern 4-core 3.5GHz Intel CPU. Signatures are 41 KB, public keys are 1 KB, and private keys are 1 KB. The signature scheme is de­ signed to provide long-term 2 security even against attackers equipped with quantum computers. Unlike most hash-based designs, th...

Complexity issues and the requirements on semantic web application in the Life Science domains recently motivated a few works on stateless service description languages [1, 5]. With stateless services, it is possible to reason about the semantic relationships between inputs and outputs, while keeping matchmaking and composition decidable. In this paper we extend the languages introduced in [1] ...

In stateless core (SCORE) networks, edge routers maintain per-flow state while core routers do not. Core stateless fair queuing (CSFQ) has been proposed for approximating the operation of per-flow queuing techniques in SCORE networks. However, the packet dropping probability offered by CSFQ suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation for TCP flows. This paper propo...

In 1 , a framework of core-stateless fair queueing CSFQ , which does not require per flow management or operation at core routers, was proposed. It is able to provide high quality of services while maintaining a high level of robustness, simplicity and scalability. In this framework, one key element is the calculation of the fair share rate, which is briefly reviewed in the next section. The ac...

This paper shows that it is feasible to implement the stateless hash-based signature scheme SPHINCS-256 on an embedded microprocessor with memory even smaller than a signature and limited computing power. We demonstrate that it is possible to generate and verify the 41KB signature on an ARM Cortex M3 that only has 16KB of memory available. We provide benchmarks for our implementation which show...

It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, the CD-system itself is not, as in each of its computations, the initial component and the successor ...

REST protocol has gained great popularity as a communication in the various areas such as web service and IoT devices. However, the current RESTful web service has shortcomings in the authentication process. We developed an ID-based authentication algorithm to achieve a secure and stateless RESTful web service. ID-based authentication process allows a server to handle the client’s request by ac...