The fast increase of mobile Internet use motivates the need for WiFi sharing solutions, where a mobile user connects to the Internet via a nearby foreign network while its home network is far away. This situation creates security challenges which are only partially solved by existing solutions like VPNs. Such solutions neglect the security of the visited network, and private users or organizati...

The transfer of information is a demanding issue, particularly due to the presence large number eavesdroppers on communication channels. Sharing medical service records between different clinical jobs basic and testing research topic. particular characteristics blockchains have attracted amount attention resulted in revolutionary changes various business applications, including care. A blockcha...

Considering the case of players’ deceptions, traditional secret sharing scheme can not resolve the security issues. To address these security issues, the paper proposes a rational secret sharing scheme against cheating based on game theory. Under the conditions of the rational, applying the idea of threshold, the scheme is composed of key generation, share encryption, verification and secret re...

Combinatorial auctions are employed into many applications such as spectrum auctions held by the Federal Communications Commission (FCC). A crucial problem in such auctions is the lack of secure and efficiency mechanism to protect the privacy of the bidding prices and to ensure data security. To solve the problem, we propose an approach to represent the price as a polynomial’s degree based on v...

We study the problem of using a multicast network code to transmit information securely in the presence of a “wire-tap” adversary who can eavesdrop on a bounded number of network edges. We establish a close connection between secure linear network coding and a new variant of the secret sharing problem, which we call filtered secret sharing. Using this connection, we establish new trade-offs bet...

We present a new robust proactive (and threshold) RSA signature scheme secure with the optimal threshold of t < n/2 corruptions. The new scheme offers a simpler alternative to the best previously known (static) proactive RSA scheme given by Tal Rabin [36], itself a simplification over the previous schemes given by Frankel et al. [18, 17]. The new scheme is conceptually simple because all the sh...