Computationally Secure Robust Multi-secret Sharing for General Access Structure

DOI10.1007/978-81-322-2452-5_9zbMath1323.94148OpenAlexW1946733856MaRDI QIDQ3449413

Avishek Adhikari, Angsuman Das, Partha Sarathi Roy

Publication date: 4 November 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-81-322-2452-5_9

zbMATH Keywords

general access structurerobust secret sharingcomputational security

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Ramp secret sharing with cheater identification in presence of rushing cheaters

Cites Work

• Unnamed Item
• New results and applications for multi-secret sharing schemes
• Efficient verifiable multi-secret sharing scheme based on hash function
• An efficient multi-use multi-secret sharing scheme based on hash function
• An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme
• Sharing many secrets with computational provable security
• New efficient and practical verifiable multi-secret sharing schemes
• Secure Key Management in the Cloud
• How to share a secret
• An efficient and secure multi-secret sharing scheme with general access structures
• Distributed fingerprints and secure information dispersal

This page was built for publication: Computationally Secure Robust Multi-secret Sharing for General Access Structure