Key transfer protocols needs key generation center (KGC) to select and transport session keys to all communication entities secretly, that are mutually trusted. Often, during registration each entity shares a session keys that are encrypted under another secret key by the KGC. In this paper based on secret sharing scheme, we propose an authenticated key transfer protocol that once KGC can broad...

In 1979, Shamir and Blakley independently proposed the concept of secret key decentralization (Shamir, A, 1979, P.612-613 & Backly, G. R, 1979), and the mechanism implementing this idea was called as the (t, n)-threshold scheme. In two schemes, one secret key (the secret key of the system) was divided into n parts (n sub-secret keys) respectively kept by n persons, and for certain integer t(t<n...

Authenticated Key Exchange (AKE) protocols represent an important cryptographic mechanism that enables several parties to communicate securely over an open network. Elashry, Mu and Susilo proposed in 2015 an Identity Based Authenticated Key Exchange (IBAKE) protocol where different parties establish secure communication by means of their public identities. The authors also introduced a new secu...

This paper deals with a secret key agreement problem from correlated random numbers. It is proved that there is a pair of linear matrices that yields a secret key agreement in the situation wherein a sender, a legitimate receiver, and an eavesdropper have access to correlated random numbers. A relation between the coding problem of correlated sources and a secret key agreement problem from corr...

An (m, n) threshold scheme is to decompose the master key K into n secret shadows in such a way that the master key K cannot be reclaimed unless any m shadows are collected. However, any m 1 or fewer shadows provide absolutely no information about K. In 1989, Laih et al. proposed the concept of dynamic threshold schemes which allow the master key to be updated without changing the secret shadow...

We discuss how to recover RSA secret keys from noisy key bits with erasures and errors. There are two known algorithms recovering original secret keys from noisy keys. At Crypto 2009, Heninger and Shacham proposed a method for the case where an erroneous version of secret keys contains only erasures. Subsequently, Henecka et al. proposed a method for an erroneous version containing only errors ...

In our proposed scheme, the participants are arranged in a hierarchical structure according to their position or rank and each first level participant as a parent node delegates his power to the lower level hierarchical group members. The group members help to reconstruct the secret shares of their parent nodes in their absence and the secret key is reconstructed even if at least one parent nod...