期刊导航

论文摘要

基于LWE问题的发送方可否认公钥加密方案

Sender-side Public Key Deniable Encryption Scheme Based on LWE

作者:吴文渊(自动推理与认知重庆市重点实验室,重庆 400714;中国科学院 重庆绿色智能技术研究院,重庆 400714);郑嘉彤(自动推理与认知重庆市重点实验室,重庆 400714;中国科学院 重庆绿色智能技术研究院,重庆 400714;中国科学院大学,北京 101408);冯勇(自动推理与认知重庆市重点实验室,重庆 400714;中国科学院 重庆绿色智能技术研究院,重庆 400714)

Author:WU Wenyuan(Chongqing Key Lab. of Automated Reasoning & Cognition, Chongqing 400714, China;Chongqing Inst. of Green Intelligent Technol., Chinese Academy of Sciences, Chongqing 400714, China);ZHENG Jiatong(Chongqing Key Lab. of Automated Reasoning & Cognition, Chongqing 400714, China;Chongqing Inst. of Green Intelligent Technol., Chinese Academy of Sciences, Chongqing 400714, China;Univ.of Chinese Academy of Sciences, Beijing 101408, China);FENG Yong(Chongqing Key Lab. of Automated Reasoning & Cognition, Chongqing 400714, China;Chongqing Inst. of Green Intelligent Technol., Chinese Academy of Sciences, Chongqing 400714, China)

收稿日期:2019-01-11          年卷(期)页码:2020,52(2):192-199

期刊名称:工程科学与技术

Journal Name:Advanced Engineering Sciences

关键字:抗量子攻击;可否认加密;公钥加密;模糊集

Key words:anti-quantum attack;deniable encryption;public key encryption;translucent set

基金项目:重庆市科委项目(cstc2017zdcy–yszxX0011;cstc2018jcyj–yszxX0002);国家自然科学基金项目(11671377)

中文摘要

采用可否认加密方案可以有效解决因敌手胁迫导致的信息泄露问题。目前,国内外学者提出的可否认加密方案,大多不能抵御量子计算机的攻击,且没有对方案的性能进行分析和实现。针对该问题,本文提出并实现一种基于容错学习困难问题(LWE)构造的可否认加密方案。该方案在具有抵抗量子攻击能力的同时,还可以将明文否认成任意的假明文,使得发送方可以抵御敌手的胁迫攻击。首先,利用LWE问题中的不可区分性质,在均匀空间中构建了一个密度很小的子集“模糊集”;利用低密度的“模糊集”构造比特0和1的密文,实现对明文比特的单向否认,同时降低了单比特解密时的误码率。然后,通过提出的一种明文编码方法,实现了对单个比特的双向可否认,使得发送方将原明文抵赖为任意的假明文。经理论分析可知,该方案具有可否认性,是IND–CPA安全的,且误码率和密文膨胀率不高。采用C++语言对该方案进行了实验实现。通过对大量比特流的加解密实验得到的平均误码率、密文膨胀率与理论分析相符合;与基于二次剩余的可否认加密方案进行对比,本方案在抗量子攻击上有着明显优势,加密效率提高了70%,密文膨胀率约减小了3倍。

英文摘要

Deniable encryption is an intriguing scheme against the problem of information leakage caused by adversary coercion. Previously proposed deniable schemes cannot resist the attack of quantum computers and there are few implementations of these schemes. Aiming at this problem, a deniable encryption scheme based on learning with errors (LWE) and related implementations were proposed. The scheme can resist the quantum attack, and also can deny the plaintext to any fake plaintext, so that the sender can resist the adversary's coercive attack. Firstly, by using the indistinguishability of the LWE problem, a subset with low density named "translucent set" was constructed in a uniform space. The "translucent set" was used to construct the ciphertexts of bits 0 and 1, which enabled one-way deniability of a single bit and reduced the error rate. Then, a plaintext coding method was proposed to realize two-way deniability of a single bit so that the sender could deny the original plaintext to any fake plaintext. The theoretical analyses were given to show the deniability, security (IND-CPA), correctness, complexity and ciphertext expansion rate of the scheme. Finally, the scheme was implemented by C++, and experiments had been done for the error rate, ciphertext expansion rate, encryption and decryption efficiency. The experimental results showed that the error rate and ciphertext expansion rate were consistent with the theoretical results. Compared with other deniable schemes based on the quadratic residual problem, the proposed scheme has obvious advantages in anti-quantum attack, efficiency and ciphertext expansion rate. Specifically, the encryption efficiency is improved by 70%, and the ciphertext expansion rate is reduced to 1/3 of above schemes.

关闭

Copyright © 2020四川大学期刊社 版权所有.

地址:成都市一环路南一段24号

邮编:610065