新的不使用冗余和Hash的安全认证加密方案

最近提出的一类新的认证加密方案首次将消息可恢复签名和对称加密有机结合,而且不需要使用Hash函数或Redundancy函数。但分析发现该方案不具有数字签名所要求的基本条件,不能抵抗消息接收者的伪造攻击。为此提出了一种新的认证加密方案,该方案的安全性以求解离散对数难题和双重模难题为基础,而且可以在发生纠纷时将认证加密的签名转化为普通的签名,任何人都可以验证签名的有效性。     

一种基于身份的认证加密方案的改进

基于身份加密是一种以用户的身份标识符作为公钥的加密体制。通过分析现有的基于身份的认证加密方案,针对其中存在的用户不能防止自身假冒其他用户发送消息给自己,即不能认证信息主体的真实性的安全隐患,结合双线性映射的特性,提出了改进方案。新方案的安全性是基于双线性Diffie-Hellman问题的,并对改进方案的安全性和效率进行了分析。结果表明,改进方案保持了原方案优点的同时,消除了隐患,进一步提高了安全性。     

代理可转换认证加密方案

结合代理签名和可转换认证加密两种方案,提出了代理可转换认证加密方案和(t,n)门限代理方案。方案能够使一个代理人代理被代理人认证加密一个消息给某个特定的接收者。     

支持等式测试的身份基可否认认证加密方案及其在电子投票系统的应用CSCD

电子投票系统被认为是现代生活中高效提供政府服务和进一步加强民主活力的方法。但是,现有构建电子投票系统的方法存在以下问题:第一,在面临贿选及胁迫的压力时,选民无法无视外在压力独立投票。其次,审计投票结果的实体可以在审计的同时获知有关投票内容的额外信息。为了解决上述两个问题,我们首次将可否认认证加密技术与身份基等式测试加密技术相结合,提出了一种支持等式测试的身份基可否认认证加密方案。该方案可以在第三方服务器不解密的情况下提供密文可比性,还能保证接收方验证发送方的身份的同时,不能向第三方证明信息来自发送方,从而保护发送方的隐私。该方案利用可否认认证加密技术在技术层面保证了选民独立投票的能力,并额外增加了身份基下的等式测试功能以确保审计机构在逻辑结构上拥有访问权限。在使用本方案的电子投票系统中,审计机构在审计投票结果的同时,不获得有关选票的任何其他信息。我们证明了我们的方案在随机预言模型中是安全的,并且可以在电子投票系统中确保不可胁迫性和可审计性。该方案与已有相关方案相比,在开销和安全性能均有较好表现的同时,实现了更为丰富的功能。此外,我们使用所提出的密码学方案设计了一个安全的电子投票系统,其安全特性可以很好地保护电子投票系统中的选民自由和公平性。     

基于AES轮函数认证加密算法研究与设计

认证加密算法同时保证信息的机密性和完整性,在信息安全领域具有广泛的应用前景。利用混合整数线性规划方法,搜索高效且最小活跃S盒较多的迭代结构,基于AES轮函数和广义Feistel结构设计底层的轮函数,实现了一个基于 AES 轮函数的认证加密算法。该认证加密算法具有抵抗碰撞攻击、差分攻击、线性攻击等攻击的能力,且效率是原有认证加密算法AES-GCM的两倍。     

General classification of the authenticated encryption schemes for the CAESAR competition

An authenticated encryption scheme is a scheme which provides privacy and integrity by using a secret key. In 2013, CAESAR (the “Competition for Authenticated Encryption: Security, Applicability, and Robustness”) was co-founded by NIST and Dan Bernstein with the aim of finding authenticated encryption schemes that offer advantages over AES-GCM and are suitable for widespread adoption. The first round started with 57 candidates in March 2014; and nine of these first-round candidates were broken and withdrawn from the competition. The remaining 48 candidates went through an intense process of review, analysis and comparison. While the cryptographic community benefits greatly from the manifold different submission designs, their sheer number implies a challenging amount of study. This paper provides an easy-to-grasp overview over functional aspects, security parameters, and robustness offerings by the CAESAR candidates, clustered by their underlying designs (block-cipher-, stream-cipher-, permutation-/sponge-, compression-function-based, dedicated). After intensive review and analysis of all 48 candidates by the community, the CAESAR committee selected only 30 candidates for the second round. The announcement for the third round candidates was made on 15th August 2016 and 15 candidates were chosen for the third round.     

LAC认证加密的伪造攻击及其改进

针对认证加密算法在设计中出现的一些不足,尤其是近年兴起的CAESAR竞赛征集算法,介绍了两种伪造攻击的手段,通过对破坏密文的完整性,达到欺骗认证者的目的。以LAC候选算法为例,通过伪造攻击的方法,对其内部结构、认证机制和攻击原理进行了分析和描述,并对其原有结构进行了改进,使其能够有效的抵抗现有的伪造攻击。通过对其安全性进行了分析,表明LAC算法改进方案能够有效抵抗伪造攻击。     

一个基于身份的密钥隔离认证密钥协商协议

鉴于目前已有的基于身份的认证密钥协商协议都未考虑后向安全性,结合密钥进化的思想,利用椭圆曲线加法群提出了一个基于身份的密钥隔离认证密钥协商协议.协议去除了双线性对运算,效率比基于双线性对构造的基于身份的协议有较大提高;协议不仅满足目前已知的所有针对认证密钥协商协议的安全性要求,而且还满足后向安全性.     

ZUC-256流密码轻量级硬件设计与实现

ZUC-256是由中国开发的一种应对于5G通信和量子计算机的流密码,该算法主要包含ZUC-256流密码和一种基于该流密码的完整性算法（EIA3）。本文设计了2种不同的ZUC-256流密码轻量级电路结构,以及1种基于ZUC-256流密码的EIA3算法结构。基于FPGA对设计的电路结构和算法结构进行实现,并进行了性能对比。对比结果表明：本文设计的2种电路结构最高达到了6.72 Gb/s的吞吐率,相较于现有的ZUC-256电路设计在速度上提高了45.24%;本文设计的2种电路相较于之前的ZUC-128占用资源更少,在面积上分别减少38.48%和30.90%;本文设计的EIA3算法结构仅用0.71 μs即可对128位的数据进行加密。     

The offset codebook (OCB) block cipher mode of operation for authenticated encryption

This article presents an overview of the concepts of and motivation for the OCB block cipher mode of operation. OCB is well suited for IoT, wireless, and other constrained devices where processing time and energy consumption are design issues. The article describes two versions of the OCB algorithm (OCB1 and OCB3) that have been widely accepted.     

Bio-PUF-MAC authenticated encryption for iris biometrics

Biometrics is one of the ways for human authentication. Fabrication of biometrics by intruders, limits the accuracy of authentication. The user-specific keys (ie,) pseudo-random numbers give more security for biometric template protection and increase the accuracy of authentication also. The user-specific token or keys can also be fabricated by intruders by any of the prediction methods. To avoid the creation of fake biometric and fake user-specific keys, a device-specific Physical Unclonable Function (PUF) is proposed. In this article, iris authentication is provided by unclonable PUF-based true random numbers to enhance the unique authentication. Nonreversible Message Authentication Codes (MAC) are developed using PUF and Discrete Wavelet Transform features of iris biometrics. Systematically, MAC codes also created with, encryption algorithm. Encryption is additionally providing confidentiality in the individual iris. Experiments are done with CUHK Iris Image Dataset. Proposed Bio-PUF system has significant functional advantages in point of view of the unclonable pseudo-random number from PUF. Experimentally, Avalanche effect, entropy, NCPR, and UACI parameters are analyzed with PUF-based crypt functions. For 75% of matching with the Bio-PUF-MAC codes with enrolment, the accuracy for correct identification is 77.73%.     

Improved convertible authenticated encryption scheme with provable security

Convertible authenticated encryption (CAE) schemes allow a signer to produce an authenticated ciphertext such that only a designated recipient can decrypt it and verify the recovered signature. The conversion property further enables the designated recipient to reveal an ordinary signature for dealing with a later dispute over repudiation. Based on the ElGamal cryptosystem, in 2009, Lee et al. proposed a CAE scheme with only heuristic security analyses. In this paper, we will demonstrate that their scheme is vulnerable to the chosen-plaintext attack and then further propose an improved variant. Additionally, in the random oracle model, we prove that the improved scheme achieves confidentiality against indistinguishability under adaptive chosen-ciphertext attacks (IND-CCA2) and unforgeability against existential forgery under adaptive chosen-message attacks (EF-CMA).     

基于分组密码的认证加密工作模式

