Journal of Applied Mathematics

  • J. Appl. Math.
  • Volume 2014, Special Issue (2014), Article ID 176085, 9 pages.

A Rational Threshold Signature Model and Protocol Based on Different Permissions

Bojun Wang, Cheng Cai, and Quan Zhou

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


This paper develops a novel model and protocol used in some specific scenarios, in which the participants of multiple groups with different permissions can finish the signature together. We apply the secret sharing scheme based on difference equation to the private key distribution phase and secret reconstruction phrase of our threshold signature scheme. In addition, our scheme can achieve the signature success because of the punishment strategy of the repeated rational secret sharing. Besides, the bit commitment and verification method used to detect players’ cheating behavior acts as a contributing factor to prevent the internal fraud. Using bit commitments, verifiable parameters, and time sequences, this paper constructs a dynamic game model, which has the features of threshold signature management with different permissions, cheat proof, and forward security.

Article information

J. Appl. Math., Volume 2014, Special Issue (2014), Article ID 176085, 9 pages.

First available in Project Euclid: 1 October 2014

Permanent link to this document

Digital Object Identifier


Wang, Bojun; Cai, Cheng; Zhou, Quan. A Rational Threshold Signature Model and Protocol Based on Different Permissions. J. Appl. Math. 2014, Special Issue (2014), Article ID 176085, 9 pages. doi:10.1155/2014/176085.

Export citation


  • A. Shamir, “How to share a secret,” Communications of the Association for Computing Machinery, vol. 22, no. 11, pp. 612–613, 1979.
  • G. Blakeley, “Safeguarding cryptographic keys,” in Proceedings of the National Computer Conference, pp. 313–317, AFIPS Press, New York, NY, USA, 1979.
  • C. Asmuth and J. Bloom, “A modular approach to key safeguarding,” IEEE Transactions on Information Theory, vol. 29, no. 2, pp. 208–210, 1983.
  • P. Morillo, C. Padró, G. Sáez, and J. L. Villar, “Weighted threshold secret sharing schemes,” Information Processing Letters, vol. 70, no. 5, pp. 211–216, 1999.
  • C. Padró and G. Sáez, “Secret sharing schemes with bipartite access structure,” IEEE Transactions on Information Theory, vol. 46, no. 7, pp. 2596–2604, 2000.
  • T. Tassa and N. Dyn, “Multipartite secret sharing by bivariate interpolation,” Journal of Cryptology, vol. 22, no. 2, pp. 227–258, 2009.
  • O. Farràs, J. R. Metcalf-Burton, C. Padró, and L. Vázquez, “On the optimization of bipartite secret sharing schemes,” Designs, Codes and Cryptography, vol. 63, no. 2, pp. 255–271, 2012.
  • C.-W. Chan and C.-C. Chang, “A new (t, n)-threshold scheme based on difference equations,” in Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, pp. 94–106, Springer, Berlin, Germany, 2007.
  • B. Li, “Differential secret sharing scheme based on special access secret sharing scheme,” Journal of Sichuan University (Natural Science), vol. 43, no. 1, pp. 78–83, 2006.
  • Y. Desmedt and Y. Frankel, “Shared generation of authenticators and signatures,” in Proceedings of Advances in Cryptology-CRYPTO \textquotesingle 91, Santa Barbara, Calif, USA, 1991, pp. 457–469, Springer, Berlin, Germany, 1992.
  • A. Shamir, “Identity-based cryptosystems and signature schemes,” in Advances in Cryptology, vol. 196 of Lecture Notes in Computer Science, pp. 47–53, Springer, Berlin, Germany, 1985.
  • K. G. Paterson and J. C. N. Schuldt, “Efficient identity-based signatures secure in the standard model,” in Information Security and Privacy, vol. 4058 of Lecture Notes in Computer Science, pp. 207–222, Springer, Berlin, Germany, 2006.
  • T. Okamoto, “Provable secure and practical identification schemes and corresponding signature schemes,” in Advances in Cryptology-CRYPTO '92, vol. 740 of Lecture Notes in Computer Science, pp. 31–53, Springer, Berlin, Germany, 1992.
  • J. Halpern and V. Teague, “Rational secret sharing and multiparty computation: extended abstract,” in Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC \textquotesingle 04), pp. 623–632, New York, NY, USA, 2004.
  • S. D. Gordon and J. Katz, “Rational secret sharing, revisited,” in Security and Cryptography for Networks, vol. 4116 of Lecture Notes in Computer Science, pp. 229–241, Springer, Berlin, Germany, 2006.
  • S. Maleka, A. Shareef, and C. P. Rangan, “The deterministic protocol for rational secret sharing,” in Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium (IPDPS '08), pp. 1–7, IEEE, April 2008.
  • D. Wei and X. Qiuliang, “Special permission-based rational secret sharing scheme,” China Electronic Business: Communications Market, no. 2, pp. 180–184, 2009.
  • W. Dong, Secret sharing based on game theory and application of the theory [M.S. thesis], Shandong University, 2011.
  • F. Z. Ben, Stochastic Process, Science Press, Beijing, China, 2011.
  • Q. Weidong, Crypto Graphic Protocols Foundation, Higher Education Press, Beijing, China, 2009.
  • P. Feldman, “A practical scheme for non-interactive verifiable secret sharing,” in Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pp. 427–437, 1987. \endinput