Complete Primitives for Information-Theoretically Secure Two-Party Computation

Daniel Kraschewski
2013
This thesis contributes two results to the research area of secure two-party computation. The first result is a full combinatorial characterization of all cryptogates that are powerful enough to be used for implementation of arbitrary secure computations. The second result shows that any secure two-party computation can be based on a single reusable tamper-proof hardware token, although the receiver does not trust the token issuer.
doi:10.5445/ir/1000035100 fatcat:hj4iuzv27bbxjmbvjvhvzv4g5y