Abstract
The deployment of a “public-key infrastructure” (PKI) has recently started. Another recent concern in business and on the national level is the issue of escrowed encryption, key recovery, and emergency access to information (e.g., in the medical record area). Independent development of a PKI and an escrowed PKI (whenever required or desired) will pose a lot of constraints, duplication efforts and increased costs of the deployment. It will introduce inter-operability issues which will be hard to overcome. Thus, what we advocate here is a joint design of an escrowed PKI and a regular PKI.
In this work we develop an approach to such an integrated design. We give the first auto-recoverable systems based on RSA (or factoring), whereas the original auto-recoverable auto-certifiable schemes were based on Discrete Logarithm based keys. The security proof of our system assumes only that RSA is hard, while the original schemes required new specific discrete log based assumptions. We also put forth the notion of “generic” auto-recoverable systems where one can start with an unescrowed user key and then by simply doing “re-registration”, change the key into an escrowed one. In contrast, in the original systems the user keys were tightly connected with the escrow authorities’ key. Besides this novel (re)-registration procedure there are no changes or differences for users between a PKI and a generic auto-recoverable PKI.
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
Asokan, N., Shoup, V., Waidner, M.: Optimistic Fair Exchange of Digital Signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 134–148. Springer, Heidelberg (1998)
Boyar, J., Friedl, K., Lund, C.: Practical zero-knowledge proofs: Giving hints and using Deficiencies. Journal of Cryptology 4(3), 185–206 (1991)
Bellare, M., Goldwasser, S.: Encapsulated Key Escrow (1996) (manuscript)
Bellare, M., Rogaway, P.: Random Oracles are Practical. In: ACM CCCS 1994 (1994)
Boudot, F., Traore, J.: Efficient publicly verifiable secret sharing schemes with fast or delayed recovery. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol. 1726, pp. 87–102. Springer, Heidelberg (1999)
Chen, L.: Efficient Fair Exchange of Verifiable Confirmation of Signatures. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 286–299. Springer, Heidelberg (1998)
Chaum, D., Fiat, A., Naor, M.: Untraceable Electronic Cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 319–327. Springer, Heidelberg (1990)
Chan, A., Frankel, Y., Tsiounis, Y.: Easy Come - Easy Go Divisible Cash. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 561–575. Springer, Heidelberg (1998)
Canetti, R., Goldreich, O., Halevi, S.: The Random Oracle Methodology. In: ACM STOC 1998 (1998) (revisited)
Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In: FOCS 1985 (1985)
Camenish, J., Michels, M.: Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 107. Springer, Heidelberg (1999)
Camenish, J., Maurer, U., Stadler, M.: Digital Payments Systems with Passive Anonymity Revocation Trustees. In: Esorics 1996 (1996)
Camenish, J., Stadler, M.: Efficient Group Signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410–424. Springer, Heidelberg (1997)
Desmedt, Y.: Abuses in Cryptography and Howt o Fight Them. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 375–389. Springer, Heidelberg (1990)
De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to Share a Function Securely. In: ACM STOC 1994, pp. 522–533 (1994)
Feldman, P.: A Practical Scheme for Non-interactive Verifiable Secret Sharing. In: FOCS 1987 (1987)
Frankel, Y., Gemmell, P., MacKenzie, P., Yung, M.: Optimal Resilience Proactive Public Key Systems. In: FOCS 1997 (1997)
Frankel, Y., Gemmell, P., Yung, M.: Witness based Cryptographic Program Checking and Robust Function Sharing. In: ACM STOC 1996 (1996)
Fujisaki, E., Okamoto, T.: A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 32–46. Springer, Heidelberg (1998)
Fouque, P., Poupard, G., Stern, J.: Recovering Keys in Open Networks. IEEE ITW (1999)
Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)
Frankel, Y., Tsiounis, Y., Yung, M.: Indirect Discourse Proofs: Achieving Efficient Fair Off-Line Cash. In: Advances in Cryptology—Asiacrypt 1996 (1996)
Franklin, M., Yung, M.: Towards Provably Secure Efficient Electronic Cash. In: ICALP 1993 (1993)
Galil, Z., Haber, S., Yung, M.: Minimum-knowledge Interactive Proofs for Decision Problems. SIAM J. of Computing (4), 711–739 (1989)
Gennaro, R., Jarecki, S.: Robust and Efficient Sharing of RSA. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 157–172. Springer, Heidelberg (1996)
van de Graaf, J., Peralta, R.: A simple and secure way to show the validity of your public key. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 128–134. Springer, Heidelberg (1988)
Impagliazzo, R., Yung, M.: Direct Minimum-Knowledge Computations. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 40–51. Springer, Heidelberg (1988)
Kilian, J., Leighton, F.T.: Fair Cryptosystems Revisited. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 208–221. Springer, Heidelberg (1995)
Kilian, J., Micali, S., Ostrovsky, R.: Minimum-Resources Zero-Knowledge Proofs. In: FOCS 1989 (1989)
Kilian, J., Petrank, E.: Identity Escrow. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 169–185. Springer, Heidelberg (1998)
Liskov, M., Silverman, R.D.: A Statistical Limited-Knowledge Proof for Secure RSA Keys. Submited to the IEEE P1363 Working Group, Available at http://grouper.ieee.org/groups/1363/contrib.htm
Young, A., Yung, M.: Manuscript related to the current work dated (September 1997), available from the authors (preliminary version also submitted to EUROCRYPT 1999)
Micali, S.: Fair Public-Key Cryptosystems. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 113–138. Springer, Heidelberg (1993)
Mao, W., Lim, C.H.: Cryptanalysis in Prime Order Subgroups of Z * n . In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 214–226. Springer, Heidelberg (1998)
Paillier, P., Yung, M.: Self-Escrowed Public-Key Infrastructures (mauscript)
Pointcheval, D., Stern, J.: Security Proofs for Signature Schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387–398. Springer, Heidelberg (1996)
Poupard, G., Stern, J.: Short Proofs of Knowledge of Factorin. In: These proceedings
Poupard, G., Stern, J.: Talks at Luminy (October 1999)
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the CACM 21(2), 120–126 (1978)
Schoenmakers, B.: A simple Publicly Verifiable Secret Sharing Scheme and its Application to Electronic Voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148–164. Springer, Heidelberg (1999)
Schnorr, C.P.: Efficient Signature Generation for Smart Cards. Journal of Cryptology 4(3), 161–174 (1991)
Stadler, M.: Publicly Verifiable Secret Sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190–199. Springer, Heidelberg (1996)
Verheul, E.: Certificates of Recoverability with Scalable Recovery Agent Security. In: These Proceedings
Young, A., Yung, M.: The Dark Side of Black-Box Cryptography. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 89–103. Springer, Heidelberg (1996)
Young, A., Yung, M.: Auto-Recoverable and Auto-Certifiable Cryptosystems. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 17–31. Springer, Heidelberg (1998)
Young, A., Yung, M.: Auto-Recoverable Cryptosystems with Faster Initialization and The Escrow Hierarchy. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, p. 306. Springer, Heidelberg (1999)
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
Young, A., Yung, M. (2000). RSA-Based Auto-recoverable Cryptosystems. In: Imai, H., Zheng, Y. (eds) Public Key Cryptography. PKC 2000. Lecture Notes in Computer Science, vol 1751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46588-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-46588-1_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66967-8
Online ISBN: 978-3-540-46588-1
eBook Packages: Springer Book Archive