arrow
返回

Boolean permutation-based key escrow

delete1999-07-01
delete1
PRE
AI
C
Chuan-Kun Wu *
V
Varadharajan, V
DOI:10.1016/S0045-7906(99)00014-2delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Electrical Engineering
IF:
4.9
论文数:
6.7K
被引数:
1.3W

机构

暂无机构信息
引用论文

引用论文

A taxonomy for key escrow encryption systems
err1996-03-01
err117
errOAAI
errDenning, DE; Branstad, DK
err分享
err收藏
err分享
err收藏
Commercial key recovery
err1996-03-01
err33
errOAAI
errWalker, ST; Lipner, SB; Ellison, CM; Balenson, DM
err分享
err收藏
Luminescence of Gold Nanoparticles
err2024-09-05
err0
PREAI
errLuca Prodi; Gionata Battistini; Luisa Stella Dolci; Marco Montalti; Nelsi Zaccheroni
err分享
err收藏
Nuclear isomers in 259Sg and 255Rf
err2015-04-14
err0
PREAI
errS. Antalic; F. P. Heßberger; D. Ackermann; S. Heinz; S. Hofmann; B. Kindler; J. Khuyagbaatar; B. Lommel; R. Mann
err分享
err收藏
学者 查看更多内容