At CRYPTO 2012,Zhandry developed generic semi-constant oracle technique and proved security of an identity-based encryption scheme,GPV-IBE,and full domain hash(FDH)signature scheme in the quantum random oracle model(QROM).However,the reduction provided by Zhandry incurred a quadratic reduction loss.This study provides a much tighter proof,with linear reduction loss,for the FDH,probabilistic FDH(PFDH),and GPV-IBE in the QROM.The proof is based on the measure-and-reprogram technique developed by Don et al.A security proof is also given for the deterministic hash-and-sign in the QROM,assuming the underlying PSF is non-invertible.This result can be applied to the deterministic version of FALCON and its variants.
Physically unclonable function (PUF) can be applied as a lightweight way to improve the security of Internet of Thing (IoT) devices. In the existing PUF studies, reconfigurable Pico-PUF (RPPUF) is an effective solution with good uniqueness and reliability. However, it still has a limited key space and requires extra hardware resources to generate more challenge-response pairs (CRPs). Therefore, this paper improves the RPPUF and proposes a lightweight XOR-based Pico-PUF, namely XORPPUF. By replacing each NOT gate in the configurable logic with an XOR gate, the key space is effectively expanded while preserving the PUF performance. We have implemented and verified the proposed XORPPUF on Xilinx Spartan-6 XC6SLX25 microboards. The experimental results show that XORPPUF achieves 40.06% uniqueness and 99.49% temperature reliability. Compared with the RPPUF, our work improves temperature reliability by 0.26%, expands key space by 2 n , and reduces hardware resources overhead by 11.3% when generating a 128-bit PUF response. In addition, the prediction rate of our XORPPUF against Decision Tree (DT) and Random Forest (RF)-based modeling attacks is 34.17% and 39.40% lower than RPPUF, respectively. This means XORPPUF performs better resistant than RPPUF in Machine Learning (ML) attack. Thus, it is more suitable for securing the IoT devices with limited resources.
This paper considers the construction of resilient Boolean functions on an odd number of variables with strictly almost optimal (SAO) nonlinearity. Through introducing the fragmentary Walsh transform, a construction technique called "High-Meets-Low" is proposed. The detailed design procedures of a 39-variable 3-resilient Boolean function with SAO nonlinearity 2(38) - 2(19) + 2(16) + 2(14) are given. It is shown that the nonlinearity of an n-variable t-resilient Boolean function can reach 2(n-1)-2((n-1)/2)+5.2((n-11)/2) or 2(n-1)-2((n-1)/2)+2((n-7)/2), which are the largest known values for the corresponding n and t values. Finally, by constructing a 29-variable balanced Boolean function with SAO nonlinearity 2(28)-2(14)+2(10) + 2(9), we show an alternative method to realize the High-Meets-Low construction technique.
本文是首篇对开源密码软件供应链安全问题进行调研、分析和总结的综述文章.首先,通过梳理和分析关于开源软件供应链、加密算法等相关领域文献,探讨了开源软件供应链与开源密码软件供应链的差异,明确了开源密码软件供应链的研究范围;其次,以密码软件供应链典型安全事件作为切入点,构建了开源密码软件供应链风险模型;再次,针对梳理出来的各类安全风险,横向参考了实体供应链风险管理成熟案例以及开源密码软件的风险应对措施,总结了开源密码软件供应链的安全风险防控手段.最后,指出了开源密码软件供应链领域所面临的挑战和机遇,并指出了未来的研究方向.
针对侧信道攻击,研究者们通常采用隐藏技术和掩码技术来进行防护,本文提出了 一类基于不可区分混淆的新型侧信道防护方案,通过对一种用于仿射行列式程序的不可区分混淆方案进行改进,将不可区分混淆与侧信道防护结合在一起,并将其应用于区块链分层确定性钱包BIP-0032的嵌入式设备场景中,对该协议中用到的SHA-2哈希算法进行了抗侧信道攻击的不可区分混淆.通过对应用场景的测试和采集的功耗曲线进行 Welch's t-test,验证了该方案的高效性和安全性.已有的不可区分混淆虽然在理论上存在,但运行代价过高,无法实际应用于真实场景中.本文有效地将不可区分混淆应用在现实的侧信道防护中,在保证安全性的同时还兼顾了效率.相对于传统的侧信道防护方法,减少了随机数的使用且有着良好的效率和可维护性,给目前的侧信道防护研究提供了一种新的思路.
