Skip to main content
SpringerLink
Log in

A brief survey on secure multi-party computing in the presence of rational parties

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

Intelligent agents (IA) are autonomous entities which observe through sensors and act upon an environment using actuators to adjust their activities towards achieving certain goals. The architectures of agents have enormous potentials when they are applied into critical systems, where agents choose actions between working with their own and cooperating with others. Rational utility-based agents choose actions to maximize their expected utilities. Rational secure multi-party computing (RSMPC) means secure multi-party computing (SMPC) in the presence of rational utility-based agents. Here, we call them rational parties. In this paper certain goals of rational parties are maximizing their utilities. The introduction of rational parties considers the incentives in executing protocols. The security definitions under rational framework can better demonstrate the executing environment of real protocols. Furthermore, rational two-party computing removes some impossibility in traditional two-party computing, such as fairness. This paper represents the research status of RSMPC and some typical protocols. The advantages and disadvantages of previous rational SMPC protocols are discussed here. As an emerging field, there are still lots of open problems in RSMPC, such as communication channels, utility assumptions and equilibrium notions etc.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Abraham, Dolev D, Gonen R, Halpern J (2006) Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: Proceedings of the 25th annual ACM symposium on principles of distributed computing, pp 53–62. ACM

  • Achim OM, Oracle TSBU, Bucharest R, Pop F, Cristea V (2011) Reputation based selection for services in cloud environments. In: NBiS 2011, pp 268–273. IEEE

  • Aiyer AS, Alvisi L, Clement A, Dahlin M, Martin JP, Porth C (2005) Bar fault tolerance for cooperative services. In: ACM SIGOPS operating systems review, vol 39, pp 45–58. ACM

  • Alfredo V, Ahmed ZF (2011) Cooperative fuzzy controllers for autonomous voltage regulation in smart grids. J Ambient Intell Hum Comput 2(1):1–10

    Article  Google Scholar 

  • Alwen J, Shelat A, Visconti I (2008) Collusion-free protocols in the mediated model. In: Advances in cryptology-CRYPTO 2008, pp 497–514. Springer

  • Alwen J, Katz J, Lindell Y, Persiano G, Shelat A, Visconti I (2009) Collusion-free multiparty computation in the mediated model. In: Advances in cryptology-CRYPTO 2009, pp 524–540. Springer

  • Alwen J, Katz J, Maurer U, Zikas V (2012) Collusion-preserving computation. In: Advances in cryptology-CRYPTO 2012, pp 124–143. Springer

  • Amato A, Beniamino DM, Venticinque S (2014) Agents based multi-criteria decision-aid. J Ambient Intell Hum Comput 5(5):747–758

    Article  Google Scholar 

  • Andreu J, Angelov P (2013) An evolving machine learning method for human activity recognition systems. J Ambient Intell Hum Comput 4(2):195–206

    Article  Google Scholar 

  • Asharov G, Lindell Y (2011) Utility dependence in correct and fair rational secret sharing. J Cryptol 24(1):157–202

    Article  MATH  MathSciNet  Google Scholar 

  • Asharov G, Canetti R, Hazay C (2011) Towards a game theoretic view of secure computation. In: Advances in cryptology-EUROCRYPT 2011, pp 426–445. Springer

  • Aumann Y, Lindell Y (2007) Security against covert adversaries: efficient protocols for realistic adversaries. In: Theory of cryptography, pp 137–156. Springer

  • Bei X, Chen W, Zhang J (2012) Distributed consensus resilient to both crash failures and strategic manipulations. arXiv preprint arXiv:1203.4324

  • Beimel A, Lindell Y, Omri E, Orlov I (2011) 1/p-secure multiparty computation without honest majority and the best of both worlds. In: Advances in cryptology-CRYPTO 2011, pp 277–296. Springer

  • Cai Y, Peng X (2012) Rational secret sharing protocol with fairness. Chin J Electron 21(1):149–152

    Google Scholar 

  • Canetti R (2000) Security and composition of multiparty cryptographic protocols. J Cryptol 13(1):143–202

    Article  MATH  MathSciNet  Google Scholar 

  • Castiglione A, Pizzolante R, De Santis A, Carpentieri B, Castiglione A, Palmieri F (2015) Cloud-based adaptive compression and secure management services for 3d healthcare data. Future Gener Comput Syst 43:120–134

    Article  Google Scholar 

  • Chen X, Wu Q, Zhang F, Tian H, Wei B, Lee B, Lee H, Kim K (2011) New receipt-free voting scheme using double-trapdoor commitment. Inform Sci 181(8):1493–1502

    Article  MATH  MathSciNet  Google Scholar 

  • Chen X, Li J, Ma J, Tang Q, Lou W (2012a) New algorithms for secure outsourcing of modular exponentiations. In: Computer security-ESORICS 2012, pp 541–556. Springer

  • Chen X, Li J, Susilo W (2012b) Efficient fair conditional payments for outsourcing computations. IEEE Trans Inform Forensics Secur 7(6):1687–1694

    Article  Google Scholar 

  • Clement A, Li H, Napper J, Martin JP, Alvisi L, Dahlin M (2008) Bar primer. In: Dependable systems and networks with FTCS and DCC, 2008. DSN 2008. IEEE International Conference on, pp 287–296. IEEE

  • Cleve R (1986) Limits on the security of coin flips when half the processors are faulty. In: Proceedings of the eighteenth annual ACM symposium on theory of computing, pp 364–369. ACM

  • Dodis Y, Halevi S, Rabin T (2000) A cryptographic solution to a game theoretic problem. In: Advances in cryptology\(^\circ TM\) Crypto 2000, pp 112–130. Springer

  • Esposito C, Ficco M, Palmieri F, Castiglione A (2015) Smart cloud storage service selection based on fuzzy logic, theory of evidence and game theory. IEEE Trans Comput 99:1–14

    Article  Google Scholar 

  • Faiyaz D, Rahat I, Raouf NG (2014) A fuzzy ambient intelligent agents approach for monitoring disease progression of dementia patients. J Ambient Intell Hum Comput 5(1):147–158

    Article  Google Scholar 

  • Ficco M, Tasquier L, Aversa R (2014) Agent-based intrusion detection for federated clouds. In: INCoS 2014, pp 586–591. IEEE

  • Fuchsbauer G, Katz J, Naccache D (2010) Efficient rational secret sharing in standard communication networks. In: Theory of cryptography, pp 419–436. Springer

  • Garay J, Katz J, Maurer U, Tackmann B, Zikas V (2013) Rational protocol design: cryptography against incentive-driven adversaries. In: 2013 IEEE 54th annual symposium on foundations of computer science (FOCS), pp 648–657. IEEE

  • García Ó, Tapia DI, Alonso RS, Rodríguez S, Corchado JM (2012) Ambient intelligence and collaborative e-learning: a new definition model. J Ambient Intell Hum Comput 3(3):239–247

    Article  Google Scholar 

  • Gilboa I, Zemel E (1989) Nash and correlated equilibria: some complexity considerations. Games Econ Behav 1(1):80–93

    Article  MATH  MathSciNet  Google Scholar 

  • Goldreich O, Micali S, Wigderson A (1987) How to play any mental game-a completeness therem for protocols with honest majority. In Proc. 19th ACM symposium on the theory of computing, pp 218–229

  • Gordon SD, Katz J (2006) Rational secret sharing, revisited. In: Security and cryptography for networks, pp 229–241. Springer

  • Gordon SD, Katz J (2012) Partial fairness in secure two-party computation. J cryptol 25(1):14–40

    Article  MATH  MathSciNet  Google Scholar 

  • Gordon SD, Hazay C, Katz J, Lindell Y (2011) Complete fairness in secure two-party computation. J ACM (JACM) 58(6):24

    Article  MathSciNet  Google Scholar 

  • Gradwohl R, Livne N, Rosen A (2013) Sequential rationality in cryptographic protocols. ACM Trans Econ Comput 1(1):2

    Article  Google Scholar 

  • Groce A, Katz J (2012) Fair computation with rational players. In: Advances in cryptology-EUROCRYPT 2012, pp 81–98. Springer

  • Groce A, Katz J, Thiruvengadam A, Zikas V (2012) Byzantine agreement with a rational adversary. In: Automata, languages, and programming, pp 561–572. Springer

  • Halpern J, Pass R (2008) Game theory with costly computation. arXiv preprint arXiv:0809.0024

  • Halpern J, Teague V (2004) Rational secret sharing and multiparty computation: extended abstract. In: STOC 2004: proceedings of the 36th annum ACM symposium on theory of computing, New York, USA: ACM, pp 623–632

  • Huang L, Su C (2006) Facial expression synthesis using manifold learning and belief propagation. Soft Comput 10(12):1193–1200

    Article  MATH  Google Scholar 

  • Isshiki T, Koichiro W, Tanaka K (2010) A rational secret-sharing scheme based on rsa-oaep. IIEICE Trans Fundam Electron Commun Comput Sci 93(1):42–49

    Article  Google Scholar 

  • Izmalkov S, Micali S, Lepinski M (2005) Rational secure computation and ideal mechanism design. In: Foundations of computer science, 2005. FOCS 2005. 46th Annual IEEE symposium on, pp 585–594. IEEE

  • Izmalkov S, Lepinski M, Micali S (2008) Verifiably secure devices. In: Theory of cryptography, pp 273–301. Springer

  • Katz J (2008) Bridging game theory and cryptography: recent results and future directions. In: Theory of cryptography, pp 251–272. Springer

  • Katz J, Maurer U, Tackmann B, Zikas V (2013) Universally composable synchronous computation. In: Theory of cryptography, pp 477–498. Springer

  • Kol G, Naor M (2008a) Cryptography and game theory: designing protocols for exchanging information. In: Theory of cryptography, pp 320–339. Springer

  • Kol G, Naor M (2008b) Games for exchanging information. In: Proceedings of the fortieth annual ACM symposium on theory of computing, pp 423–432. ACM

  • Lamport L, Shostak R, Pease M (1982) The Byzantine generals problem. ACM Trans Program Lang Syst (TOPLAS) 4(3):382–401

    Article  MATH  Google Scholar 

  • Lepinski M, Micali S, Peikert C, Shelat A (2004) Completely fair sfe and coalition-safe cheap talk. In: Proceedings of the twenty-third annual ACM symposium on principles of distributed computing, pp 1–10. ACM

  • Lepinksi M, Micali S, Shelat A (2005) Collusion-free protocols. In: Proceedings of the thirty-seventh annual ACM symposium on theory of computing, pp 543–552. ACM

  • Li HC, Clement A, Wong EL, Napper J, Roy I, Alvisi L, Dahlin M (2006) Bar gossip. In: Proceedings of the 7th symposium on operating systems design and implementation, pp 191–204. USENIX Association

  • Li J, Huang X, Li J, Chen X, Xiang Y (2014) Securely outsourcing attribute-based encryption with checkability. IEEE Trans Parallel Distrib Syst 25(8):2201–2210

    Article  Google Scholar 

  • Luo Z, Cai Y, Yang Y (2012) Rational multi-secret sharing scheme based on bit commitment protocol. J Netw 7(4):738–745

    Google Scholar 

  • Lysyanskaya A, Triandopoulos N (2006) Rationality and adversarial behavior in multi-party computation. In: Advances in cryptology-CRYPTO 2006, pp 180–197. Springer

  • Maleka S, Shareef A, Rangan CP (2008a) The deterministic protocol for rational secret sharing. In: Parallel and distributed processing, 2008. IPDPS 2008. IEEE international symposium on, pp 1–7. IEEE

  • Maleka S, Shareef A, Rangan CP (2008b) Rational secret sharing with repeated games. In: Information security practice and experience, pp 334–346. Springer

  • Micali S (2009) Purely rational secret sharing. In: Theory of cryptography, pp 54–71. Springer

  • Milgrom P, Roberts J (1986) Relying on the information of interested parties. RAND J Econ 17(1):18–32

    Article  MathSciNet  Google Scholar 

  • Moses JR, William K, Rangan CP (2011) Rational secret sharing with honest players over an asynchronous channel. In: Advances in network security and applications, pp 414–426. Springer

  • Myerson RB (2013) Game theory. Harvard University Press, Cambridge

  • Nojoumian M, Stinson DR (2010) Brief announcement: secret sharing based on the social behaviors of players. In: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on principles of distributed computing, pp 239–240. ACM

  • Nojoumian M, Stinson DR (2012) Socio-rational secret sharing as a new direction in rational cryptography. In: Decision and game theory for security, pp 18–37. Springer

  • Nojoumian M, Stinson DR, Grainger M (2010) Unconditionally secure social secret sharing scheme. IET Inform Secur 4(4):202–211

    Article  Google Scholar 

  • Ogiela MR, Ogiela U (2010) The use of mathematical linguistic methods in creating secret sharing threshold algorithms. Comput Math Appl 60(2):267–271

    Article  MATH  MathSciNet  Google Scholar 

  • Ogiela MR, Ogiela U (2012) Linguistic protocols for secure information management and sharing. Comput Math Appl 63(2):564–572

    Article  MathSciNet  Google Scholar 

  • Ong SJ, Parkes DC, Rosen A, Vadhan S (2009) Fairness with an honest minority and a rational majority. In: Theory of cryptography, pp 36–53. Springer

  • Osborne MJ, Rubinstein A (1994) A course in game theory. MIT press, Cambridge

  • Osborne M, Rubinstein A (2004) A course in game theory. MIT Press, Cambridge

    Google Scholar 

  • Pass R, Halpern J (2010) Game theory with costly computation: formulation and application to protocol security. In: Proceedings of the behavioral and quantitative game theory: conference on future directions, p 89. ACM

  • Russell S, Norvig P, A. Intelligence (1995) A modern approach. Artificial Intelligence. Prentice-Hall, Egnlewood Cliffs, p 25

  • Serbanescu VN, Pop F, Cristea V, Achim OM (2012) Web services allocation guided by reputation in distributed soa-based environments. In: ISPDC 2012, pp 127–134. IEEE

  • Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613

    Article  MATH  MathSciNet  Google Scholar 

  • Shoham Y, Tennenholtz M (2005) Non-cooperative computation: Boolean functions with correctness and exclusivity. Theor Comput Sci 343(1):97–113

    Article  MATH  MathSciNet  Google Scholar 

  • Tian Y, Ma J, Peng C, Chen X, Ji W (2011a) One-time rational secret sharing scheme based on bayesian game. Wuhan Univ\ J Nat Sci 16(5):430–434

    Article  MATH  MathSciNet  Google Scholar 

  • Tian Y, Ma J, Peng C, Ji W (2011b) Game-theoretic analysis for the secret sharing scheme. Dianzi Xuebao (Acta Electronica Sinica) 39(12):2790–2795

  • Urbano A, Vila JE (2004) Computationally restricted unmediated talk under incomplete information. Econ Theory 23(2):283–320

    Article  MATH  MathSciNet  Google Scholar 

  • Visan A, Pop F, Cristea V (2011) Decentralized trust management in peer-to-peer systems. In: ISPDC 2011, pp 232–239. IEEE

  • Wallrabenstein JR, Clifton C (2013) Equilibrium concepts for rational multiparty computation. In: Decision and game theory for security, pp 226–245. Springer

  • Wang Y, Liu Z, Wang H, Xu Q (2014) Social rational secure multi-party computation. Concur Comput Pract Exp 26(5):1067–1083

    Article  Google Scholar 

  • Wang Y, Wong DS, Zhao C, Xu Q (2015) Fair two-party computation with rational parties holding private types. Secur Commun Netw 8(2):284–297

    Article  Google Scholar 

  • William K, Moses JR, Rangan CP (2011) Rational secret sharing over an asynchronous broadcast channel with information theoretic security. arXiv preprint arXiv:1112.4033

  • Xu B, Peng Z, Xiao F, Gates AM, Yu JP (2014) Dynamic deployment of virtual machines in cloud computing using multi-objective optimization. Soft Comput 1–9. doi:10.1007/s00500-014-1406-6

  • Yao AC (1982) Protocols for secure computations. In: 2013 IEEE 54th annual symposium on foundations of computer science, pp 160–164. IEEE

  • Zhang E, Cai Y (2010) A new rational secret sharing. China Commun 7(4):18–22

    Google Scholar 

  • Zhang E, Cai Y (2012) A verifiable rational secret sharing scheme based on bilinear pairing [j]. Acta Electronica Sinica 40(5):1050–1054

    MathSciNet  Google Scholar 

  • Zhang Z, Liu M (2011) Unconditionally secure rational secret sharing in standard communication networks. In: Information security and cryptology-ICISC 2010, pp 355–369. Springer

  • Zhang Z, Liu M (2013) Rational secret sharing as extensive games. Sci China Inform Sci 56(3):1–13

    Google Scholar 

