Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 176085, 9 pages
http://dx.doi.org/10.1155/2014/176085
Research Article

A Rational Threshold Signature Model and Protocol Based on Different Permissions

1School of Electronic and Computer Engineering, Peking University, Shenzhen 518055, China
2College of Computer Science and Technology, Beijing University of Technology, Beijing 100124, China

Received 3 April 2014; Revised 1 July 2014; Accepted 4 July 2014; Published 23 July 2014

Academic Editor: Young-Sik Jeong

Copyright © 2014 Bojun Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Shamir, “How to share a secret,” Communications of the Association for Computing Machinery, vol. 22, no. 11, pp. 612–613, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  2. G. Blakeley, “Safeguarding cryptographic keys,” in Proceedings of the National Computer Conference, pp. 313–317, AFIPS Press, New York, NY, USA, 1979.
  3. C. Asmuth and J. Bloom, “A modular approach to key safeguarding,” IEEE Transactions on Information Theory, vol. 29, no. 2, pp. 208–210, 1983. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. 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. View at Publisher · View at Google Scholar
  5. 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. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. T. Tassa and N. Dyn, “Multipartite secret sharing by bivariate interpolation,” Journal of Cryptology, vol. 22, no. 2, pp. 227–258, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. 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. View at Publisher · View at Google Scholar · View at MathSciNet
  8. 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. View at Google Scholar
  9. 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. View at Google Scholar · View at MathSciNet
  10. Y. Desmedt and Y. Frankel, “Shared generation of authenticators and signatures,” in Proceedings of Advances in Cryptology-CRYPTO '91, Santa Barbara, Calif, USA, 1991, pp. 457–469, Springer, Berlin, Germany, 1992. View at Google Scholar
  11. 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. View at Google Scholar
  12. 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. View at Publisher · View at Google Scholar
  13. 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. View at Publisher · View at Google Scholar
  14. 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 '04), pp. 623–632, New York, NY, USA, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  15. 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. View at Publisher · View at Google Scholar
  16. 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. View at Publisher · View at Google Scholar · View at Scopus
  17. D. Wei and X. Qiuliang, “Special permission-based rational secret sharing scheme,” China Electronic Business: Communications Market, no. 2, pp. 180–184, 2009. View at Google Scholar
  18. W. Dong, Secret sharing based on game theory and application of the theory [M.S. thesis], Shandong University, 2011.
  19. F. Z. Ben, Stochastic Process, Science Press, Beijing, China, 2011.
  20. Q. Weidong, Crypto Graphic Protocols Foundation, Higher Education Press, Beijing, China, 2009.
  21. 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.