BRICS Report Series · 2000 · 42 citations · 7 references
ComputingComputer ScienceCryptographySecurity ProtocolsTheory Of ComputationCircuit ComplexityCryptographic ComplexityCryptographic ProtocolsHomomorphic EncryptionSecure Multi-party ComputationThreshold CryptographyBoolean Circuit EvaluationCircuit EvaluationComplexityMpc Protocol DesignSecure Multiparty ComputationThreshold EncryptionThreshold Homomorphic Encryption
We introduce a new approach to multiparty computation (MPC) basing<br />it on homomorphic threshold crypto-systems. We show that given<br />keys for any sufficiently efficient system of this type, general MPC protocols<br />for n players can be devised which are secure against an active<br />adversary that corrupts any minority of the players. The total number of<br />bits sent is O(nk|C|), where k is the security parameter and |C| is the size<br />of a (Boolean) circuit computing the function to be securely evaluated.<br />An earlier proposal by Franklin and Haber with the same complexity was<br />only secure for passive adversaries, while all earlier protocols with active<br />security had complexity at least quadratic in n. We give two examples<br />of threshold cryptosystems that can support our construction and lead<br />to the claimed complexities.
7
Shafi Goldwasser, Silvio Micali · Journal of Computer and System Sciences · 1984 · 2.6K citations
Security and Composition of Multiparty Cryptographic Protocols
Ran Canetti · Journal of Cryptology · 2000 · 1.4K citations · Full text
Proceedings of the twentieth annual ACM symposium on Theory of computing
Janoš Šimon · 1988 · 66 citations