How to share a secret with cheaters
Journal of Cryptology
Cryptography: Theory and Practice,Second Edition
Cryptography: Theory and Practice,Second Edition
Discrete Mathematics
Secret Sharing with Reusable Polynomials
ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A practical verifiable multi-secret sharing scheme
Computer Standards & Interfaces
An efficient threshold verifiable multi-secret sharing
Computer Standards & Interfaces
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Research note: An on-line secret sharing scheme for multi-secrets
Computer Communications
An ideal multi-secret sharing scheme based on MSP
Information Sciences: an International Journal
| Hi-index | 0.24 |
In this paper, we propose two secure verifiable multi-secret sharing schemes that are based on non-homogeneous linear recursions and elliptic curves over Z"N. Such schemes have simple construction and verification phases. Moreover these have various techniques for the reconstruction phase. The security of the proposed schemes is based on the security of the ECRSA cryptosystem and the intractability of the ECDLP.