返回
Boolean permutation-based key escrow
DOI:10.1016/S0045-7906(99)00014-2.png)
摘要
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.
Keyword:
key escrow
Boolean function
secret sharing
knowledge recovery
storage complexity
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.9
论文数:
6.7K
被引数:
1.3W
机构
暂无机构信息
引用论文
COMPARATIVE PROTAMINE SULFATE AND HEPA-REMOVE NEUTRALIZATION STUDIES IN POTENCY ADJUSTED PORCINE AND BOVINE HEPARIN比较硫酸鱼精蛋白和HEPA-REMOVE中和试验在效价调整的猪源和牛源肝素中的应用研究
LONG-TERM EFFICACY AND SAFETY WITH ORAL BRUTON TYROSINE KINASE INHIBITOR RILZABRUTINIB IN PATIENTS WITH IMMUNE THROMBOCYTOPENIA口服Rilzabrutinib(Bruton酪氨酸激酶抑制剂)在免疫性血小板减少症患者中的长期疗效与安全性
MANAGEMENT CONSIDERATIONS IN THE SURGICAL SETTING OF SUSPECTED AQUIRED FACTOR DEFICIENCIES疑似获得性因子缺乏症的外科处理中的管理考量

