Skip to main content
Book cover

Cryptography pp 191–205Cite as

Secret Sharing, Visual Cryptography, and Voting

  • Chapter
  • First Online:
  • 6971 Accesses

Part of the book series: Springer Undergraduate Mathematics Series ((SUMS))

Abstract

Suppose you have n people, with whom you wish to share a secret. However, you do not wish to entrust any of them individually with the secret. Rather, you only want to allow them to learn what the secret is when a significant coalition of the people, at least k, say, work together to learn it. Furthermore, you don’t want to allow smaller coalitions to learn bits of the secret; you want any coalition of at most \(k-1\) people not to be able to learn anything at all. How do you do it?

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

Buying options

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

Notes

  1. 1.

    This problem is called the Dining Cryptographer Problem . It was proposed by David Chaum in [Cha88].

  2. 2.

    See [Ped91] for one solution.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Simon Rubinstein-Salzedo .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Rubinstein-Salzedo, S. (2018). Secret Sharing, Visual Cryptography, and Voting. In: Cryptography. Springer Undergraduate Mathematics Series. Springer, Cham. https://doi.org/10.1007/978-3-319-94818-8_17

Download citation

Publish with us

Policies and ethics