Abstract
We consider methods for threshold RSA decryption among distributed agencies without any dealer or trusted party. We present two methods: One is based on the previous two techniques by [FMY98] and [FGMY97]. It demonstrates the feasibility of combining the distributed key generation and the RSA secure function application. The other method [MS99] is newly developed technique based on [FMY98] and further inspired by Simmons’ protocol-failure of RSA (we believe that it is very interesting that a “protocol failure attack” be turned into a constructive method!). The latter requires less “distributed computation” as the key is being set up and it can be more smoothly incorporated into the existing distributed key generation techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boneh, D., Daswani, N.: Experimenting with electronic commerce on the PalmPilot. In: Franklin, M.K. (ed.) FC 1999. LNCS, vol. 1648, pp. 1–16. Springer, Heidelberg (1999)
Boneh, D., Franklin, M.: Efficient generation of shared RSA keys. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 425–439. Springer, Heidelberg (1997)
De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely (extended summary). In: Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, Montréal, Quebéc, Canada, May 23-25, pp. 522–533 (1994)
Desmedt, Y.: Threshold cryptosystems (a survey). In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 3–14. Springer, Heidelberg (1993)
Desmedt, Y., Frankel, Y.: Shared generation ofauthenticators and signatures (extended abstract). In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 457–469. Springer, Heidelberg (1992)
Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1990)
Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal-resilience proactive public-key cryptosystems. In: 38th Annual Symposium on Foundations of Computer Science, pp. 384–393 (1997)
Frankel, Y., Gemmell, P., Yung, M.: Witness-based cryptographic program checking and robust function sharing. In: STOC 1996, pp. 499–508 (1996)
Frankel, Y., MacKenzie, P.D., Yung, M.: Robust efficient distributed RSA-key generation. In: Proceedings of the thirtieth annual ACM symposium on theory of computing, pp. 663–672 (1998)
Frankel, Y., MacKenzie, P.D., Yung, M.: Pseudorandom Intermixing: A Tool for Shared Cryptography. In: To appear in Proc. of PKC’2000, International Workshop on Practice and Theory in Public Key Cryptography, Melbourne, Australia, January 18-20 (2000)
Frankel, Y., Yung, M.: Distributed public key cryptosystems (Invited Paper). In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol. 1431, pp. 1–13. Springer, Heidelberg (1998)
Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and efficient sharing of RSA functions. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 157–172. Springer, Heidelberg (1996)
Miyazaki, S., Sakurai, K.: Notes on thershold schemes in distributed RSA cryptosystems(in Japanese). In: Proc. the 1999 Symposium of Cryptography and Information Security (SCIS 1999), June 1999, vol. 3.1, pp. 451–456 (1999)
Okamoto, T.: Threshold key-recovery systems for RSA. In: Christianson, B., Lomas, M. (eds.) Security Protocols 1997. LNCS, vol. 1361, pp. 191–200. Springer, Heidelberg (1998)
Pedersen, T.P.: Distributed provers with applications to undeniable signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 221–238. Springer, Heidelberg (1991)
Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522–526. Springer, Heidelberg (1991)
Rabin, T.: A simplified approach to threshold and proactive rsa. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 89–104. Springer, Heidelberg (1998)
Shamir, A.: How to share a secret. Communication ACM 22, 612–613 (1979)
Shoup, V.: Practical threshold signatures, June 24, A revision of IBM Research Report RZ 3121 available from Theory of Cryptography Library 99-11 (April 19 1999), http://philby.ucsd.edu/cryptolib/1999.html
Simmons, G.J.: A ‘weak’ privacy protocol using the RSA cryptoalgorithm. Cryptologia 7, 180–182 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miyazaki, S., Sakurai, K., Yung, M. (2000). On Threshold RSA-Signing with no Dealer. In: Song, J. (eds) Information Security and Cryptology - ICISC’99. ICISC 1999. Lecture Notes in Computer Science, vol 1787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719994_16
Download citation
DOI: https://doi.org/10.1007/10719994_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67380-4
Online ISBN: 978-3-540-45568-4
eBook Packages: Springer Book Archive