Skip to main content
SpringerLink
Log in

Rational Delegation Computing Using Information Theory and Game Theory Approach

  • Conference paper
  • First Online:
MultiMedia Modeling (MMM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11962))

Included in the following conference series:

Abstract

Delegation computing is a calculation protocol between non-cooperative participants, and its results are influenced by the participant’s choice of behavior. The goal of this paper is to solve the problem of high communication overhead in traditional delegation computing schemes. Combining the advantages of information theory and game theory, we propose a rational delegation computing scheme, which guarantees the correctness of the calculation results through the participant utility function. First, by analyzing the participant behavior strategy, we design the game model, which includes the participant set, information set, behavior strategy set and utility function. Second, according to the combination of Nash equilibrium and channel capacity limit in the game model, we construct a rational delegation computing scheme in this paper. Finally, we analyze and prove the scheme. When both the delegation party and computing party choose the honesty strategy, their utility reaches the maximum, that is, the global can reach the Nash equilibrium state, and the calculation efficiency has also been improved.

Y. Tian—Supported by organization x.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. In: Proceedings of IEEE Symposium on Foundations of Computer Science, vol. 45, no. 1, pp. 70–122 (1998)

    Article  MathSciNet  Google Scholar 

  2. Azar, P.D., Micali, S.: Rational proofs. In: Forty-Fourth ACM Symposium on Theory of Computing (2012)

    Google Scholar 

  3. Azar, P.D., Micali, S.: Super-efficient rational proofs. In: Fourteenth ACM Conference on Electronic Commerce (2013)

    Google Scholar 

  4. Chung, K.-M., Kalai, Y., Vadhan, S.: Improved delegation of computation using fully homomorphic encryption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 483–501. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14623-7_26

    Chapter  Google Scholar 

  5. Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465–482. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14623-7_25

    Chapter  Google Scholar 

  6. Gennaro, R., Wichs, D.: Fully homomorphic message authenticators. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 301–320. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-42045-0_16

    Chapter  Google Scholar 

  7. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems (1985)

    Google Scholar 

  8. Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: ACM Symposium on Theory of Computing (2008)

    Google Scholar 

  9. Guo, S., Hubáčk, P., Rosen, A., Vald, M.: Rational arguments: single round delegation with sublinear verification (2014)

    Google Scholar 

  10. Chen, J., Mccauley, S., Singh, S.: Rational proofs with multiple provers. In: ACM Conference on Innovations in Theoretical Computer Science (2016)

    Google Scholar 

  11. Zhang, L.F., Safavi-Naini, R.: Verifiable delegation of computations with storage-verification trade-off. In: Kutyłowski, M., Vaidya, J. (eds.) ESORICS 2014. LNCS, vol. 8712, pp. 112–129. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11203-9_7

    Chapter  Google Scholar 

  12. Micali, S.: CS proofs. In: Symposium on Foundations of Computer Science (2002)

    Google Scholar 

  13. Tian, Y.L., Peng, C.G., Lin, D.D., Ma, J.F., Qi, J., Ji, W.J.: Bayesian mechanism for rational secret sharing scheme. Sci. China Inf. Sci. 58(5), 52109–052109 (2015)

    Article  MathSciNet  Google Scholar 

  14. Yang, Y.X., Niu, X.X.: Covering information-theory with game-theory by the general theory of security-general theory of security(GTS)(11). J. Beijing Univ. Posts Telecommun. (2016)

    Google Scholar 

Download references

Acknowledgement

We would like to thank the anonymous reviewers for their valuable suggestions. This work is supported by The National Natural Science Foundation of China (Grant No. 61662009, 61772008); Science and Technology Major Support Program of Guizhou Province (Grant No. 20183001); Guizhou provincial science and technology plan project (Grant No. [2017]5788); Ministry of Education - China Mobile Research Fund Project (Grant No. MCM20170401); Guizhou University Cultivation Project (Grant No. [2017]5788) Research on Block Data Fusion Analysis Theory and Security Management Model of Data Sharing Application No. U1836205 Research on Key Technologies of Blockchain for Big Data Applications Grant No. [2019]1098 for their helpful comments.

Author information

Authors and Affiliations

  1. School of Big Data Engineering, Kaili University, Kaili, 556011, China

    Qiuxian Li

  2. The State Key Laboratory of Public Big Data, College of Computer Science and Technology, Guizhou University, Guiyang, 550025, China

    Youliang Tian

Authors
  1. Qiuxian Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Youliang Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Youliang Tian .

Editor information

Editors and Affiliations

  1. Korea Advanced Institute of Science and Technology, Daejeon, Korea (Republic of)

    Yong Man Ro

  2. National Chiao Tung University, Hsinchu, Taiwan

    Wen-Huang Cheng

  3. Korea Advanced Institute of Science and Technology, Daejeon, Korea (Republic of)

    Junmo Kim

  4. National Cheng Kung University, Tainan City, Taiwan

    Wei-Ta Chu

  5. Tsinghua University, Beijing, China

    Peng Cui

  6. Korea Advanced Institute of Science and Technology, Daejeon, Korea (Republic of)

    Jung-Woo Choi

  7. National Tsing Hua University, Hsinchu, Taiwan

    Min-Chun Hu

  8. Ghent University, Ghent, Belgium

    Wesley De Neve

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, Q., Tian, Y. (2020). Rational Delegation Computing Using Information Theory and Game Theory Approach. In: Ro, Y., et al. MultiMedia Modeling. MMM 2020. Lecture Notes in Computer Science(), vol 11962. Springer, Cham. https://doi.org/10.1007/978-3-030-37734-2_54

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-37734-2_54

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-37733-5

  • Online ISBN: 978-3-030-37734-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation