Skip to main content
SpringerLink
Log in

New Approach to Information Sharing Using Linguistic Threshold Schemes

  • Conference paper
Advances in Software Engineering (ASEA 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 30))

  • 394 Accesses

Abstract

This publication presents a new proposal for extending classical algorithms of secret splitting and threshold secret sharing schemes to include another stage of information coding with the use of the linguistic approach. Such an algorithm would be based on the appropriate context-free grammar allowing shared bit sequences, and more generally blocks of several bits, to be changed into new representations, namely sequences of production numbers of the introduced grammar. This stage can be executed by a trusted arbiter or by a system generating shadows of the secret. Such methods would form an additional stage improving the security of shared data.

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 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.

References

  1. Asmuth, C.A., Bloom, J.: A modular approach to key safeguarding. IEEE Transactions on Information Theory 29, 208–210 (1983)

    Article  MathSciNet  Google Scholar 

  2. Ateniese, G., Blundo, C., De Santis, A., Stinson, D.R.: Visual cryptography for general access structures. Information and Computation 129, 86–106 (1996)

    Google Scholar 

  3. Ateniese, G., Blundo, C., De Santis, A., Stinson, D.R.: Constructions and bounds for visual cryptography. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 416–428. Springer, Heidelberg (1996)

    Google Scholar 

  4. Beguin, P., Cresti, A.: General short computational secret sharing schemes. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 194–208. Springer, Heidelberg (1995)

    Google Scholar 

  5. Beimel, A., Chor, B.: Universally ideal secret sharing schemes. IEEE Transactions on Information Theory 40, 786–794 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  6. Blakley, G.R.: Safeguarding Cryptographic Keys. In: Proceedings of the National Computer Conference, pp. 313–317 (1979)

    Google Scholar 

  7. Blakley, G.R.: One-time pads are key safeguarding schemes, not cryptosystems: fast key safeguarding schemes (threshold schemes) exist. In: Proceedings of the 1980 Symposium on Security and Privacy, pp. 108–113. IEEE Press, Los Alamitos (1980)

    Google Scholar 

  8. Blakley, B., Blakley, G.R., Chan, A.H., Massey, J.: Threshold schemes with disenrollment. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 540–548. Springer, Heidelberg (1993)

    Google Scholar 

  9. Blundo, C., De Santis, A.: Lower bounds for robust secret sharing schemes. Inform. Process. Lett. 63, 317–321 (1997)

    Article  MathSciNet  Google Scholar 

  10. Charnes, C., Pieprzyk, J.: Generalised cumulative arrays and their application to secret sharing schemes. Australian Computer Science Communications 17, 61–65 (1995)

    Google Scholar 

  11. Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1990)

    Google Scholar 

  12. van Dijk, M.: On the information rate of perfect secret sharing schemes. Designs, Codes and Cryptography 6, 143–169 (1995)

    Article  MATH  Google Scholar 

  13. Hang, N., Zhao, W.: Privacy-preserving data mining Systems. Computer 40(4), 52–58 (2007)

    Article  Google Scholar 

  14. Jackson, W.-A., Martin, K.M., O’Keefe, C.M.: Ideal secret sharing schemes with multiple secrets. Journal of Cryptology 9, 233–250 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. Ogiela, M.R., Tadeusiewicz, R.: Modern Computational Intelligence Methods for the Interpretation of Medical Images. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  16. Ogiela, M.R., Ogiela, U.: Linguistic Extension for Secret Sharing (m, n)-threshold Schemes. SecTech, 2008-2008, International Conference on Security Technology, Hainan Island, Sanya, China, December 13 ~ 15, pp. 125–128 (2008) ISBN: 978-0-7695-3486-2, DOI: 10.1109/SecTech.2008.15

    Google Scholar 

  17. Shamir, A.: How to Share a Secret. Communications of the ACM, 612–613 (1979)

    Google Scholar 

  18. Simmons, G.J.: An Introduction to Shared Secret and/or Shared Control Schemes and Their Application in Contemporary Cryptology. In: The Science of Information Integrity, pp. 441–497. IEEE Press, Los Alamitos (1992)

    Google Scholar 

  19. Tang, S.: Simple Secret Sharing and Threshold RSA Signature Schemes. Journal of Information and Computational Science 1, 259–262 (2004)

    Google Scholar 

  20. Tadeusiewicz, R., Ogiela, M.R.: Medical Image Understanding Technology. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  21. Wu, T.-C., He, W.-H.: A geometric approach for sharing secrets. Computers and Security 14, 135–146 (1995)

    Article  Google Scholar 

  22. Zheng, Y., Hardjono, T., Seberry, J.: Reusing shares in secret sharing schemes. The Computer Journal 37, 199–205 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Automatics, AGH University of Science and Technology, Al. Mickiewicza 30, PL-30-059, Krakow, Poland

    Marek R. Ogiela

Authors
  1. Marek R. Ogiela
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Hannam University, 133 Ojeong-dong, DaedeokGu, 306-791, Daejeon, South Korea

    Tai-hoon Kim

  2. National Chiao Tung University, Hsinchu, Taiwan

    Wai-Chi Fang

  3. Korea University, Seoul, South Korea

    Changhoon Lee

  4. Mississippi State University, Mississippi State, MS, USA

    Kirk P. Arnett

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ogiela, M.R. (2009). New Approach to Information Sharing Using Linguistic Threshold Schemes. In: Kim, Th., Fang, WC., Lee, C., Arnett, K.P. (eds) Advances in Software Engineering. ASEA 2008. Communications in Computer and Information Science, vol 30. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10242-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10242-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10241-7

  • Online ISBN: 978-3-642-10242-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation