Efficient verifiable multi-secret sharing scheme based on hash function
From MaRDI portal
Publication:506699
DOI10.1016/J.INS.2014.03.025zbMATH Open1354.94059OpenAlexW2028098316MaRDI QIDQ506699FDOQ506699
Authors: Jun Shao 
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
Recommendations
- A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
- Verifiable multi-secret sharing based on LFSR sequences
- Multi-use multi-secret sharing scheme for general access structure
- New efficient and practical verifiable multi-secret sharing schemes
- A verifiable multi-secret-sharing scheme based on homogeneous linear recursion
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- How to share a secret
- 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
- A verifiable multi-secret sharing scheme based on cellular automata
- Title not available (Why is that?)
- 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
- A Direct Anonymous Attestation Scheme for Embedded Devices
- Threshold cryptography in P2P and MANETs: The case of access control
Cited In (19)
- Secret sharing: a comprehensive survey, taxonomy and applications
- Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
- A verifiable \((k, n)\)-threshold dynamic quantum secret sharing scheme
- Multi-use multi-secret sharing scheme for general access structure
- A new secret sharing scheme adversary fuzzy structure based on automata
- A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
- Multiparty verification in image secret sharing
- An efficient multi-use multi-secret sharing scheme based on hash function
- Lightweight, maliciously secure verifiable function secret sharing
- Computationally secure robust multi-secret sharing for general access structure
- A verifiable multi-secret-sharing scheme based on homogeneous linear recursion
- Dynamic multi-secret sharing scheme with verification
- Using an efficient hash chain and delaying function to improve an e-lottery scheme
- A verifiable multi-secret sharing scheme based on \(\ell\)-intersection pair of cyclic codes
- A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
- Efficient VSS free of computational assumption
- A fully dynamic multi-secret sharing scheme with redundant authorization
- 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
This page was built for publication: Efficient verifiable multi-secret sharing scheme based on hash function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506699)
