In this paper we present a new Auto-Recoverable Auto- Certifiable Cryptosystem that is based on an algebraic problem different from the original system (of Eurocrypt’98). Specifically, our new cryptosystem uses generalized ElGamal and RSA. It has the following new advantages: (1) the escrow authority’s key can be set-up much faster than in the original scheme; and (2) It can be used to implement the notion we introduce here of what we call “escrow hierarchy.”.
CITATION STYLE
Young, A., & Yung, M. (1999). Auto-recoverable cryptosystems with faster initialization and the escrow hierarchy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1560, pp. 306–314). Springer Verlag. https://doi.org/10.1007/3-540-49162-7_24
Mendeley helps you to discover research relevant for your work.