iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/11599548_33
New Methods to Construct Cheating Immune Multisecret Sharing Scheme | SpringerLink
Skip to main content

New Methods to Construct Cheating Immune Multisecret Sharing Scheme

  • Conference paper
Information Security and Cryptology (CISC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3822))

Included in the following conference series:

Abstract

In this paper, the constructions of cheating immune secret sharing and multisecret sharing are studied. Based on the theories of matrix and linear block codes over finite field, some new methods to construct cheating immune secret sharing, strictly cheating immune secret sharing and multisecret sharing immune against cheating are proposed. Some cryptographic properties of the constructed secret sharing are analyzed as well.

This work was supported by the National Science Foundation of China under the grant No.60373104 and Key Project of Jiangsu education bureau, China, under grant number 03KJA520066.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Tompa, M., Woll, H.: How to Share a Secret with cheaters. Journal of Cryptology 1(2), 133–138 (1988)

    MATH  MathSciNet  Google Scholar 

  2. Jackson, W.-A., Martin, K.M., OKeefe, C.M.: Multisecret threshold schemes. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 126–135. Springer, Heidelberg (1994)

    Google Scholar 

  3. Nyberg, K., Knudsen, L.R.: Provable security against differential cryptanalysis. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 566–574. Springer, Heidelberg (1993)

    Google Scholar 

  4. Pieprzyk, J., Zhang, X.-M.: Cheating prevention in secret sharing over GF(p). In: Pandu Rangan, C., Ding, C. (eds.) INDOCRYPT 2001. LNCS, vol. 2247, pp. 226–243. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Pieprzyk, J., Zhang, X.-M.: Multisecret Sharing Immune against cheating. Informatica-An International Journal of Computing and Informatics 26(3), 271–278 (2002)

    MATH  MathSciNet  Google Scholar 

  6. Pieprzyk, J., Zhang, X.-M.: Constructions of cheating immune secret sharing. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 226–243. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Ghodosi, H., Piepreyk, J.: Cheating prevention in secret sharing. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 328–341. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Stadler, M.: Publicly verifiable secret sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190–199. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  9. Fujisaki, E., Okamoto, T.: A practical and provably secure scheme for publicly verifiable secret sharing and its applications[A]. In: Advances in Cryptology, EUCRYPTO 1998 , pp. 32–47. Springer, Berlin (1998)

    Google Scholar 

  10. Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148–164. Springer, Heidelberg (1999)

    Google Scholar 

  11. McEliece, R.J.: Finite fields for computer scientists and engineers. Kluwer Academic, Dordrecht (1987)

    MATH  Google Scholar 

  12. Ma, W.P., Lee, M.H.: New methods to construct cheating immune functions. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, pp. 79–86. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ma, W.P., Zhang, F.T. (2005). New Methods to Construct Cheating Immune Multisecret Sharing Scheme. In: Feng, D., Lin, D., Yung, M. (eds) Information Security and Cryptology. CISC 2005. Lecture Notes in Computer Science, vol 3822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599548_33

Download citation

  • DOI: https://doi.org/10.1007/11599548_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30855-3

  • Online ISBN: 978-3-540-32424-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics