One-Way Cross-Trees and Their Applications
One-Way Cross-Trees and Their Applications
复制标题
单向交叉树及其应用
DOI：
10.1007/3-540-45664-3_25
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
Sung
中科院分区：
文献类型：
--
作者：
M. Joye;Sung
本文考虑了一个秘密序列的有效生成问题，该秘密序列具有一个或多个秘密的知识不能帮助对手发现其他秘密的特殊性质。这是通过单向交叉树来实现的，它可以被看作是所谓单向链的多维扩展。在双重方式中，一些应用程序需要释放一个或多个秘密;单向交叉树允许最大限度地减少恢复这些秘密所需的数据量。
This paper considers the problem of efficiently generating a sequence of secrets with the special property that the knowledge of one or several secrets does not help an adversary to find the other ones. This is achieved through one-way cross-trees, which may be seen as a multidimensional extension of the so-called one-way chains. In a dual way, some applications require the release of one or several secrets; oneway cross-trees allow to minimize the amount of data necessary to recover those secrets and only those ones.