An efficient multi-use multi-secret sharing scheme based on hash function

DOI10.1016/J.AML.2010.04.024zbMath1193.94055OpenAlexW2080939522MaRDI QIDQ988708

Avishek Adhikari, Angsuman Das

Publication date: 18 August 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2010.04.024

zbMATH Keywords

verifiablerenewablemulti-usepseudo-secret share

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (5)

A NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA ⋮ Computationally Secure Robust Multi-secret Sharing for General Access Structure ⋮ A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme ⋮ Recursive hiding of biometrics-based secret sharing scheme using adversary structure ⋮ Efficient verifiable multi-secret sharing scheme based on hash function

Cites Work

• Unnamed Item
• An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme
• Publicly Verifiable Secret Sharing
• How to share a secret
• An efficient and secure multi-secret sharing scheme with general access structures

This page was built for publication: An efficient multi-use multi-secret sharing scheme based on hash function