.png){kind=icon}
Return
Boolean permutation-based key escrow
.png){kind=icon}
PRE
AI
DOI：10.1016/S0045-7906(99)00014-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
There has been an increasing interest in the design and use of key escrow schemes in recent times. This paper proposes a new key escrow protocol based on Boolean permutations and analyses its properties. It shows that the verification of the shares of key escrow agencies is easy and secure. In addition this: protocol Provides forward security as well as the capability to fully disclose the escrowed private keys in the case of guilty users. The paper also proposes methods for constructing practical trapdoor Boolean permutations with a low storage complexity. Apart from the proposal of the key escrow protocol itself, this paper describes some of the keg. properties of Boolean permutations which make them suitable for their use in the design of cryptosystems. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keywords:
key escrow
Boolean function
secret sharing
knowledge recovery
storage complexity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more