An ideal secret sharing scheme is a method of sharing a secret key in some key space among a finite set of participants in such a way that only the authorized subsets of participants can reconstruct the secret key from their shares which are of the same length as that of the secret key. The set of all authorized subsets of participants is the access structure of the secret sharing scheme. In th...

We present two new schemes that, in the absence of a centralized support, allow a pair of nodes of a mobile ad hoc network to compute a shared key without communicating. Such a service is important to secure routing protocols [1–3]. The schemes are built using the well-known technique of threshold secret sharing and are secure against a collusion of up to a certain number of nodes. We evaluate ...

In this paper, a new multi authority electronic voting scheme based on elliptic curves is proposed. According to the proposed scheme, each voter casts the vote as a point on the elliptic curve and the final tally is computed with the assistance of multiple authorities. A trusted center is involved in the scheme to distribute the shared secret key among the authorities and the Shamir (t, n) thre...

The current work proposes a new scheme for the replication of authentication services in Kuperee based on a public key cryptosystem, in response to the two main shortcomings of the traditional single server solutions, namely those of low availability and high security risks. The work represents further developments in the Kuperee authentication system. The Kuperee server is presented in its bas...

This paper presents a cost-effective private-key cryptosystem for color images. The scheme allows for secret sharing of the color image by generating two color shares with dimensions identical to those of the original. Encryption is performed via simple binary operations realized at the image bit-levels altering both the spectral correlation among the RGB color components and the spatial correl...

Design secure Authenticated Key Exchange (AKE) protocol without NAXOS approach is remaining as an open problem. NAXOS approach [4] is used to hide the secret ephemeral key from an adversary even if the adversary in somehow may obtain the ephemeral secret key. Using NAXOS approach will cause two main drawbacks, (i) leaking of the static secret key which will be used in computing the exponent of ...

We show that the criticism of a recent comment [1] on the insecurity of a quantum secret sharing protocol proposed in [2] is based on a misconception about the meaning of security and hence is invalid. The same misconception also appears in another comment of the authors [3] on the security of an entangled-based quantum key distribution protocol [4, 5].

In wireless sensor networks, the key deployment problem has received little attention, whereas it is in fact fundamental, heavily involving crucial (scarce) resources of ad-hoc networks, such as memory and energy availability. In this paper, we first briefly survey the state-of-the art of key deployment strategies that are amenable to ad-hoc network. Then we proposed two possible methods and we...

The Short Secret Sharing Protocols (S3P), proposed by Roe et al in 1998 [13] and revised in 2003 [14], is a family of protocols that bootstrap secure session keys from weak secrets such as passwords. In this letter, we describe an attack against the RSA variants of the S3P protocols. The attacker can successfully masquerade as one of the participants, establish a new session, and gain knowledge...