An LWE-based verifiable threshold secret sharing scheme
From MaRDI portal
Publication:3383067
DOI10.4213/mvk287zbMath1473.94108OpenAlexW2966532282MaRDI QIDQ3383067
Mohammad Reza Aref, T. Eghlidos, Zahra Naghdabadi, S. Karimani
Publication date: 23 September 2021
Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/mvk287
threshold secret sharinglattice based cryptographytrapdoor functionlearning with errors (LWE) problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Publicly Verifiable Secret Sharing
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- How to share a secret
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- Collision-Free Hashing from Lattice Problems
- Post-Quantum Cryptography
- Authenticated Group Key Transfer Protocol Based on Secret Sharing
- Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
- On lattices, learning with errors, random linear codes, and cryptography