Download references

Acknowledgments

This work is partially supported by National Natural Science Foundation of China (No. 61170161, 61202475), Guangzhou Zhujiang Science and Technology Future Fellow Fund (No. 2012J2200094), Outstanding Young Scientists Foundation Grant of Shandong Province (No. BS2014DX016), Nature Science Foundation of Shandong Province (No. ZR2012FQ029), Ph.D. Programs Foundation of Ludong University (No. LY2014033, LY2015033), Fujian Provincial Key Laboratory of Network Security and Cryptology Research Fund (Fujian Normal University) (No. 15004).

Author information

Authors and Affiliations

  1. School of Information and Electrical Engineering, Ludong University, Yantai, China

    Yilei Wang, Tao Li & Hairong Qin

  2. Fujian Provincial Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fuzhou, China

    Yilei Wang

  3. School of Computer Science and Educational Software, Guangzhou University, Guangzhou, China

    Jin Li

  4. School of Mathematics and Statistics Science, Ludong University, Yantai, China

    Wei Gao

  5. Laboratory of Algorithmics, Cryptology and Security, University of Luxembourg, Walferdange, Luxembourg

    Zhe Liu

  6. School of Computer Science and Technology, Shandong University, Jinan, China

    Qiuliang Xu

Authors
  1. Yilei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hairong Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Wei Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Zhe Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Qiuliang Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yilei Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, Y., Li, T., Qin, H. et al. A brief survey on secure multi-party computing in the presence of rational parties. J Ambient Intell Human Comput 6, 807–824 (2015). https://doi.org/10.1007/s12652-015-0299-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-015-0299-2

Keywords

Search

Navigation