Skip to main content
SpringerLink
Log in

Verifiable Secret Sharing and Time Capsules

  • Conference paper
Information Security and Cryptology - ICISC’99 (ICISC 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1787))

Included in the following conference series:

Abstract

The paper considers verifiable Shamir secret sharing and presents three schemes. The first scheme allows to validate secrets recovered. The second construction adds the cheater identification feature also called the share validation capability. The third scheme permits to share multiple secrets with secret validation. The constructions are based on hashing and for security evaluation, hashing is modelled as a random oracle with public description. We discuss an application of verifiable secret sharing for the design of cryptographic time capsules for time-release crypto.

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. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for design efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communication Security, 1993, Fairfax, Virginia, November 3-5, 1994, pp. 62–73 (1993)

    Google Scholar 

  2. Burmester, M., Desmedt, Y., Seberry, J.: Equitable key escrow with limited time span. In: Ohta, K., Pei, D. (eds.) SAFECOMP 1998. LNCS, vol. 1516, pp. 380–391. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Carpentieri, M.: A perfect threshold secret sharing scheme to identify cheaters. Designs, Codes and Cryptography 5(3), 183–187 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Feldman, P.: A practical scheme for non-interactive veriable secret sharing. In: Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pp. 427–437. IEEE, Los Alamitos (1987)

    Google Scholar 

  5. Mao, W.: Send message into a definite future. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol. 1726, pp. 244–251. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  7. Pedersen, T.P.: Non-interactive and information-theoretic secure veriable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)

    Google Scholar 

  8. Rabin, T., Ben-Or, M.: Veriable secret sharing and multiparty protocols with honest majority. In: Proceedings of 21st ACM Symposium on Theory of Computing, pp. 73–85 (1989)

    Google Scholar 

  9. Rivest, R., Shamir, A., Wagner, D.: Time-lock puzzles and time-release crypto (1996), http://theory.lcs.mit.edu/rivest/RivestShamirWagner-timelock.ps

  10. Schoenmakers, B.: A simple publicly veriable 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. Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  12. Stadler, M.: Publicly veriable secret sharing. In: Maurer, U. (ed.) Advances in Cryptology - EUROCRYPT 1996. LNCS, vol. 1070, pp. 190–199. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  13. Tamura, Y., Okamoto, E.: Concept and implementation of flexible secret sharing scheme. In: Proceedings of 1998 Computer Security Symposium(CSS 1998) (1998)

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  15. Viswanathan, K., Boyd, C., Dawson, E.: Publicly veriable key escrow with limited time span. In: Pieprzyk, J.P., Safavi-Naini, R., Seberry, J. (eds.) ACISP 1999. LNCS, vol. 1587, pp. 36–50. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  16. Zheng, Y., Hardjono, T., Pieprzyk, J.: The sibling intractable function family (SIFF): notion, construction and applications. IEICE Trans. Fundamentals E76- A, 4–13 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Computer Security Research, School of IT and Computer Science, University of Wollongong, Wollongong, NSW 2522, Australia

    Josef Pieprzyk

  2. Center for Cryptography, Computer and Network Security, University of Wisconsin Milwaukee, Milwaukee, WI, 53201, USA

    Eiji Okamoto

Authors
  1. Josef Pieprzyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eiji Okamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, Yonsei University, Seoul, Korea

    JooSeok Song

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pieprzyk, J., Okamoto, E. (2000). Verifiable Secret Sharing and Time Capsules. In: Song, J. (eds) Information Security and Cryptology - ICISC’99. ICISC 1999. Lecture Notes in Computer Science, vol 1787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719994_14

Download citation

  • DOI: https://doi.org/10.1007/10719994_14

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45568-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation