How to Implement a Random Bisection Cut
نویسندگان
چکیده
By using a deck of cards, it is possible to realize a secure computation. In particular, since a new shuffling operation, called a random bisection cut, was devised in 2009, many efficient protocols have been designed. The shuffle functions in the following manner. A sequence of cards is bisected, and the two halves are swapped randomly. This results in two possible cases, depending on whether the two halves of the card sequence are swapped or not. Because there are only two possibilities when a random bisection cut is performed, it has been suggested that information regarding the result of the shuffle could sometimes be leaked visually. Thus, in this paper we propose some methods for implementing a random bisection cut without leaking such information.
منابع مشابه
Conjecture on the maximum cut and bisection width in random regular graphs
Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of edges in the graph minus the minimum bisection size. Maximum cut and minimal bisection are two famous NP-complete problems with no known general relation between...
متن کاملA conjecture on the maximum cut and bisection width in random regular graphs
The asymptotic properties of random regular graphs are objects of extensive study in mathematics and physics. In this paper we argue, using the theory of spin glasses in physics, that in random regular graphs the maximum cut size asymptotically equals the number of edges in the graph minus the minimum bisection size. Maximum cut and minimal bisection are two famous NP-complete problems with no ...
متن کاملCut Size Statistics of Graph Bisection Heuristics
We investigate the statistical properties of cut sizes generated by heuristic algorithms which solve the graph bisection problem approximately. On an ensemble of sparse random graphs, we find empirically that the distribution of the cut sizes found by “local” algorithms becomes peaked as the number of vertices in the graphs becomes large. Evidence is given that this distribution tends toward a ...
متن کاملThe Bisection of Random Graphs: Rigorous Bounds Using the Analysis of Algorithms
Given a random graph G = G n;1=2 , we give almost sure bounds for the value of the minimum bisection of G. The lower bound is obtained by applying the rst moment method, while the upper bound is given by the analysis of a simple algorithm. Moreover, these results enable us to derive upper bounds for the maximum bisection and the maxcut of G.
متن کاملExtremal Cuts of Sparse Random Graphs
For Erdős-Rényi random graphs with average degree γ, and uniformly random γ-regular graph on n vertices, we prove that with high probability the size of both the Max-Cut and maximum bisection are n( γ 4 + P∗ √ γ 4 + o( √ γ)) + o(n) while the size of the minimum bisection is n( γ 4 − P∗ √ γ 4 + o( √ γ)) + o(n). Our derivation relates the free energy of the anti-ferromagnetic Ising model on such ...
متن کامل