Efficient verifiable multi-secret sharing scheme based on hash function
From MaRDI portal
Publication:506699
DOI10.1016/J.INS.2014.03.025zbMath1354.94059OpenAlexW2028098316MaRDI QIDQ506699
Publication date: 2 February 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.03.025
Related Items (5)
Computationally Secure Robust Multi-secret Sharing for General Access Structure ⋮ A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme ⋮ Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers ⋮ A novel fault-tolerant privacy-preserving cloud-based data aggregation scheme for lightweight health data ⋮ A verifiable \((k, n)\)-threshold dynamic quantum secret sharing scheme
Cites Work
- Unnamed Item
- An efficient multi-use multi-secret sharing scheme based on hash function
- A verifiable multi-secret sharing scheme based on cellular automata
- Threshold cryptography in P2P and MANETs: The case of access control
- An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme
- New efficient and practical verifiable multi-secret sharing schemes
- A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing
- A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
- How to share a secret
- A method for obtaining digital signatures and public-key cryptosystems
- A Direct Anonymous Attestation Scheme for Embedded Devices
This page was built for publication: Efficient verifiable multi-secret sharing scheme based on hash function