Verifiable secret sharing schemes proposed so far can only allow participants to verify whether their shares are correct or not. In this paper, we propose a new protocol which can allow participants not only to verify the correctness of their shares but also to revise the faulty shares. It is achieved in a cooperative way by participants, but without any assistance from the dealer. This protoco...

We argue that the core problem facing peer-to-peer systems is locating documents in a decentralized network and propose Chord, a distributed lookup primitive. Chord provides an efficient method of locating documents while placing few constraints on the applications that use it. As proof that Chord’s functionality is useful in the development of peer-to-peer applications, we outline the implemen...

The constrained resources of sensors restrict the design of a key management scheme for wireless sensor networks (WSNs). In this work, we first formalize the security model of ALwEN, which is a gossipbased wireless medical sensor network (WMSN) for ambient assisted living. Our security model considers the node capture, the gossip-based network and the revocation problems, which should be valuab...

Sharing is a particularly versatile and widespread human practice that features in all domains of life, including religion politics, family economics. It has long ethnographic record but it only recently reached centre stage social theory public awareness. However, not everything called ‘sharing’ qualifies as such comparative more technical sense. This entry seeks to distinguish sharing from ot...

‎The paper concerns interesting problems related to the field of Complex Analysis‎, ‎in particular, Nevanlinna theory of meromorphic‎ ‎functions‎. ‎We have studied certain uniqueness problem on differential polynomials of meromorphic functions sharing a‎ ‎small function‎. ‎Outside‎, ‎in this paper‎, ‎we also consider the uniqueness of $q-$ shift difference‎ - ‎differential polynomials‎ ‎of mero...

This work has two objectives. The first is to study rigorously the transient behavior of some P2P networks where information is replicated and disseminated according to an epidemic type dynamics. The second is to use the insight gained in order to predict how efficient are the measures taken against peer to peer networks. Two abstract models are considered to describe the P2P file sharing based...

Electronic intermediaries have become pervasive in sales transactions for many durables, such as cars, power tools, and apartments. Yet only recently have they successfully tackled the challenge of enabling parties to share such goods. A key impediment to sharing is a lender’s concern about damage due to unobservable actions by a renter, usually resulting in moral hazard. This paper shows how a...

A secret sharing scheme permits a secret to be shared among participants in such a way that only qualiied subsets of participants can recover the secret, but any non-qualiied subset has absolutely no information on the secret. In this paper we consider the problem of designing eecient secret sharing schemes having the additional feature that qualiied minorities can forbid any other set of parti...

File sharing networks are among the most popular applications of Peer-to-Peer (P2P) technology to date [3] and have been widely studied in terms of the performance, behavior, topology and other properties. A persistent theme throughout this research has been the evidence that many P2P file sharing systems rely on the presence of altruistic users, who provide files, network capacity or some othe...

We consider perfect verifiable secret sharing (VSS) in a synchronous network of n processors (players) where a designated player called the dealer wishes to distribute a secret s among the players in a way that no t of them obtain any information, but any t + 1 players obtain full information about the secret. The round complexity of a VSS protocol is defined as the number of rounds performed i...