A verifiable threshold secret sharing scheme based on lattices
From MaRDI portal
Publication:2224837
Recommendations
Cites work
- A verifiable multi-secret sharing scheme based on cellular automata
- An ideal multi-secret sharing scheme based on MSP
- Anonymous secret sharing schemes
- Distributive weighted threshold secret sharing schemes
- Generalized Compact Knapsacks Are Collision Resistant
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Hierarchical threshold secret sharing
- How to share a secret
- scientific article; zbMATH DE number 4039795 (Why is no real title available?)
- scientific article; zbMATH DE number 1031003 (Why is no real title available?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Theory of Cryptography
- Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
- Visual multiple secret sharing based upon turning and flipping
Cited in
(6)- A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
- How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
- An LWE-based verifiable threshold secret sharing scheme
- Quantum-resistant password-based threshold single-sign-on authentication with updatable server private key
- Revisiting group oriented secret sharing schemes
- Verifiable secret sharing with changeable access structure
This page was built for publication: A verifiable threshold secret sharing scheme based on lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224837)