The Experts below are selected from a list of 93 Experts worldwide ranked by ideXlab platform
J Vayssiere - One of the best experts on this subject based on the ideXlab platform.
-
privacy preserving Logical Vector clocks using secure computation techniques
International Conference on Parallel and Distributed Systems, 2007Co-Authors: F Kerschbaum, J VayssiereAbstract:Systems of Logical clocks are commonly found in distributed systems for establishing causality between events occurring in concurrent communicating processes. Vector clocks are a popular type of Logical clocks which require processes to attach to each message a Logical timestamp that contains information about the sender process's view of the state of the distributed computation at the time of message sending. Causality between two events can then be determined by comparing their two Logical timestamps. However, by doing so, processes leak potentially sensitive information about the advancement of their computation and the computations performed by the processes they communicate with. The contribution presented in this paper is a protocol, based on secure computation techniques, which preserves the privacy of each process's local Logical clock while being strictly equivalent to regular Vector clocks.
-
ICPADS - Privacy-preserving Logical Vector clocks using secure computation techniques
2007 International Conference on Parallel and Distributed Systems, 2007Co-Authors: F Kerschbaum, J VayssiereAbstract:Systems of Logical clocks are commonly found in distributed systems for establishing causality between events occurring in concurrent communicating processes. Vector clocks are a popular type of Logical clocks which require processes to attach to each message a Logical timestamp that contains information about the sender process's view of the state of the distributed computation at the time of message sending. Causality between two events can then be determined by comparing their two Logical timestamps. However, by doing so, processes leak potentially sensitive information about the advancement of their computation and the computations performed by the processes they communicate with. The contribution presented in this paper is a protocol, based on secure computation techniques, which preserves the privacy of each process's local Logical clock while being strictly equivalent to regular Vector clocks.
F Kerschbaum - One of the best experts on this subject based on the ideXlab platform.
-
privacy preserving Logical Vector clocks using secure computation techniques
International Conference on Parallel and Distributed Systems, 2007Co-Authors: F Kerschbaum, J VayssiereAbstract:Systems of Logical clocks are commonly found in distributed systems for establishing causality between events occurring in concurrent communicating processes. Vector clocks are a popular type of Logical clocks which require processes to attach to each message a Logical timestamp that contains information about the sender process's view of the state of the distributed computation at the time of message sending. Causality between two events can then be determined by comparing their two Logical timestamps. However, by doing so, processes leak potentially sensitive information about the advancement of their computation and the computations performed by the processes they communicate with. The contribution presented in this paper is a protocol, based on secure computation techniques, which preserves the privacy of each process's local Logical clock while being strictly equivalent to regular Vector clocks.
-
ICPADS - Privacy-preserving Logical Vector clocks using secure computation techniques
2007 International Conference on Parallel and Distributed Systems, 2007Co-Authors: F Kerschbaum, J VayssiereAbstract:Systems of Logical clocks are commonly found in distributed systems for establishing causality between events occurring in concurrent communicating processes. Vector clocks are a popular type of Logical clocks which require processes to attach to each message a Logical timestamp that contains information about the sender process's view of the state of the distributed computation at the time of message sending. Causality between two events can then be determined by comparing their two Logical timestamps. However, by doing so, processes leak potentially sensitive information about the advancement of their computation and the computations performed by the processes they communicate with. The contribution presented in this paper is a protocol, based on secure computation techniques, which preserves the privacy of each process's local Logical clock while being strictly equivalent to regular Vector clocks.
Jinde Cao - One of the best experts on this subject based on the ideXlab platform.
-
Finding graph minimum stable set and core via semi-tensor product approach
Neurocomputing, 2016Co-Authors: Jie Zhong, Chi Huang, Jinde CaoAbstract:By resorting to a new matrix product, called semi-tensor product of matrices, this paper investigates the minimum stable set and core of graph, and also presents a number of results and algorithms. By defining a characteristic Logical Vector and using matrix expressions of Logical functions, a new algebraic representation is derived for the externally stable set. Then, based on the algebraic representation, an algorithm is established to find all the externally stable sets. According to this algorithm, a new necessary and sufficient condition is obtained to determine whether a given vertex subset is an absolutely minimum externally stable set or not. Meanwhile, a new algorithm is also obtained to find all the absolutely minimum externally stable sets. Finally, the graph core, which is simultaneously externally stable set and internally stable set, is investigated. Here the internally stable set requires that internal nodes of this set are all disconnected with each other. Using semi-tensor product, some necessary and sufficient conditions are presented, and then an algorithm is established to find all the graph cores. The study of illustrative examples shows that the results/algorithms presented in this paper are effective. HighlightsUse STP to study the minimum stable set and core of graph.An algorithm is established to find all the externally stable sets.Necessary and sufficient condition for absolutely minimum externally stable set.An algorithm is established to find all the graph cores via semi-tensor product.Examples illustrate the results/algorithms very well.
Jie Zhong - One of the best experts on this subject based on the ideXlab platform.
-
Finding graph minimum stable set and core via semi-tensor product approach
Neurocomputing, 2016Co-Authors: Jie Zhong, Chi Huang, Jinde CaoAbstract:By resorting to a new matrix product, called semi-tensor product of matrices, this paper investigates the minimum stable set and core of graph, and also presents a number of results and algorithms. By defining a characteristic Logical Vector and using matrix expressions of Logical functions, a new algebraic representation is derived for the externally stable set. Then, based on the algebraic representation, an algorithm is established to find all the externally stable sets. According to this algorithm, a new necessary and sufficient condition is obtained to determine whether a given vertex subset is an absolutely minimum externally stable set or not. Meanwhile, a new algorithm is also obtained to find all the absolutely minimum externally stable sets. Finally, the graph core, which is simultaneously externally stable set and internally stable set, is investigated. Here the internally stable set requires that internal nodes of this set are all disconnected with each other. Using semi-tensor product, some necessary and sufficient conditions are presented, and then an algorithm is established to find all the graph cores. The study of illustrative examples shows that the results/algorithms presented in this paper are effective. HighlightsUse STP to study the minimum stable set and core of graph.An algorithm is established to find all the externally stable sets.Necessary and sufficient condition for absolutely minimum externally stable set.An algorithm is established to find all the graph cores via semi-tensor product.Examples illustrate the results/algorithms very well.
Zhenbin Liu - One of the best experts on this subject based on the ideXlab platform.
-
A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
Automatica, 2012Co-Authors: Yuzhen Wang, Chenghui Zhang, Zhenbin LiuAbstract:Using the semi-tensor product of matrices, this paper investigates the maximum (weight) stable set and vertex coloring problems of graphs with application to the group consensus of multi-agent systems, and presents a number of new results and algorithms. Firstly, by defining a characteristic Logical Vector and using the matrix expression of Logical functions, an algebraic description is obtained for the internally stable set problem, based on which a new algorithm to find all the internally stable sets is established for any graph. Secondly, the maximum (weight) stable set problem is considered, and a necessary and sufficient condition is presented, by which an algorithm to find all the maximum (weight) stable sets is obtained. Thirdly, the vertex coloring problem is studied by using the semi-tensor product method, and two necessary and sufficient conditions are proposed for the colorability, based on which a new algorithm to find all the k-coloring schemes and minimum coloring partitions is put forward. Finally, the obtained results are applied to multi-agent systems, and a new protocol design procedure is presented for the group consensus problem. The study of illustrative examples shows that the results/algorithms presented in this paper are very effective.
