Abstract
Verifiable Signature Sharing (VσS) enables the recipient of a digital signature, who is not necessarily the original signer, to share such signature among n proxies so that a subset of them can later reconstruct it. The original RSA and Rabin VσS protocols were subsequently broken and the original DSS VσS lacks a formal proof of security.
We present new protocols for RSA, Rabin and DSS VσS. Our protocols are efficient and provably secure and can tolerate the malicious behavior of up to half of the proxies. Furthermore we believe that some of our techniques are of independent interest. Some of the by-products of our main result are: a new threshold cryptosystem, a new undeniable signature scheme and a way to create binding RSA cryptosy stems.
Extended abstract. A final version of this paper can be found at http://wircr.research.ibm.com/security/vsigmas.ps
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
N. Asokan, V. Shoup and M. Waidner. Optimistic fair exchange of digital signatures. EUROCRYPT'98.
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness Theorems for Non-cryptographic Fault-Tolerant Distributed Computations. STOC'88 pp.1–10, 1988.
M. Burmester. Homomorphism of secret sharing schemes: a tool for verifiable signature sharing. EUROCRYPT'96, pp.96–106. LNCS vol.1070.
David Chaum and Hans Van Antwerpen. Undeniable signatures. CRYPTO'89, pages 212–217. LNCS vol. 435.
D. Chaum, C. Crepeau, and I. Damgard. Multiparty Unconditionally Secure Protocols. STOC'88, pp.11–19, 1988.
B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. FOCS'85, pp.383–395, 1985.
D. Coppersmith, M. Franklin, J. Patarin and M. Reiter. Low-exponent RSA with related messages. EUROCRYPT'96, pp.1–9. LNCS vol.1070.
I. Damgard and T. Pedersen. New convertible undeniable signature schemes. EUROCRYPT'96, pp.372–386. LNCS vol.1070.
A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. STOC'94, pp.522–533, 1994.
W. Diffie and M.E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, v. IT-22, no. 6, pp. 644–654, November 1976.
T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31(4):469–472, 1985.
P. Feldman. A Practical Scheme for Non-Interactive Verifiable Secret Sharing. FOCS'87, pp.427–437, 1987.
Y. Frankel, P. Gemmell, P. Mackenzie, and M. Yung. Optimal Resilience Proactive Public-Key Cryptosystems. FOCS'97, pp.384–393.
M. Franklin and M. Reiter. Verifiable Signature Sharing. EUROCRYPT'95, pp.50–63. LNCS vol.921.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust and efficient sharing of RSA functions. CRYPTO'96, pp.157–172. LNCS vol.1109.
R. Gennaro, S. Jarecki, and T. Rabin. Securely revisiting distributed key generation. Manuscript.
R. Gennaro, H. Krawczyk and T. Rabin. RSA-Based Undeniable Signatures. CRYPTO'97, LNCS vol.1294.
O. Goldreich and A. Kahan. How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. J. of Cryptology, Vol.9, No.3, pp.167–190, 1996.
O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. Journal of the ACM, 38(1):691–729, 1991.
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. STOC'87, pp.218–229, 1987.
S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS, 28(2), pp.270–299, April 1984.
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. SIAM. J. Computing, 18(1):186–208, February 1989.
H. Krawczyk. Secret sharing made short. CRYPTO'93, pp.136–146, LNCS 773.
K.S. McCurley. A key distribution system equivalent to factoring. Journal of Cryptology. vol.1, pp.95–105, 1988.
T. Pedersen. A threshold cryptosystem without a trusted party. EUROGRYPT'91, pp.522–526, LNCS vol. 547
T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. CRYPTO'91, pp.129–140, LNCS vol. 576
T. Rabin. A Simplified Approach to Threshold and Proactive RSA. To appear in CRYPTO'98.
A. Shamir. How to share a secret. Communications of the ACM, 22:612–613, 1979.
Z. Shmuely. Composite Diffie-Hellman public-key generating systems are hard to break. Technion Dept. of Computer Science Technical Report no.356, 1985.
M. Stadler. Publicly Verifiable Secret Sharing. EUROCRYPT'96, pp.190–199, LNCS vol.1070.
E. Verheul and H. van Tilborg. Binding ElGamal. EUROCRYPT'97, LNCS 1233.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Catalano, D., Gennaro, R. (1998). New efficient and secure protocols for verifiable signature sharing and other applications. In: Krawczyk, H. (eds) Advances in Cryptology — CRYPTO '98. CRYPTO 1998. Lecture Notes in Computer Science, vol 1462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055723
Download citation
DOI: https://doi.org/10.1007/BFb0055723
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64892-5
Online ISBN: 978-3-540-68462-6
eBook Packages: Springer Book Archive