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 QIDQ2118860
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
dynamismtrace functionverifiable multi-secret sharingshorter key parametersthreshold changeableXTR public key system
Cites Work
- Verifiable multi-secret sharing based on LFSR sequences
- Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
- Attacks to some verifiable multi-secret sharing schemes and two improved schemes
- A \((t,n)\) multi-secret sharing scheme
- Threshold cryptography based on Asmuth-Bloom secret sharing
- New efficient and practical verifiable multi-secret sharing schemes
- A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme
- How to share a secret
- On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
- A method for obtaining digital signatures and public-key cryptosystems
- Public-key cryptosystems based on cubic finite field extensions
- Distributed Multi-User Secret Sharing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
