On the Algorithms Related to Threshold Cryptography Based Network Protocols
Qi Duan, Mohit Virendra · 2013
In this paper we analyzed the algorithms related to threshold cryptography based protocols in networks security. We showed the hardness of threshold minimum cut problem, revealed its relationship with two other problems. Two approximation algorithms for threshold minimum cut were presented. We also show the hardness of determining the probability of threshold access to service nodes in a node-based stochastic graph, and propose a heuristic algorithm for the optimal service node assigning problem. To the best of our knowledge, this is the first work to address these algorithmic problems for threshold cryptography based protocols in network security and reliability.