基于Pairing抗选择密文攻击的 新门限密码体制
New Threshold Cryptosystem againstChosen C iphertextAttacks Based on Pairing
-
摘要: 为提高Baek-Zheng方案的解密效率,用逆运算代替Baek-Zheng方案中所用的点乘运算设计验证过程. 由于验证过程只需1次Pairing操作,故在保持Baek-Zheng方案的加密速度以及密文和解密碎片的长度的前提 下,新方案将每个门限解密参与者的效率提高了近1倍.新方案在Oracle Diffie-Hellman假设下被证明可以抗选 择密文攻击.
-
关键词:
- 选择密文攻击 /
- 门限密码体制 /
- Oracle Diffie-Hellman假设 /
- 方案
Abstract: To improve the decryption efficiency of the Baek-Zheng scheme, a new threshold scheme was proposed based on pairing. In the new scheme, the dot product operation in the Baek-Zheng scheme is replaced by an inversion operation to design the verifying process. Because the verifying process needs only one pairing operation, the efficiency of threshold decryption is increased nearly one time, and the new scheme has the same encryption efficiency and the sizes of the ciphertext or the decryption shares, comparedwith that in the Baek-Zheng scheme. The new schemewas proved secure against chosen ciphertext attacks under theOracle-Diffie-Hellman assumption.
点击查看大图
计量
- 文章访问数: 999
- HTML全文浏览量: 59
- PDF下载量: 108
- 被引次数: 0