We introduce a simple, practical approach with probabilistic information-theoretic security to solve one of quantum key distribution’s major security weaknesses: the requirement of an authenticated classical channel to prevent man-in-the-middle attacks. Our scheme uses classical secret sharing techniques and partially trusted intermediaries and provides arbitrarily high confidence in the securi...

We introduce a simple, practical approach with probabilistic information-theoretic security to mitigate one of quantum key distribution’s major limitations: the short maximum transmission distance (∼ 200 km) possible with present day technology. Our scheme uses classical secret sharing techniques to allow secure transmission over long distances through a network containing randomly-distributed ...

Group key exchange (GKE) is one of the basic building blocks in securing group communication. A number of solutions to GKE problem have been proposed, but most of them are not scalable and require a number of rounds linear with the number of group members. We present a method of constructing constant-round and identity-based protocol via secret sharing for GKE within universally composability (...

In this paper, we present several general policies for deciding when to share probabilistic beliefs between agents for distributed monitoring. In order to evalaute these policies, we have formulated an application in network intrusion detection as a multi-agent monitoring problem. We have evaluated our policies based on packet trace data from a real network. Based on this evaluation, we have de...

In this work, we focus on two basic secure distributed computation tasksProbabilistic WeakSecret Sharing (PWSS) and Probabilistic Verifiable Secret Sharing (PVSS). PVSS allows a dealerto share a secret among several players in a way that would later allow a unique reconstruction ofthe secret with negligible error probability. PWSS is slightly weaker version of PVSS where thedeal...

Interactions of large societal groups exhibit predominantly a flat structure. It means that each member of the group has its aims, restricted perceiving, modelling, acting and evaluating abilities and interacts with a relatively small number of “neighbors”. This is the fully scalable cooperation model worth of imitating. The paper introduces a formal model of this type with individual members b...

As capacity demands vary among simultaneously executed threads in chip multiprocessors, dynamically managing cache resources according to the run-time demands is effective to improve L2 cache performance. Differed from existing dynamic cache management schemes based on LRU replacement policy, we propose an adaptive capacity sharing mechanism based on a global reuse replacement policy. This mech...

Abstract: The paper concerns a cooperation problem in multiple participant decision making (DM). A fully scalable cooperation model with individual participants being Bayesian decision makers who use fully probabilistic design of the optimal decision strategy is presented. The solution suggests a flat structure of cooperation, where each participant interacts with several ‘neighbours’. The coop...

In this work we focus on two basic secure distributed computation tasksProbabilistic Weak Secret Sharing (PWSS) and Probabilistic Verifiable Secret Sharing (PVSS). PVSS allows a dealer to share a secret among several players in a way that would later allow a unique reconstruction of the secret with negligible error probability. PWSS is slightly weaker version of PVSS where the dealer can choose...

People are increasingly using online social networks for maintaining contact with friends and colleagues irrespective of their physical location. While such services are essential to overcome distances, using infrastructure services for location-based services may not be desirable. In contrast, we design and analyze a fully distributed variant of an ephemeral content sharing service, solely dep...