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.
CITATION STYLE
Pieprzyk, J., & Okamoto, E. (2000). Verifiable secret sharing and time capsules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1787, pp. 169–183). Springer Verlag. https://doi.org/10.1007/10719994_14
Mendeley helps you to discover research relevant for your work.