Abstract
We introduce Verifiable Signature Sharing (VΣS), a cryp- tographic primitive for protecting digital signatures. VΣS enables the holder of a digitally signed document, who may or may not be the origi- nal signer, to share the signature among a set of proxies so that the honest proxies can later reconstruct it. We present efficient VΣS schemes for ex- ponentiation based signatures (e.g., RSA, Rabin) and discrete log based signatures (e.g., ElGamal, Schnorr, DSA) that can tolerate the malicious (Byzantine) failure of the sharer and a constant fraction of the proxies. We also describe our implementation of these schemes and evaluate their performance. Among the applications of VΣS is the incorporation of dig- ital cash into multiparty protocols, e.g., to enable cash escrow and secure distributed auctions.
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.
Download to read the full chapter text
Chapter PDF
References
D. Beaver, S. Micali, and P. Rogaway, “The round complexity of secure protocols,” ACM STOC 1990, 503–513.
M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computation,” ACM STOC 1988, 1–9.
E. Berlekamp and L. Welch, “Error correction of algebraic block codes,” U.S. Patent Number 4,633,470.
G. Blakely “Safeguarding cryptographic keys,” AFIPS National Computer Conference 48 (1979), 313–317.
D. Chaum, “Security without identification: transaction systems to make big brother obsolete,” CACM 28 (1985), 1030–1044.
D. Chaum, C. Crépeau, and I. Damgård, “Multiparty unconditionally secure protocols,” ACM STOC 1988, 11–19.
D. Chaum, A. Fiat, and M. Naor, “Untraceable electronic cash,” Crypto 1988, 319–327.
B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, “Verifiable secret sharing and achieving simultaneity in the presence of faults,” IEEE FOCS 1985, 383–395.
A. DeSantis, Y. Desmedt, Y. Frankel, and M. Yung, “How to share a function securely,” ACM STOC 1994, 522–533.
Y. Desmedt, “Threshold cryptography,” European Transactions on Telecommunications and Related Technologies 5 (1994), 449–457.
NIST FIPS PUB 181, “Digital signature standard,” U.S. Department of Commerce/National Institute of Standards and Technology.
T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Trans. Information Theory IT-31 (1985), 469–472.
P. Feldman, “A practical scheme for non-interactive verifiable secret sharing,” IEEE FOCS 1987, 4427–4437.
M. K. Franklin and M. K. Reiter, “The design and implementation of a secure auction service,” IEEE Symposium on Security and Privacy, Oakland, CA, 1995 (to appear).
O. Goldreich, S. Micali, and A. Wigderson, “How to play any mental game,” ACM STOC 1987, 218–229.
V. Hadzilacos and S. Toueg, “Fault-tolerant broadcasts and related problems,” In Distributed Systems (2nd edition), Chapter 5, Addison-Wesley, 1993.
J. Hoffman, “New power-of-attorney form is introduced,” The New York Times, October 1, 1994.
J. Lacy, D. Mitchell, and W. Schell, “CryptoLib: cryptography in software,” 4th USENIX Security Workshop, pp. 1–17, 1993.
L. Lamport, R. Shostak, and M. Pease, “The Byzantine generals problem,” ACM TOPLAS 4 (1982), 382–401.
S. Micali, “Fair public-key cryptosystems,” Crypto 1992, 113–138.
T. Pedersen, “Distributed provers with applications to undeniable signatures,” Eurocrypt 1991, 221–242.
M. Rabin, “Digitalized signatures and public key functions as intractable as factorization,” Technical Report MIT/LCS/TR-212, Laboratory for Computer Science, Massachusetts Institute of Technology, 1979.
M. K. Reiter, “Secure agreement protocols: Reliable and atomic group multicast in Rampart,” 2nd ACM Conf. Computer and Comm. Security, 68–80, 1994.
R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” CACM 21 (1978), 120–126.
C. Schnorr, “Efficient signature generation by smart cards,” J. Cryptology 4 (1991), 161–174.
A. Shamir, “How to share a secret,” CACM 22 (1979), 612–613.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franklin, M.K., Reiter, M.K. (1995). Verifiable Signature Sharing. In: Guillou, L.C., Quisquater, JJ. (eds) Advances in Cryptology — EUROCRYPT ’95. EUROCRYPT 1995. Lecture Notes in Computer Science, vol 921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49264-X_5
Download citation
DOI: https://doi.org/10.1007/3-540-49264-X_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59409-3
Online ISBN: 978-3-540-49264-1
eBook Packages: Springer Book Archive