................................................. v 1 . INTRODUCTION ........................................... 1 2 . PSEUDO RANDOM NUMBER GENERATION .................... 3 3 . APPLICATION TO THE KEY MANAGEMENT PROBLEM . . . . . . . . . . 7 4 . IMPLEMENTATION ........................................ 11 5 . DISCUSSION .............................................. 13 REFERENCES ...................

We consider the notion of a non-interactive key exchange (NIKE). A NIKE scheme allows a party A to compute a common shared key with another party B from B’s public key and A’s secret key alone. This computation requires no interaction between A and B, a feature which distinguishes NIKE from regular (i.e., interactive) key exchange not only quantitatively, but also qualitatively. Our first contr...

Several protocols implementing attribute-based group key exchange, which allows users with certain set of attributes to establish a session key, have been proposed in recent years. However, attacks on attribute-based group key exchange in current research have been considered only in stand-alone fashion. Thus these protocols may be vulnerable when run with other protocol sessions concurrently. ...

Group key agreement protocols are designed to solve the fundamental problem of securely establishing a session key among a group of parties communicating over a public channel. Although a number of protocols have been proposed to solve this problem over the years, they are not well suited for a high-delay wide area network; their communication overhead is significant in terms of the number of c...

We study the security of the widely deployed Secure Session Layer/Transport Layer Security (TLS) key agreement protocol. Our analysis identifies, justifies, and exploits the modularity present in the design of the protocol: the application keys offered to higher level applications are obtained from a master key, which in turn is derived, through interaction, from a pre-master key. Our first con...

Recently, LaMacchia, Lauter and Mityagin proposed the extended Canetti-Krawczyk (eCK) model for Authenticated Key Exchange (AKE) protocols that covers many attacks on existing models. An ID-based AKE protocol with Perfect Forward Secrecy (PFS) (respectively Master Perfect Forward Secrecy (MPFS)) ensures that revelation of the static keys of the parties (respectively the master secret key of the...

We introduce a formal model for certificateless authenticated key exchange (CL-AKE) protocols. Contrary to what might be expected, we show that the natural combination of an ID-based AKE protocol with a public key based AKE protocol cannot provide strong security. We provide the first one-round CL-AKE scheme proven secure in the random oracle model. We introduce two variants of the Diffie-Hellm...

Dear Editor: The article on “Pre-Osteoarthritis: Definition and Diagnosis of an Elusive Clinical Entity” by Ryd et al. is of great interest and importance. The concept and definition of “pre-osteoarthritis” has been a focus of my research program for more than a decade. Some of our prior work was summarized in an open access article from 2012 titled “Early Diagnosis to Enable Early Treatment of...

In this paper we propose a light-weight random key pre-distributed scheme based on deployment knowledge. It uses only one hop for key distribution. It leads to a substantial reduction in energy requirement while improving key sharing and resilience factor compared to the scheme proposed in [1]. We develop the theoretical background of the proposed scheme and explain why the proposed scheme perf...