CAI Cheng, WANG Bojun, Ditta Allah, et al., “A Rational Secret Sharing Scheme Against Coalition Based on Nash Equilibrium and Neighbor s Strategy,” Chinese Journal of Electronics, vol. 23, no. 3, pp. 564-568, 2014,
Citation: CAI Cheng, WANG Bojun, Ditta Allah, et al., “A Rational Secret Sharing Scheme Against Coalition Based on Nash Equilibrium and Neighbor s Strategy,” Chinese Journal of Electronics, vol. 23, no. 3, pp. 564-568, 2014,

A Rational Secret Sharing Scheme Against Coalition Based on Nash Equilibrium and Neighbor s Strategy

Funds:  This work is supported by the National Natural Science Foundation of China (No.61170221).
  • Received Date: 2013-12-01
  • Rev Recd Date: 2014-01-01
  • Publish Date: 2014-07-05
  • In order to prevent any arbitrary subsets of coalition in rational secret sharing, we propose a new oneway information transmission mechanism, every player in a rational secret sharing protocol only interacts with his around two players, which means his decision is strictly based on previous neighboring player's strategy. Combined with the punishment strategy of Maleka's scheme and payoff distribution principle in Game Theory, our scheme is capable of achieving Nash equilibrium and has the feature of anti-coalition. For the conspirators, getting the secret at the same time or in less than necessary iteration rounds is almost impossible. Without repeated involvement of the dealer, our scheme has the features of verifiability, anticoalition, and more meaningfully, superiority of approaching reality model by taking rational behavior into consideration.
  • loading
  • Shamir A., "How to share a secret", Communications of the ACM, Vol.22, pp.612-613, 1979.
    Chor Benny, Goldwasser S., Micali S., Awerbuch Baruch, "Verifiable secret sharing and achieving simultaneity in the presence of faults", Proc. 26th IEEE Symposium on Foundations of Computer Science, Portland, OR, USA, pp.372-382, 1985.
    Markus Stadler, "Publicly verifiable secret sharing", Advances in Cryptology-EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, pp.190-199, 1996.
    Joseph Halpern, Vanessa Teague, "Rational secret sharing and multiparty computation", Proc. of STOC, New York, USA, pp.623-632, 2004.
    S. Dov Gordon, Jonathan Katz, "Rational secret sharing revisited", Proc. of Security and Cryptography for Networks Conference Berlin Springer, pp.229-241, 2006.
    Yongquan Cai, Huili Shi, "A Scheme of Rational Secret Sharing Against Cheating", Proc. of the Second International Symposium Computer Science and Computational Technology, pp.166-169, 2009.
    Yongquan Cai, Xiaofeng Ren, "A cheat-proof rational secret sharing scheme", Journal of Computational Information Systems, pp.88-96,2011.
    Ittai Abraham, Danny Dolev, Rica Gonen, Joe Halpern, "Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation", Proc. of the 25th the Annual ACM Symposium on Principles of Distributed Computing, Denver, USA, pp.53-62, 2006.
    Shareef, Amjed, "Brief announcement: Collusion free protocol for rational secret sharing", Proc. of the Annual ACM Symposium on Principles of Distributed Computing, pp.402-403, 2010.
    Gillat Kol, Moni Naor, "Cryptography and game theory: Designing protocols for exchanging information", Fifth Theory of Cryptography Conference, pp.320-339, 2008.
    Isshiki Toshiyuki, Wada Koichiro, Tanaka Keisuke, "A rational secret-sharing scheme based on RSA-OAEP", IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, pp.42-49, 2010.
    G. Fuchsbauer, J. Katz, D. Naccache, "Efficient rational secret sharing in standard communication networks", Theory of Cryptography, Proc. 7th Theory of Cryptography Conference, pp.419-436, 2010.
    Walid Saad, et al., "Coalitional game theory for communication networks: A tutorial", IEEE Signal Processing Magazine, pp.77-97, 2009.
    A.N. Sklyarevich, "A model of one-way transmission of information fragments in a channel", Automatic Control and Computer Sciences, pp.12-19,1987.
    Shaik Maleka, et al., "Rational secret sharing with repeated games", Information Security Practice Experience, 4th International Conference, pp.334-346, 2008.
    Li Dawei, Yang Geng, Yu Changguo, "A survey of rational secret sharing schemes", Journal of Nanjing University of Posts and Telecommunications, Vol.30, No. 2, pp.89-94, 2010.
    P.Feldman, "A practical scheme for non-interactive verifiable secret sharing", Proc. 28th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, pp.427-437, 1987.
    Almudena Alcaide, Juan M. Estevez-Tapiador, Julio C. Hernandez-Castro, Arturo Ribagorda, "A multi-party rational exchange protocol", Proc. OTM Confederated International Workshops and Posters, Vilamoura, Portugal, pp.25-30, 2007.
    G. J. Simmons, "The prisoner's problem and the subliminal channel", Advances in Cryptology, Proc. of Crypto. 83, pp.51-67, 1984.
    Cai Yongquan, Peng Xiaoyu, "Rational secret sharing protocol with fairness", Chinese Journal of Electronics, Vol.21, No.1, pp.149-152, 2012.
    Zhang Futai, Zhang Jie, "Efficient and information-theoretical secure verifiable secret sharing over bilinear groups", Chinese Journal of Electronics, Vol.23, No.1, pp.13-17, 2014.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (462) PDF downloads(1160) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return