当前位置: X-MOL 学术Comput. Netw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Schnorr-like identification scheme resistant to malicious subliminal setting of ephemeral secret
Computer Networks ( IF 5.6 ) Pub Date : 2020-06-02 , DOI: 10.1016/j.comnet.2020.107346
Łukasz Krzywiecki , Adam Bobowski , Marta Słowik , Marcin Słowik , Patryk Kozieł

In this paper we analyze security of Schnorr Identification Scheme (IS) against subliminal setting of ephemeral secrets. We introduce a new strong security model, which allows the adversary to learn or set ephemeral values on the side of the prover. In this model, we define an IS scheme to be secure, if such an adversary, playing role of a verifier, cannot later impersonate the prover. The model primarily reflects a scenario, where the random number generator used for ephemeral secrets has been maliciously implemented or integrated. After showing that the original Schnorr IS is not secure in our model, we propose a modification, immune to such malicious activity. We prove the security of the modified construction in our new strong model. To prove the construction is practical, we provide an implementation and performance comparison with the original construction.



中文翻译:

类似于Schnorr的身份识别方案,可抵抗恶意的潜伏期潜伏背景

在本文中,我们分析了Schnorr身份识别方案)反对暂时的秘密秘密设定。我们引入了一种新的强大安全模型,该模型允许对手学习或设置证明者方面的短暂值。在此模型中,我们定义了这种方案是安全的,如果这样的对手扮演了验证者的角色,以后就无法模仿证明者。该模型主要反映了一种场景,其中用于临时密钥的随机数生成器已被恶意实现或集成。证明原来的施诺尔在我们的模型中并不安全,因此我们建议进行修改,以免受到此类恶意活动的侵害。我们在新的强模型中证明了修改后的结构的安全性。为了证明该构造是可行的,我们提供了与原始构造的实现和性能比较。

更新日期:2020-06-27
down
wechat
bug