摘要
本文将原始概率加密体制的二值不可逼近陷门谓词推广到多值不可逼近陷门谓词,给出了相应的加、解密算法,证明了推广的概率加密体制仍然具有多项式安全和语义安全.最后构造了推广的概率加密体制的两个具体方案.
The two-valued unapproximable trapdoor predicate of probabilistic encryption is extended to the multivalued unapproximable trapdoor predicate in this paper. The corresponding encryption and deoryption algorithm are given. It is proved that the extended probabilistic encryption is of the polynomial and semantic security. Two examples are also given to illustrate the new scheme.
出处
《湖南大学学报(自然科学版)》
EI
CAS
CSCD
1992年第3期20-25,共6页
Journal of Hunan University:Natural Sciences
关键词
概率方法
谓词逻辑
加密
probabilistic methods
predicate logic
turing machine/polynomial security