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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
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)
Carpentieri, M.: A perfect threshold secret sharing scheme to identify cheaters. Designs, Codes and Cryptography 5(3), 183–187 (1995)
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)
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)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
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)
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)
Rivest, R., Shamir, A., Wagner, D.: Time-lock puzzles and time-release crypto (1996), http://theory.lcs.mit.edu/rivest/RivestShamirWagner-timelock.ps
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)
Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)
Stadler, M.: Publicly veriable secret sharing. In: Maurer, U. (ed.) Advances in Cryptology - EUROCRYPT 1996. LNCS, vol. 1070, pp. 190–199. Springer, Heidelberg (1996)
Tamura, Y., Okamoto, E.: Concept and implementation of flexible secret sharing scheme. In: Proceedings of 1998 Computer Security Symposium(CSS 1998) (1998)
Tompa, M., Woll, H.: How to share a secret with cheaters. Journal of Cryptology 1(2), 133–138 (1988)
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)
Zheng, Y., Hardjono, T., Pieprzyk, J.: The sibling intractable function family (SIFF): notion, construction and applications. IEICE Trans. Fundamentals E76- A, 4–13 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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