Abstract
Threshold signature schemes distribute secret information to several servers and make the whole system that maintains the secret information fault-tolerant. Since threshold signature schemes typically assume that the shared signing function can only be activated by a quorum number of servers. If anyone has a power to activate the signing function of servers, he can easily compute valid signatures for a specific organization without knowing the private key. S. Xu et al. proposed a general construction to build threshold signature schemes (called as server assisted threshold signatures) which provide an organization (e.g., a user) with controllability for activating his private signing function in a certain enhanced way. In this paper, we newly propose proactive secret sharing schemes which are suitable for server-assisted threshold signatures.
This work was partially supported by Grant No. R01-2006-000-10260-0 from the Basic Research Program of KOSEF, and Strategic International Cooperative Program, Japan Science and Technology Agency (JST).
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
Bouncy Castle 1.24, https://www.bouncycastle.org
Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, A.R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: Proc. of 9th ACM CCS (2002)
Luo, H., Lu, S.: Ubiquitous and Robust Authentication Services for Ad Hoc Wireless Networks, UCLA Computer Science Technical Report 200030 (October 2000)
Garms, J., Somerfield, D.: Professional Java Security, Wrox Press Ltd. (2001)
Zhou, L.: Towards Fault-Tolerant and Secure On-line Services, PhD Dissertation, Department of Computer Science, Cornell University, Ithaca, NY USA (April 2001)
Feldman, P.: A Pracitcal Scheme for Non-Interactive Verifiable Secret Sharing. In: Proc. of 28th FOCS (1987)
MacKenzie, P., Reiter, M.: Networked Cryptographic Devices Resilient to Capture. In: IEEE Security and Privacy 2001, May 14-16 (2001)
MacKenzie, P., Reiter, M.: Two-Party Generation of DSA Signatures. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 137–154. Springer, Heidelberg (2001)
Gennaro, R., Jarecki, S., Krawczyk, H.: Revisiting the Distributed Key Generation for Discrete-Log Based Cryptosystems. In: RSA Security 2003 (2003)
Jarecki, S.: Proactive Secret Sharing and Public Key Cryptosystems. MIT Master of Engineering Thesis (1995)
Xu, S., Sandhu, R.: Two Efficient and Provably Secure Schemes for Server-Assisted Threshold Signatures. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 355–372. Springer, Heidelberg (2003)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, JP., Rhee, K.H., Sakurai, K. (2006). A Proactive Secret Sharing for Server Assisted Threshold Signatures. In: Gerndt, M., Kranzlmüller, D. (eds) High Performance Computing and Communications. HPCC 2006. Lecture Notes in Computer Science, vol 4208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847366_26
Download citation
DOI: https://doi.org/10.1007/11847366_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39368-9
Online ISBN: 978-3-540-39372-6
eBook Packages: Computer ScienceComputer Science (R0)