ویراساینس.
سند علمی

Secure Combinatorial Optimization Simulating DFS Tree-Based Variable Elimination

Marius-Calin Silaghi, Boi Faltings, Adrian Petcu

چکیده

In general, Constraint Optimization Problems (COP) are NP-hard. Using variable elimination techniques [5, 13] COPs can be solved with computation that is exponential only in the induced-width of the constraint graph (given some order on the nodes), i.e. smaller than n. Orders on nodes allowing for some parallelism are offered by Depth First Search (DFS) trees of the constraint graph [3, 13]. Any arithmetic circuit can be compiled into a general secure multi-party computation where no participant learns anything except for the result [1, 8]. We show in [25] that a secure combinatorial problem solver must necessarily pick the result randomly among optimal solutions, to be really secure. We recently developed SMC [19], the first programming language that translates [1]’s theory into practice. SMC also supports constraint satisfaction problems (CSPs), but additional techniques were revealed needed to offer acceptably efficient support for COPs. In [24] we proposed arithmetic circuits for solving COPs but which are exponential in the number of variables, n, for any constraint graph. Here we show how to construct an arithmetic circuit with the complexity properties of DFS-based variable elimination, and that finds a random optimal solution for any COP. For forest constraint graphs, this leads to a linear cost secure solver. Developing an arithmetic circuit performing the operations of the dynamic programming step in variable elimiSignificant input was received from Benjamin Pflanz. nation proves to be quite straightforward and similar to previous work. We encountered a more interesting scientific challenge in choosing a secure scheme for the equivalent of the decoding step. The decoding step consists of traversing the dynamic programming data structures backward to detect the assignments that generate the winning alternative. What seems to be the straightforward arithmetic circuit translation reveals results before the end of the computation, compromising security. We show how to develop an arithmetic circuit comprising all processing until the end of the computation.

اسناد مشابه

  • Cs 598csc: Combinatorial Optimization Gomory-hu Trees

    سند علمی۲۰۱۰David Morrison

    (The work in this section closely follows [3]) Let G = (V,E) be an undirected graph with non-negative edge capacities defined by c : E → R. We would like to be able to compute the global minimum cut on the graph (i.e., the minimum over all min-cuts between pairs of vertices s and

  • Cs 598csc: Combinatorial Optimization 1 Spanning Trees

    سند علمی۲۰۱۰Jing Gao

    Let G = (V,E) be an undirected graph and let c : E → R be an edge-cost function. Efficient polynomial time algorithms for computing a minimum cost spanning tree (MST) are standard. Spanning trees in G are bases in the associated graphic matroid and Kruskal’s algorithm for MST is

  • Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space

    سند علمی۱۹۹۷Shumeet Baluja, Scott Davies

    Many combinatorial optimization algorithms have no mechanism to capture inter-parameter dependencies. However, modeling such dependencies may allow an algorithm to concentrate its sampling more effectively on regions of the search space which have appeared promising in the past.

  • Branch-and-cut for combinatorial optimization problems without auxiliary binary variables

    سند علمی۲۰۰۱Knowledge Eng. ReviewIsmael R. de Farias, Ellis L. Johnson, George L. Nemhauser

    Many optimization problems involve combinatorial constraints on continuous variables. An example of a combinatorial constraint is that at most one variable in a group of nonnegative variables may be positive. Traditionally, in the mathematical programming community, such problems

  • Combinatorial optimization with one quadratic term: Spanning trees and forests

    سند علمی۲۰۱۴Discrete Applied MathematicsChristoph Buchheim, Laura Klein

    The standard linearization of a binary quadratic program yields an equivalent reformulation as an integer linear program, but the resulting LP-bounds are very weak in general. We concentrate on applications where the underlying linear problem is tractable and exploit the fact tha

  • The Million-Variable "March" for Stochastic Combinatorial Optimization

    سند علمی۲۰۰۵J. Global OptimizationLewis Ntaimo, Suvrajeet Sen

    Combinatorial optimization problems have applications in a variety of sciences and engineering. In the presence of data uncertainty, these problems lead to stochastic combinatorial optimization problems which result in very large scale combinatorial optimization problems. In this