Traditional secret sharing schemes involve complex computation.A visual secret sharing (VSS) scheme decodes the secret without computation, but each shadow is m times as big as the original. Probabilistic VSS solved the computation complexity and space complexity problems at once. In this paper we propose a probabilistic (2, n) scheme for binary images and a deterministic (n, n) scheme for gray...

The threshold secret sharing technique has been used extensively in cryptography. This technique is used for splitting secrets into shares and distributing the shares in the network to provide protection against attacks and to reduce the possibility of loss of information. In this paper, a new approach is introduced to enhance communication security among the nodes in a network based on the thr...

In this paper we present a key escrow system which meets possible requirements for international key escrow, where diierent domains may not trust each other. In this system multiple third parties, who are trusted collectively but not individually, perform the dual role of providing users with key management services and providing autho-rised agencies in the relevant domains with warranted acces...

Group Key Transfer (GKT) protocols allow multiple parties to share a common secret key: a trusted Key Generation Center (KGC) selects a uniformly random value that has never been used before and securely distributes it to the legitimate principals. The paper restricts to GKT based on secret sharing; it briefly reviews the security goals and the existing formal security models. We motivate our w...

A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require a linear number (with respect to the number of participants) of communication rounds to securely achieve this goal. In this paper we propose a new constant-round group key exchange protocol that provides e ciency and privacy un...

The main purpose of this research project was to investigate the impact of Strategic Human Resource Management practices on knowledge sharing behavior among university faculty members. This research also studied the mediating role of trust and organizational commitment in the relationship between SHRM practices and knowledge sharing behavior. Following the positivist paradigm, this research ado...

The private key of electronic elections is a very critical piece of information that, with an incorrect or improper use, may disrupt the elections results. To enforce the privacy and security of the private key, secret sharing schemes (or threshold schemes) are used to generate a distributed key into several entities. In this fashion, a threshold of at least t out of the n entities will be nece...

Secure E-voting is a challenging protocol.Several approaches based on homomorphic crypto systems, mix-nets blind signatures are proposed in the literature.But most of them need complicated homomorphic encryption which involves complicated encryption decryption process and key management which is not efficient.In this paper we propose a secure and efficient E-voting scheme based on secret sharin...

In this paper, we propose a new pairwise key agreement, TLPKA (Tangent Line Pairwise Key Agreement), for establishing a secure link between members in an ad hoc network. With pairwise keys, data transmitted in ad hoc networks can be protected from the eavesdropping of outsiders. These pairwise keys can also be used to authenticate members in ad hoc networks. In addition, due to the property of ...

The purpose of this paper is to show how probabilistic argumentation is applicable to modern public-key cryptography as an appropriate tool to evaluate webs of trust. This is an interesting application of uncertain reasoning that has not yet received much attention in the corresponding literature.