Secure Multi-party Computation based on m-out-n OT

Abstract Secure multi-party computation protocol can be realized in many ways, which based on OT construct is a useful realization. We use all but many lossy trapdoor function to design noninteractive chosen m out of n OT. Then, we design multi-party computation protocl based on the new OT. Any two participators of the participants need not execute one out of four OT. We introduce the trust (semi-honest) authority (cloud server), then design noninteractive chosen n − i out of 4(n − i) OT between participants to realize multi-party computation protocl.

[1]  David Chaum,et al.  Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.

[2]  Gilles Brassard,et al.  Information theoretic reductions among disclosure problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[3]  Claude Crépeau,et al.  Equivalence Between Two Flavours of Oblivious Transfers , 1987, CRYPTO.

[4]  Leonid A. Levin,et al.  Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.

[5]  Rafail Ostrovsky,et al.  How to withstand mobile virus attacks (extended abstract) , 1991, PODC '91.

[6]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[7]  W. Marsden.  I and J , 2012 .

[8]  Shafi Goldwasser,et al.  Advances in Cryptology — CRYPTO’ 88: Proceedings , 1990, Lecture Notes in Computer Science.

[9]  Michael O. Rabin,et al.  How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..

[10]  Nathan Linial,et al.  Fault-tolerant computation in the full information model , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[11]  Yi Mu,et al.  m out of n Oblivious Transfer , 2002, ACISP.

[12]  Rafail Ostrovsky,et al.  How To Withstand Mobile Virus Attacks , 1991, PODC 1991.

[13]  Yuval Ishai,et al.  Priced Oblivious Transfer: How to Sell Digital Goods , 2001, EUROCRYPT.

[14]  Silvio Micali,et al.  Non-Interactive Oblivious Transfer and Applications , 1989, CRYPTO.

[15]  Gilles Brassard,et al.  All-or-Nothing Disclosure of Secrets , 1986, CRYPTO.

[16]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[17]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[18]  Dennis Hofheinz,et al.  All-But-Many Lossy Trapdoor Functions , 2012, EUROCRYPT.

[19]  Liu Mu-lan.  Secret Sharing Schemes and Secure Multi-party Computation , 2006 .

[20]  Alfredo De Santis,et al.  Public-Randomness in Public Key Cryptography , 1990, EUROCRYPT.

[21]  Joe Kilian.  Secure Computation , 2011, Encyclopedia of Cryptography and Security.

[22]  Donald Beaver,et al.  Foundations of Secure Interactive Computing , 1991, CRYPTO.

[23]  Brent Waters,et al.  Lossy trapdoor functions and their applications , 2008, SIAM J. Comput..

[24]  Bert den Boer.  Oblivous Transfer Protecting Secrecy , 1991, EUROCRYPT.

[25]  Joe Kilian,et al.  Weakening Security Assumptions and Oblivious Transfer (Abstract) , 1988, CRYPTO.