- Authors:
- Valtteri Niemi,
- Ari Renvall
Many simple calculations can be done easier without computers than by using them. We show that the same holds for secure multiparty computations if the function to be computed is simple enough. Our starting point is an observation of Bert den Boer: a multiparty computation of a logical AND-gate can be performed by five simple playing cards. We show that by using a reasonable amount of cards many useful functions can be computed in such way that each input stays private.
Recommendations
1/p-Secure multiparty computation without honest majority and the best of both worlds
CRYPTO'11: Proceedings of the 31st annual conference on Advances in cryptologyA protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation, where parties give their inputs to a trusted party which returns the output of the functionality to all parties. In ...
-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds
AbstractA protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation, where parties give their inputs to a trusted party that returns the output of the functionality to all ...
Characterization of Secure Multiparty Computation Without Broadcast
TCC 2016-A: Proceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 9562A major challenge in the study of cryptography is characterizing the necessary and sufficient assumptions required to carry out a given cryptographic task. The focus of this work is the necessity of a broadcast channel for securely computing symmetric ...