A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
From MaRDI portal
Publication:2161420
DOI10.1007/s10623-022-01082-8zbMath1495.94087OpenAlexW4283785289WikidataQ114849692 ScholiaQ114849692MaRDI QIDQ2161420
Samaneh Mashahdi, Bagher Bagherpour, Ali Zaghian
Publication date: 4 August 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01082-8
verifiable secret sharinghomogeneous linear recursionsmulti secret sharingpublicly verifiable multi-secret sharingpublicly verifiable secret sharing
Related Items (2)
A bivariate polynomial-based cryptographic hard problem and its applications ⋮ An efficient publicly verifiable and proactive secret sharing scheme
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Paillier-based publicly verifiable (non-interactive) secret sharing
- Verifiable multi-secret sharing based on LFSR sequences
- Efficient verifiable multi-secret sharing scheme based on hash function
- Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
- A pairing-based publicly verifiable secret sharing scheme
- An efficient multi-use multi-secret sharing scheme based on hash function
- A verifiable multi-secret sharing scheme based on cellular automata
- Strong \((n, t, n)\) verifiable secret sharing scheme
- A \((t,n)\) multi-secret sharing scheme
- Cheating identifiable secret sharing scheme using symmetric bivariate polynomial
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem
- A fully dynamic secret sharing scheme
- A verifiable threshold secret sharing scheme based on lattices
- Secure publicly verifiable and proactive secret sharing schemes with general access structure
- New efficient and practical verifiable multi-secret sharing schemes
- Publicly Verifiable Secret Sharing
- How to share a secret
- Public Verifiability from Pairings in Secret Sharing Schemes
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
This page was built for publication: A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
