【摘 要】
：
Although the learning with errors(LWE)-based full homomorphic encryption scheme is the first example of deviation from the original Gentrys blueprint, the scheme did not give detailed conversion proce
【机 构】
：
School of Mathematics and Computing Science,Guangxi Key Laboratory of Cryptography and Information S
【出 处】
：
第九届中国可信计算与信息安全学术会议
论文部分内容阅读
Although the learning with errors(LWE)-based full homomorphic encryption scheme is the first example of deviation from the original Gentrys blueprint, the scheme did not give detailed conversion process of circuit layer structure, and must rely on bootstrapping technique to achieve full homomorphism.
其他文献
针对现有全同态加密方案仅能对用同一密钥加密的密文进行计算的局限性,在Brakerski等人构造的全同态加密方案基础上,利用密钥隐私(Key-private)代理重加密的思想,构造了首个密钥隐私的全同态代理重加密方案,该方案可以使拥有重加密密钥的代理者在不改变明文的情况下,把用Alice的公钥加密后的密文转换为可以用Bob的私钥解密,且代理者无法获知Alice和Bob的身份,同时,根据同态运算的性质
During the last decades, many public key cryptosystems based on non-abelian algebraic structures were proposed, such as cryptosytems based on inner automorphism groups, general linear groups and braid
随着智能卡的广泛应用,智能卡所带来的数据安全性问题越来越受到人们的关注.传统的直接块加密技术、异或加密技术以及置乱加密技术都存在各自的缺点,并不完全适合于智能卡存储器的加密.随着目前轻量级分组密码算法在物联网以及RFID方向上的广泛应用,选择一种加密效率和安全性都较高的轻量级分组密码算法来实现智能卡存储器安全性也成为了必然趋势.
Before going into details we would like to mention that non-abelian algebraic structures have already been used in a cryptographic context.
与传统的公钥加密体制不同,IBE(Identity-Based Encryption)体制[1-10]将用户的身份信息(例如邮箱地址)作为公钥,无需使用公钥证书,也无需建立证书机构,大大减少了公钥加密体制中由分发、维护、撤销证书产生的通信开销.传统IBE方案的安全性均建立在用户私钥不被泄露的基础上,一旦合法用户的私钥被泄露,整个系统的安全也将遭到威胁.为了减少IBE体制中由于私钥泄露带来的安全损失
1984年, Shamir提出了基于身份的签名机制[1].在该体制中,用户可以选取自己的身份作为公钥,私钥由可信的私钥生成中心PKG生成.不过,直到2001年,Boneh和Franklin才设计出第一个真正实用的基于Weil配对的基于身份的加密算法[2].利用基于身份的加密体制,学者们提出了大量的基于身份的认证密钥协商协议.然而,大多数基于身份的认证密钥协商协议[3]-[5]都是在单一PKG环境下
There are a lot of security issues in block cipher algorithm.Security analysis and enhanced design of an dynamic block cipher was proposed.Firstly, the safety of ciphertext was enhanced based on confu
TCX(Transform Coded Excitation) performs encoding non-speech part for the hybrid speech coder, R.Salami and C.Lanamme et al, who first put forward TCX encoding method in 1993, and its application to m
目前,在基于格的PRE和IB-PRE研究方面收获颇丰.在公开发表的文献中,已经设计出了4个基于格的PRE方案和2个基于格的IB-PRE方案,而且这些方案的安全性都能规约到格上LWE(Learning With Errors)困难假设. 2012年,Xagawa[1]利用LWE困难假设构造了第一个PRE方案,但其方案是双向且交互的,即方案需要一个可信机构生成重加密密钥,且需要双方私钥的参与.Yosh
Recently, new precisely cooperative attacks, such as the Coordinated Cross Plane Session Termination (CXPST) attack[1], need thousands of machines to attack diverse links simultaneously with the given