Verfiable Secret Sharing and Time Capsules

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.

[1]  Zvi Galil,et al.  Proceedings of the 30th IEEE symposium on Foundations of computer science , 1994, FOCS 1994.

[2]  Markus Stadler,et al.  Publicly Verifiable Secret Sharing , 1996, EUROCRYPT.

[3]  Vijay Varadharajan,et al.  Information and Communication Security , 1999, Lecture Notes in Computer Science.

[4]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[5]  Ed Dawson,et al.  Publicly Verifiable Key Escrow with Limited Time Span , 1999, ACISP.

[6]  Jennifer Seberry,et al.  Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically) , 1998, ASIACRYPT.

[7]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[8]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[9]  Berry Schoenmakers,et al.  A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic , 1999, CRYPTO.

[10]  Joan Feigenbaum,et al.  Advances in Cryptology-Crypto 91 , 1992 .

[11]  MARCO CARPENTIERI.  A perfect threshold secret sharing scheme to identify cheaters , 1995, Des. Codes Cryptogr..

[12]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[13]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[14]  Wenbo Mao.  Send Message into a Definite Future , 1999, ICICS.

[15]  Torben P. Pedersen.  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.

[16]  Information Security and Privacy , 1996, Lecture Notes in Computer Science.

[17]  Thomas Hardjono,et al.  The Sibling Intractable Function Family (SIFF): Notion, Construction and Applications (Special Section on Cryptography and Information Security) , 1993 .