Verifiable secret sharing and time capsules

Josef Pieprzyk, Eiji Okamoto

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

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.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings
Place of PublicationBerlin; Heidelberg
PublisherSpringer, Springer Nature
Pages169-183
Number of pages15
Volume1787
ISBN (Print)3540673806, 9783540673804
DOIs
Publication statusPublished - 2000
Externally publishedYes
Event2nd International Conference on Information Security and Cryptology, ICISC 1999 - Seoul, Korea, Republic of
Duration: 9 Dec 199910 Dec 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1787
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other2nd International Conference on Information Security and Cryptology, ICISC 1999
CountryKorea, Republic of
CitySeoul
Period9/12/9910/12/99

Fingerprint

Dive into the research topics of 'Verifiable secret sharing and time capsules'. Together they form a unique fingerprint.

Cite this