摘要
本文研究了一种基于几何方式的（T，N）-门限RSA密码体制在这里，系统解密和签名的权力被分给N个成员，使得任意T个成员可以合作完成解密和签名，而少于T个成员时则无法解密文件或伪造签名.
One crucial defense against exposure of private keys is offered by threshold cryptogTaphy where the private key functions are distributed among several parties such that a predetermined nurnber of parties must mperate in order to corrctly perform this operation. An efficient scheme based on peetry which implements (T, N)-threshold RSA cryptosytem is presentetl. In the system, the power to decrypt and to sign is shared by N players such that any subset of T players can collahaate to perform RSA functions, but no subset of fewer than T corrupted players can decrypt a ciphertext of forg a signature.
出处
《电子学报》
EI
CAS
CSCD
北大核心
1999年第6期134-135,共2页
Acta Electronica Sinica
基金
国家教委留学回国人员基金
国家自然科学基金
关键词
门限密码学
秘密分享
RSA密码
Threshold cryptogrphy, Secret sharing, RSA cryptosystem
