Abstract
In this paper we apply techniques from secret sharing and threshold decryption to show how to properly design an ID-based threshold system in which one assumes no trust in any party.
In our scheme:
– We avoid that any single machine ever knew the master secret s of the trusted authority (TA). Instead only shares of it will be known by parties of the distributed TA and it can be seen as a virtual key.
–The threshold t TA and the number of shareholders n TA used by the distributed TA do not need to be identical to the ones used by user ID. Moreover, each user ID can use its own values for the threshold t i and the number of parties n i that will acquire shares.
–No single machine will ever know the secret key of the user – this means no single machine in the distributed TA and no shareholder of the user ID and not ID itself.
Like Baek and Zheng suggest, such a scheme can be turned into a mediated system.
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
Baek, J., Zheng, Y.: Identity-based threshold decryption. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 262–276. Springer, Heidelberg (2004)
Boneh, D., Ding, X., Tsudik, G.: Identity based encryption using mediated RSA. In: 3rd Workshop on Information Security Application, Proceedings (2002)
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)
Boneh, D., Franklin, M.: Identity based encryption from the Weil pairing. In Advances in Cryptology – Crypto 2001. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)
Boneh, D., Franklin, M.: Identity based encryption from the Weil pairing. SIAM J. Comput. 32(3), 586–615 (2003)
Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive Security for Threshold Cryptosystems. In Advances in Cryptology – Crypto 1999. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 98–115. Springer, Heidelberg (1999)
Chen, L., Gollmann, D., Mitchell, C.: Key escrow in mutually mistrusting domains. In Security Protocols Workshop. In: Lomas, M. (ed.) Security Protocols 1996. LNCS, vol. 1189, pp. 139–153. Springer, Heidelberg (1997)
Desmedt, Y., Jajodia, S.: Redistributing secret shares to new access structures and its applications. Tech. Report ISSE-TR-97-01, George Mason University (July 1997), ftp://isse.gmu.edu/pub/techrep/97_01_jajodia.ps.gz.
Ding, X., Tsudik, G.: Simple Identity-Based Cryptography with Mediated RSA. In Topics in Cryptology – CT-RSA 2003. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 193–210. Springer, Heidelberg (2003)
Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symp. on Foundations of Computer Science (FOCS), pp. 427–437. IEEE Computer Society Press, Los Alamitos (1987)
Frankel, Y., Gemmell, P., MacKenzie, P.D., Yung, M.: Optimal resilience proactive public key cryptosystems. In: 38th Annual Symp. on Foundations of Computer Science (FOCS), pp. 384–393. IEEE Computer Society Press, Los Alamitos (1997)
Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: The (in)security of distributed key generation in dlog-based cryptosystems. In Advances in Cryptology – Eurocrypt 1999. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 295–310. Springer, Heidelberg (1999)
Libert, B., Quisquater, J.-J.: Efficient revocation and threshold pairing based cryptosystems. In: Principles of Distributed Computing – PODC 2003, pp. 163–171. ACM Press, New York (2003)
Pedersen, T.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522–526. Springer, Heidelberg (1991)
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)
Poupard, G., Stern, J.: Generation of shared RSA keys by two parties. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 11–24. Springer, Heidelberg (1998)
Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)
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
Desmedt, Y., Lange, T. (2006). Pairing Based Threshold Cryptography Improving on Libert-Quisquater and Baek-Zheng. In: Di Crescenzo, G., Rubin, A. (eds) Financial Cryptography and Data Security. FC 2006. Lecture Notes in Computer Science, vol 4107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889663_12
Download citation
DOI: https://doi.org/10.1007/11889663_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46255-2
Online ISBN: 978-3-540-46256-9
eBook Packages: Computer ScienceComputer Science (R0)