Skip to main content
SpringerLink
Log in
Book cover

Western European Workshop on Research in Cryptology

WEWoRC 2007: Research in Cryptology pp 114–126Cite as

Combiner Driven Management Models and Their Applications

  • Conference paper

  • 323 Accesses

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

Abstract

In this paper, we will study the question of performing arbitrary updates in secret sharing schemes when shares of unaffected parties shall remain unchanged. We will introduce a new phase in the lifetime of secret sharing schemes to simplify constructions of multi-time secret sharing schemes and propose management models that allow unlimited updates from arbitrary schemes without need for broadcasts. As an example, we give an implementation based on Shamir’s threshold scheme.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barwick, S.G., Jackson, W.-A., Martin, K.M., O’Keefe, C.: Optimal updating of ideal threshold schemes. Australasian Journal of Combinatorics 36, 123–132 (2006)

    MATH  MathSciNet  Google Scholar 

  2. Barwick, S.G., Jackson, W.-A., Martin, K.M.: Updating the parameters of a threshold scheme by minimal broadcast. IEEE Transactions on Information Theory 51(2), 620–633 (2005)

    Article  MathSciNet  Google Scholar 

  3. Blakley, G.R.: Safeguarding Cryptographic Keys. In:Proceesings AFIPS 1979, National Computer Conference, vol. 48, pp. 313–317 (1979)

    Google Scholar 

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

    Google Scholar 

  5. Blundo, C., Cresti, A., De Santis, A., Vaccaro, U.: Fully dynamic secret sharing schemes. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 110–125. Springer, Heidelberg (1994)

    Google Scholar 

  6. Cachin, C.: On-Line Secret Sharing. In: Boyd, C. (ed.) Cryptography and Coding 1995. LNCS, vol. 1025, pp. 190–198. Springer, Heidelberg (1995)

    Google Scholar 

  7. Ghodosi, H., Pieprzyk, J., Safavi-Naini, R.: Dynamic Threshold Cryptosystems: A New Scheme in Group Oriented Cryptography. In: Proceedings of PRAGOCRYPT 1996. International Conference on the Theory and Applications of Cryptology, pp. 370–379 (1996)

    Google Scholar 

  8. Martin, K.M.: Untrustworthy Participants in Secret Sharing Schemes, In: Cryptography and Coding III, pp. 255–264. Oxford University Press, Oxford (1993)

    Google Scholar 

  9. Martin, K.M.: Dynamic access policies for unconditionally secure secret sharing schemes. In: Proceedings of IEEE Information Theory Workshop (ITW 2005), Awaji Island, Japan (2005)

    Google Scholar 

  10. Pedersen, T.: A Threshold Cryptosystem without a Trusted Party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522–526. Springer, Heidelberg (1991)

    Google Scholar 

  11. Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  12. Simmons, G.J.: How to (really) share a secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 390–448. Springer, Heidelberg (1988)

    Google Scholar 

  13. Simmons, G.J.: Prepositioned shared secret and/or shared control schemes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 436–467. Springer, Heidelberg (1990)

    Google Scholar 

  14. Simmons, G.J.: An introduction to shared secret and/or shared control schemes and their applications. In: Contemporary Cryptology, pp. 441–497. IEEE Press, Los Alamitos (1992)

    Google Scholar 

  15. Stinson, D.R.: An explication of secret sharing schemes. In: Designs, Codes and Cryptography, pp. 357–390. Kluwer Academic Publishers, Dordrecht (1992)

    Google Scholar 

  16. Stoer, J., Bulirsch, R.: Introduction to Numerical Analysis. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  17. Tompa, M., Woll, H.: How To Share a Secret with Cheaters. Journal of Cryptology, 133–138 (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard Institut für Informatik, Universität Tübingen, Sand 14, 72076, Tübingen, Germany

    Michael Beiter

Authors
  1. Michael Beiter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät Medien, Bauhaus-Universität Weimar, Bauhausstr. 11, 99423, Weimar, Germany

    Stefan Lucks

  2. Horst Görtz Institute for IT Security, Ruhr-University of Bochum, Germany

    Ahmad-Reza Sadeghi

  3. Horst Görtz Institute for IT-Security, Ruhr-University Bochum, Germany

    Christopher Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beiter, M. (2008). Combiner Driven Management Models and Their Applications. In: Lucks, S., Sadeghi, AR., Wolf, C. (eds) Research in Cryptology. WEWoRC 2007. Lecture Notes in Computer Science, vol 4945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88353-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88353-1_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88352-4

  • Online ISBN: 978-3-540-88353-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation