Abstract
We describe a means of sharing the DSA signature function, so that two parties can efficiently generate a DSA signature with respect to a given public key but neither can alone. We focus on a certain instantiation that allows a proof of security for concurrent execution in the random oracle model, and that is very practical. We also briefly outline a variation that requires more rounds of communication, but that allows a proof of security for sequential execution without random oracles.
Chapter PDF
Similar content being viewed by others
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
J. Benaloh. Dense probabilistic encryption. In Workshop on Selected Areas of Cryptography, pages 120–128, 1994.
N. Barić and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In EUROCRYPT’ 96 (LNCS 1233), pages 480–494, 1997.
M. Blum, A. DeSantis, S. Micali, and G. Persiano. Noninteractive zero-knowledge. SIAM Journal of Computing 20(6):1084–1118, 1991.
C. Boyd. Digital multisignatures. In H. J. Beker and F. C. Piper, editors, Cryptography and Coding, pages 241–246. Clarendon Press, 1986.
M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In 1st ACM Conference on Computer and Communications Security, pages 62–73, November 1993.
R. A. Croft and S. P. Harris. Public-key cryptography and reusable shared secrets. In H. Baker and F. Piper, editors, Cryptography and Coding, pages 189–201, 1989.
M. Cerecedo, T. Matsumoto, H. Imai. Efficient and secure multiparty generation of digital signatures based on discrete logarithms. IEICE Trans. Fundamentals of Electronics Communications and Computer Sciences E76A(4):532–545, April 1993.
Y. Desmedt. Society and group oriented cryptography: a new concept. In CRYPTO’ 87 (LNCS 293), pages 120–127, 1987.
Y. Desmedt and Y. Frankel. Threshold cryptosystems. In CRYPTO’ 89 (LNCS 435), pages 307–315, 1989.
T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469–472, 1985.
FIPS 180-1. Secure hash standard. Federal Information Processing Standards Publication 180-1, U.S. Dept. of Commerce/NIST, National Technical Information Service, Springfield, Virginia, 1995.
FIPS 186. Digital signature standard. Federal Information Processing Standards Publication 186, U.S. Dept. of Commerce/NIST, National Technical Information Service, Springfield, Virginia, 1994.
Y. Frankel. A practical protocol for large group oriented networks. In EUROCRYPT’ 89 (LNCS 434), pages 56–61, 1989.
Y. Frankel, P. MacKenzie, and M. Yung. Adaptively-secure distributed threshold public key systems. In European Symposium on Algorithms (LNCS 1643), pages 4–27, 1999.
E. Fujisaki and T. Okamoto. Statistical zero-knowledge protocols to prove modular polynomial relations. In CRYPTO’ 97 (LNCS 1294), pages 16–30, 1997.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust threshold DSS signatures. In EUROCRYPT’ 96 (LNCS 1070), pages 354–371, 1996.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. In EUROCRYPT’ 99 (LNCS 1592), pages 295–310, 1999.
S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences 28:270–299, 1984.
S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing 17(2):281–308, April 1988.
L. Harn. Group oriented (t, n) threshold digital signature scheme and digital multisignature. IEE Proc.-Comput. Digit. Tech. 141(5):307–313, 1994.
A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung. Proactive public-key and signature schemes. In 4th ACM Conference on Computer and Communications Security, pages 100–110, 1997.
T. Hwang. Cryptosystem for group oriented cryptography. In EUROCRYPT’ 90 (LNCS 473), pages 352–360, 1990.
S. Jarecki and A. Lysyanskaya. Adaptively secure threshold cryptography: introducing concurrency, removing erasures. In EUROCRYPT 2000 (LNCS 1807), pages 221–242, 2000.
J. Kilian, E. Petrank, and C. Rackoff. Lower bounds for zero knowledge on the internet. In 39th IEEE Symposium on Foundations of Computer Science, pages 484–492, 1998.
D. W. Kravitz. Digital signature algorithm. U.S. Patent 5,231,668, 27 July 1993.
S. Langford. Threshold DSS signatures without a trusted party. In CRYPTO’ 95 (LNCS 963), pages 397–409, 1995.
P. MacKenzie and M. K. Reiter. Networked cryptographic devices resilient to capture. DIMACS Technical Report 2001-19, May 2001. Extended abstract in 2001 IEEE Symposium on Security and Privacy, May 2001.
D. Naccache and J. Stern. A new public-key cryptosystem. In EUROCRYPT’ 97 (LNCS 1233), pages 27–36, 1997.
M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In 22nd ACM Symposium on Theory of Computing, pages 427–437, 1990.
T. Okamoto and S. Uchiyama. A new public-key cryptosystem, as secure as factoring. In EUROCRYPT’ 98 (LNCS 1403), pages 308–318, 1998.
P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT’ 99 (LNCS 1592), pages 223–238, 1999.
C. Park and K. Kurosawa. New ElGamal type threshold digital signature scheme. IEICE Trans. Fundamentals of Electronics Communications and Computer Sciences E79A(1):86–93, January, 1996.
T. Pedersen. A threshold cryptosystem without a trusted party. In EUROCRYPT’ 91 (LNCS547), pages 522–526, 1991.
A. Yao. Protocols for secure computation. In 23rd IEEE Symposium on Foundations of Computer Science, pages 160–164, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
MacKenzie, P., Reiter, M.K. (2001). Two-Party Generation of DSA Signatures. In: Kilian, J. (eds) Advances in Cryptology — CRYPTO 2001. CRYPTO 2001. Lecture Notes in Computer Science, vol 2139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44647-8_8
Download citation
DOI: https://doi.org/10.1007/3-540-44647-8_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42456-7
Online ISBN: 978-3-540-44647-7
eBook Packages: Springer Book Archive