作者: Ivan Damgård , Valerio Pastro , Nigel Smart , Sarah Zakarias
DOI: 10.1007/978-3-642-32009-5_38
关键词: Adversary 、 Ciphertext 、 Message authentication code 、 Finite field 、 Computation 、 Oblivious transfer 、 Cryptosystem 、 Computer science 、 Secure two-party computation 、 Theoretical computer science 、 Multiplication 、 Communication complexity 、 Security parameter 、 Homomorphic encryption
摘要: We propose a general multiparty computation protocol secure against an active adversary corrupting up to $$n-1$$ of the n players. The protocol may be used to compute securely …