Communications of the ACM
Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Efficient Publicly Verifiable Secret Sharing with Correctness, Soundness and ZK Privacy
Information Security Applications
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
How to fix two RSA-based PVSS schemes: exploration and solution
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
| Hi-index | 0.00 |
This paper presents ongoing work toward employment of RSA encryption in PVSS. Two PVSS schemes are shown to be efficient only when very small RSA public keys like 3 are employed to encrypt the shares. However, too small RSA public keys like 3 are insecure in the PVSS schemes as they cannot apply padding to the encrypted messages. When practical larger RSA public keys are employed, the two PVSS schemes have to process extremely large integers and become intolerably inefficient.