Name
Abstract | ||
|---|---|---|
A network court protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebraic operators. It is shown that the malicious node conviction is equivalent to the uniqueness of the solution of a system of Boolean equations and that is equivalent to the uniqueness of a corresponding satisfiability problem. A linear time algorithm is presented for the conviction process using a graph search. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ICNP.2007.4375869 | ICNP |
Keywords | Field | DocType |
linear time algorithm,boolean algebra,network node,graph search,boolean equation,network court protocol,transport protocols,algebraic operator,telecommunication security,satisfiability problem,malicious node conviction,security of data,satisfiability | Uniqueness,Computer science,Network security,Boolean satisfiability problem,Node (networking),Computer network,Theoretical computer science,Boolean algebra,Time complexity,Conviction,Distributed computing,Communications protocol | Conference |
ISBN | Citations | PageRank |
978-1-4244-1588-5 | 0 | 0.34 |
References | Authors | |
0 | 2 | |