Multiparty Computation from Somewhat Homomorphic Encryption

作者: Ivan Damgård , Valerio Pastro , Nigel Smart , Sarah Zakarias

DOI: 10.1007/978-3-642-32009-5_38

关键词: AdversaryCiphertextMessage authentication codeFinite fieldComputationOblivious transferCryptosystemComputer scienceSecure two-party computationTheoretical computer scienceMultiplicationCommunication complexitySecurity parameterHomomorphic 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 …

参考文章(37)
Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra, A New Approach to Practical Active-Secure Two-Party Computation international cryptology conference. ,vol. 2011, pp. 681- 700 ,(2012) , 10.1007/978-3-642-32009-5_40
Vadim Lyubashevsky, Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures international conference on the theory and application of cryptology and information security. pp. 598- 616 ,(2009) , 10.1007/978-3-642-10366-7_35
Severin Winkler, Jürg Wullschleger, On the efficiency of classical and quantum oblivious transfer reductions international cryptology conference. ,vol. 2009, pp. 707- 723 ,(2010) , 10.1007/978-3-642-14623-7_38
Ivan Damgård, Claudio Orlandi, Multiparty computation for dishonest majority: from passive to active security at low cost international cryptology conference. ,vol. 2010, pp. 558- 576 ,(2010) , 10.1007/978-3-642-14623-7_30
Donald Beaver, Efficient Multiparty Protocols Using Circuit Randomization international cryptology conference. pp. 420- 432 ,(1991) , 10.1007/3-540-46766-1_34
Carolyn Whitnall, Elisabeth Oswald, A comprehensive evaluation of mutual information analysis using a fair evaluation framework international cryptology conference. ,vol. 2011, pp. 316- 334 ,(2011) , 10.1007/978-3-642-22792-9_18
Yuval Ishai, Manoj Prabhakaran, Amit Sahai, Founding Cryptography on Oblivious Transfer --- Efficiently international cryptology conference. pp. 572- 591 ,(2008) , 10.1007/978-3-540-85174-5_32
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky, Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority international cryptology conference. ,vol. 2011, pp. 663- 680 ,(2012) , 10.1007/978-3-642-32009-5_39
Craig Gentry, Shai Halevi, Nigel P. Smart, Fully Homomorphic Encryption with Polylog Overhead Advances in Cryptology – EUROCRYPT 2012. pp. 465- 482 ,(2012) , 10.1007/978-3-642-29011-4_28
Sanjeev Arora, Rong Ge, New algorithms for learning in presence of errors international colloquium on automata languages and programming. pp. 403- 415 ,(2011) , 10.1007/978-3-642-22006-7_34