近年来认证加密工作模式的研究迅速发展,提出适应各行各业、性能优秀、安全性好、成本低廉且结构简单的认证加密模式已成为必然趋势。基于分组密码的认证加密工作模式是使用分组密码来设计,用以解决用户信息的隐私性和真实性等实际问题的密码方案。由于其具有实现速度快、易于标准化和便于软硬件实现等特点,广泛使用于计算机通信和信息安全等领域。文章主要介绍了基于分组密码的认证加密工作模式及其发展前景。     

An Anti-Physical Attack Scheme of ARX Lightweight Algorithms for IoT Applications

The lightweight encryption algorithm based on Add-Rotation-XOR (ARX) operation has attracted much attention due to its high software affinity and fast operation speed. However, lacking an effective defense scheme for physical attacks limits the applications of the ARX algorithm. The critical challenge is how to weaken the direct dependence between the physical information and the secret key of the algorithm at a low cost. This study attempts to explore how to improve its physical security in practical application scenarios by analyzing the masking countermeasures of ARX algorithms and the leakage causes. Firstly, we specify a hierarchical security framework by quantitatively evaluating the indicators based on side-channel attacks. Then, optimize the masking algorithm to achieve a trade-off balance by leveraging the software-based local masking strategies and non-full-round masking strategies. Finally, refactor the assembly instruction to improve the leaks by exploring the leakage cause at assembly instruction. To illustrate the feasibility of the proposed scheme, we further conducted a case study by designing a software-based masking method for Chaskey. The experimental results show that the proposed method can effectively weaken the impact of physical attacks.     

可重构加密引擎设计及FPGA实现

针对网络安全加密系统中安全能力弱、开发成本高和实时能力差等问题,提出了一种基于FPGA的可重构加密引擎的设计方案,在详细论述了该加密引擎的总体设计结构的基础上,分析了FPGA实现中关键技术的解决方法。通过实验仿真表明：该引擎可以有效地提高FPGA器件的可重构性能,可重构资源比可以达到0.78,因此,该引擎在今后的嵌入式安全产品开发方面具有很好的速度和可重构应用前景。     

一种轻量级的雾计算属性基外包加密算法

为减少属性基加密算法占用的资源,在安全数据访问控制的属性基加密算法的基础上提出了一种改进的属性基外包加密算法。改进算法将加密算法中的复杂双线性对计算外包给雾节点以减少用户的计算开销;同时通过简化系统参数,减少属性中心为属性生成的随机因子以缩短密文和密钥长度,降低了用户和雾节点的存储和通信开销。同时对提出的改进算法进行了安全性证明,证明了该改进算法是安全的。     

轻量化神经网络加速器的设计与实现

针对以MobileNet为代表的轻量化卷积网络,基于现场可编程门阵列平台设计网络加速器。通过优化DW、PW轻量化模块并实现常用的卷积、ReLU等功能模块,满足神经网络加速器低功耗、低时延的要求,同时基于指令设计使加速器支持MobileNet及各类变种。利用上位机配置YoloV3 tiny（不含轻量模块）指令和YoloV3&MobileNet（含轻量模块）指令进行目标检测,实验结果表明,该网络加速器具有较快的推断速度,用于YoloV3 tiny结构时达到85 frame/s,用于YoloV3&MobileNet结构时达到62 frame/s。     

基于云计算的文件加密传输方法

本文提出了在云计算环境下,采用一种安全单钥管理技术,来解决轻量级密码的对称密钥快速交换难题,在云用户的客户机端智能卡芯片和云计算平台的认证中心端加密卡芯片里,建立云用户之间的文件快速、安全和完整性验证传输协议,从而,建立基于云计算的信息安全系统。     

基于同态加密策略的电子选举系统

针对电子选举系统的安全性问题,提出了一种基于同态加密策略保护选民隐私的高安全性的电子选举系统设计方案。该系统采用同态加密策略进行选民的投票结果运算,采用非对称密码算法保证数据信息传输过程中的数据安全,保护选民的身份和意愿不被暴露。     

基于嵌入式系统的混沌数字图像加密研究

常用的PC级加密算法运算量过大,不适合在嵌入式设备上运行。为了使嵌入式设备的数据存储及传输能够安全地进行,利用混沌信号对数据进行加密以提高嵌入式设备数据的安全性。在ARM2440+Linux平台上实现了混沌信号生成功能并利用混沌信号对数字图像进行加密的实验,最终生成加密后的一份密文信息。