A fast non-interactive publicly verifiable secret sharing scheme
| Autor: | Shahrooz Janbaz, Ali Zaghian, Bagher Bagherpour, R. Asghari |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Scheme (programming language)
050101 languages & linguistics Correctness Theoretical computer science Computer science business.industry 05 social sciences Cryptography 02 engineering and technology Secret sharing Homogeneous 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 0501 psychology and cognitive sciences Verifiable secret sharing business computer computer.programming_language Standard model (cryptography) |
| Zdroj: | ISCISC |
| DOI: | 10.1109/iscisc51277.2020.9261914 |
| Popis: | A non-interactive (t, n)-publicly verifiable secret sharing scheme (non-interactive (t, n)-PVSS scheme) is a method to share a secret among n participants so that only subsets of the participants with at least t elements can compute the secret and anyone, not only the participants of the scheme, can verify the correctness of the shares of participants without interacting with the dealer and participants of the scheme. In this paper, we propose a non-interactive (t, n)-PVSS scheme using the homogeneous linear recursions (HLRs) and prove its security in a standard model. For n ≥ t ≥ 2, our non-interactive (t, n)-PVSS scheme runs faster than Schoenmakers’s. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|