摘要
目前已有文献给出了uBlock分组密码算法的侧信道防护方案,但是这些方案不仅延迟较高,难以适用于低延迟高吞吐场景,而且在毛刺探测模型下缺乏可证明安全性.针对这一问题,本文给出了在毛刺探测模型下具有可证明安全性的uBlock算法的低延迟门限实现方案.此外,我们引入了Changing of the Guards技术来避免防护方案在执行过程中需要额外随机数.对于防护方案的安全性,我们用自动化评估工具SILVER验证了S盒的毛刺探测安全性,并用泄露评估技术TVLA(Test Vector Leakage Assessment)验证了防护方案的整个电路的安全性.最后,我们用Design Compiler工具对防护方案的性能消耗情况进行了评估.评估结果显示,与序列化实现方式的uBlock防护方案相比,我们的防护方案的延迟能够减少约95%.
The existing side-channel protection schemes for the uBlock algorithm suffer from high latency,making them unsuitable for low-latency and high-throughput scenarios.Additionally,these schemes lack provable security under the glitch-extended probing model.To address these issues,this paper presents a low-latency Threshold Implementation of the uBlock algorithm with provable security under the glitch-extended probing model.Furthermore,we introduce the Changing of the Guards technique to eliminate the need for additional random numbers during the execution of the protec⁃tion scheme.To validate the security of our protection scheme,we employ the automated evaluation tool SILVER to assess the glitch-extended probing security of the S-box and utilize the leakage evaluation technology TVLA(Test Vector Leakage Assessment)to verify the security of the entire circuit.Finally,we evaluate the performance overhead of our protection scheme using the design compiler tool.The evaluation results demonstrate that our scheme achieves a significant reduction in latency,approximately 95%less compared to serialized implementations of uBlock protection schemes.
作者
姚富
陈华
范丽敏
YAO Fu;CHEN Hua;FAN Li-min(Trusted Computing and Information Assurance Laboratory,Institute of Software,Chinese Academy of Sciences,Beijing 100190,China;University of Chinese Academy of Sciences,Beijing 100049,China)
出处
《电子学报》
EI
CAS
CSCD
北大核心
2024年第4期1250-1259,共10页
Acta Electronica Sinica
基金
国家自然科学基金(No.62172395)。
