New (k,l,m)-verifiable multi-secret sharing schemes based on XTR public key system
From MaRDI portal
Publication:2118860
DOI10.1016/J.TCS.2022.01.036OpenAlexW4226018368MaRDI QIDQ2118860FDOQ2118860
Publication date: 23 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.08648
trace functiondynamismverifiable multi-secret sharingshorter key parametersthreshold changeableXTR public key system
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- How to share a secret
- Public-key cryptosystems based on cubic finite field extensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- General secure multi-party computation from any linear secret-sharing scheme
- Title not available (Why is that?)
- Threshold cryptography based on Asmuth-Bloom secret sharing
- A \((t,n)\) multi-secret sharing scheme
- New efficient and practical verifiable multi-secret sharing schemes
- Title not available (Why is that?)
- A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
- Verifiable multi-secret sharing based on LFSR sequences
- Title not available (Why is that?)
- Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
- Distributed Multi-User Secret Sharing
- On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
- Title not available (Why is that?)
- Attacks to some verifiable multi-secret sharing schemes and two improved schemes
- Title not available (Why is that?)
This page was built for publication: New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118860)
