Abstract
At PKC 2006 Crutchfield, Molnar, Turner and Wagner proposed a generic threshold version of on-line/off-line signature schemes based on the “hash-sign-switch” paradigm introduced by Shamir and Tauman. Such a paradigm strongly relies on chameleon hash functions which are collision-resistant functions, with a secret trapdoor which actually allows to find arbitrary collisions efficiently. The “hash-sign-switch” paradigm works as follows. In the off-line phase, the signer hashes and signs a random message s. When, during the on-line phase, he is given a message m to sign the signer uses its knowledge of the hash trapdoor to find a second preimage and “switches” m with the random s. As shown by Crutchfield et al. adapting this paradigm to the threshold setting is not trivial. The solution they propose introduces additional computational assumptions which turn out to be implied by the so-called one-more discrete logarithm assumption.
In this paper we present an alternative solution to the problem. As in the previous result by Crutchfield et al., our construction is generic and can be based on any threshold signature scheme, combined with a chameleon hash function based on discrete log. However we show that, by appropriately modifying the chameleon function, our scheme can be proven secure based only on the traditional discrete logarithm assumption. While this produces a slight increase in the cost of the off-line phase, the efficiency of the on-line stage (the most important when optimizing signature computation) is unchanged. In other words the efficiency is essentially preserved. Finally, we show how to achieve robustness for our scheme. Compared to the work by Crutchfield et al., our main solution tolerates at most \({\left\lceil n/4 \right\rceil}\) (arbitrarily) malicious players instead of \(\left\lceil n/3 \right\rceil\) however we stress that we do not rely on random oracles in our proofs. Moreover we briefly present a variant which can achieve robustness in the presence of \(\left\lceil n/3 \right\rceil\) malicious players.
Keywords
- Signature Scheme
- Random Oracle
- Digital Signature Scheme
- Real Execution
- Threshold Signature Scheme
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.
Chapter PDF
References
Bar-Ilan, J., Beaver, D.: Non cryptographic fault tolerant computing in a constant number of rounds of interaction. In: Proceedings of the ACM Symposium on Principles of Distributed Computation, pp. 201–209. ACM Press, New York (1989)
Ben-or, M., Goldwasser, S., Widgerson, A.: Completeness Theorems for non-cryptographic fault tolerant distributed computation. In: Proc. of 20th Annual Symposium on Theory of Computing (1988)
Berlekamp, E., Welch, L.: Error correction of algebraic block codes. US Patent 4,633,470
Crutchfield, C., Molnar, D., Turner, D., Wagner, D.: Generic On-Line/Off-Line Threshold Signatures. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol. 3958, pp. 58–74. Springer, Heidelberg (2006)
Damgård, I., Dupont, K.: Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 346–361. Springer, Heidelberg (2005)
Desmedt, Y., Frankel, Y.: Threshold Cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1990)
Di Raimondo, M., Gennaro, R.: Provably Secure Threshold Password-Authenticated Key Exchange. In: Biham, E. (ed.) Advances in Cryptology – EUROCRPYT 2003. LNCS, vol. 2656, Springer, Heidelberg (2003)
Even, S., Goldreich, O., Micali, S.: On-Line/Off-Line Digital Signatures. J. Cryptology 9(1), 35–67 (1996)
Feldman, P.: A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In: Proc. 28th FOCS, pp. 427–437 (1987)
Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure Distributed Key Generation for Discrete-Log Public-Key Cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 295–310. Springer, Heidelberg (1999)
Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and Efficient Sharing of RSA Functions. J. Cryptology 13(2), 273–300 (2000)
Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust Threshold DSS Signatures. Inf. Comput. 164(1), 54–84 (2001)
Gennaro, R., Rabin, M., Rabin, T.: Simplified VSS and fast-track multi-party computations with applications to threshold cryptography. In: Proc. 17th ACM Symposium on Principle of Distributed Computing, ACM Press, New York (1998)
Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosen message attacks. SIAM J. on Computing 17(2), 281–308 (1988)
Krawczyk, H., Rabin, T.: Chameleon Signatures. In: 2000 NDSS Symposium, pp. 143–154 (2000)
National Institute for Standards and Technology. Digital Signature Standard (DSS). Technical Report 169, August 30 (1991)
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: OceanStore: An architecture for GlobalScale Persistent Storage. In: 2000 ACM Architectural Support for Programming Languages and Operating Systems Conference, ACM Press, New York (2000)
Pedersen, T.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)
Rhea, S., Eaton, P., Geels, D., Weatherspoon, H., Zhao, B., Kubiatowicz, J.: Pond: The OceanStore prototype. In: 2003 USENIX Conference on File and Storage Technologies (2003)
Shamir, A.: How to share a secret. Comm. of the ACM 22(11), 612–613 (1979)
Shamir, A., Tauman, Y.: Improved On-line/Off-line Signature Schemes. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 355–367. Springer, Heidelberg (2001)
Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207–220. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Bresson, E., Catalano, D., Gennaro, R. (2007). Improved On-Line/Off-Line Threshold Signatures. In: Okamoto, T., Wang, X. (eds) Public Key Cryptography – PKC 2007. PKC 2007. Lecture Notes in Computer Science, vol 4450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71677-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-71677-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71676-1
Online ISBN: 978-3-540-71677-8
eBook Packages: Computer ScienceComputer Science (R0)