Many Internet applications are used to access resources, such as pieces of information or server processes that are available in several equivalent replicas on different hosts. This includes, but is not limited to, peer-to-peer file sharing applications. The goal of Application-Layer Traffic Optimization (ALTO) is to provide guidance to applications that have to select one or several hosts from...

Proactive Secret Sharing (PSS) scheme is a method to periodically renew n secret shares in a (k, n) threshold-based Secret Sharing Scheme (SSS) without modifying the secret, or reconstructing the secret to reproduce new shares. Traditionally, PSS schemes are developed for the Shamir’s SSS which is a single SSS. Bai (2006) developed a multiple-secret sharing scheme using matrix projection. This ...

We have implemented a small-scale peer-to-peer based environment called Comtella, which allows faculty, graduate and undergraduate students to contribute and share URLs of class-related resources, like academic and popular articles. The system has been deployed for three months in a university course on ethics and information technology with thirty five undergraduate students. We deployed two m...

We prove that for every n and 1 < t < n any t-out-of-n threshold secret sharing scheme for one-bit secrets requires share size log(t + 1). Our bound is tight when t = n− 1 and n is a prime power. In 1990 Kilian and Nisan proved the incomparable bound log(n − t + 2). Taken together, the two bounds imply that the share size of Shamir’s secret sharing scheme (Comm. ACM ’79) is optimal up to an add...

We present a model of bandwidth allocation in a stylized peer-to-peer file sharing network. Given an arbitrary population of peers composed of sharers and freeriders, where all peers interconnect to maximize their allocated bandwidth, we derive the expected bandwidth obtained by sharers and freeriders. We show that sharers are always better off than freeriders and that the difference decreases ...

In a ) , ( n t secret sharing scheme (SS), a dealer divides a secret into n shares in such a way that (a) the secret can be recovered successfully with t or more than t shares, and (b) the secret cannot be recovered with fewer than t shares. In a weighted secret sharing scheme (WSS), each share of a shareholder has a positive weight. The secret can be recovered if the overall weight of shares i...

D distribution channels raise many new challenges for managers in the media industry. This is particularly true for movie studios where high-value content can be stolen and released through illegitimate digital channels, even prior to the release of the movie in legal channels. In response to this potential threat, movie studios have spent millions of dollars to protect their content from unaut...

The purpose of this study is to explore the design equity cooperation mechanism in sharing logistics service supply chain. This designs a two-echelon chain composed an urban joint distribution company and N companies. jointly established by companies based on specific shares investment. We establish models under revenue-sharing or cost-sharing contracts. Revenue-sharing factor parameter. When m...

in this paper, we show that for any finite order entire function $f(z)$, the function of the form $f(z)^{n}[f(z+c)-f(z)]^{s}$ has no nonzero finite picard exceptional value for all nonnegative integers $n, s$ satisfying $ngeq 3$, which can be viewed as a different result on hayman conjecture. we also obtain some uniqueness theorems for difference polynomials of entire functions sharing one comm...