On unconditionally secure all-or-nothing transforms

被引:0
|
作者
Chang, ZL [1 ]
Wen, QY [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Sci, Beijing 100876, Peoples R China
关键词
all-or-nothing transforms; resilient functions; permutation functions; finite fields;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
All-or-nothing transforms were defined firstly in [7] by Rivest, and they were studied in many references. Unfortunately these transforms were computationally secure. In [2] Stinson studied such transforms that were unconditionally secure. In this paper we will continue the research in [2], study the relation between all-or-nothing transforms and resilient functions, provide one characterization of such transforms, and give one method to construct nonlinear all-or-nothing transforms.
引用
收藏
页码:529 / 534
页数:6
相关论文
共 50 条