Publicly Auditable Secure Multi-Party Computation

作者: Carsten Baum , Ivan Damgård , Claudio Orlandi

DOI: 10.1007/978-3-319-10879-7_11

关键词:

摘要: In the last few years efficiency of secure multi-party computation (MPC) increased in several orders magnitudes. However, this alone might not be enough if we want MPC protocols to used practice. A crucial property that is needed many applications everyone can check a given (secure) was performed correctly – even extreme case where all parties involved are corrupted, and party who wants verify result participating. This especially relevant clients-servers setting, clients provide input by servers. An obvious example electronic voting, but also types auctions one may independent verification result. Traditionally, achieved using non-interactive zero-knowledge proofs during computation.

参考文章(32)
Rosario Gennaro, Craig Gentry, Bryan Parno, Mariana Raykova, Quadratic Span Programs and Succinct NIZKs without PCPs theory and application of cryptographic techniques. pp. 626- 645 ,(2013) , 10.1007/978-3-642-38348-9_37
Ben Adida, Helios: web-based open-audit voting usenix security symposium. pp. 335- 348 ,(2008)
Gilad Asharov, Claudio Orlandi, Calling Out Cheaters: Covert Security with Public Verifiability Advances in Cryptology – ASIACRYPT 2012. pp. 681- 698 ,(2012) , 10.1007/978-3-642-34961-4_41
Jonathan Katz, David Evans, Yan Huang, Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? network and distributed system security symposium. ,(2012)
Ivan Damgård, Sarah Zakarias, Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing Theory of Cryptography. pp. 621- 641 ,(2013) , 10.1007/978-3-642-36594-2_35
Rikke Bendlin, Ivan Damgård, Claudio Orlandi, Sarah Zakarias, Semi-homomorphic encryption and multiparty computation international cryptology conference. pp. 169- 188 ,(2011) , 10.1007/978-3-642-20465-4_11
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
Kazue Sako, An Auction Protocol Which Hides Bids of Losers public key cryptography. pp. 422- 432 ,(2000) , 10.1007/978-3-540-46588-1_28
Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David B. Wilson, Fast exponentiation with precomputation theory and application of cryptographic techniques. pp. 200- 207 ,(1992) , 10.1007/3-540-47555-9_18