入侵者用否定推理约束。安全服务组合的可判定性及其应用
Intruder deducibility constraints with negation. Decidability and application to secured service compositions
摘要:
在我们以前的工作中,找到一个调解人组成安全服务的问题已经减少到解决演绎约束的问题,类似于那些用于加密协议分析。在本文中,我们扩展了调解人的合成过程中的建设表示,有些数据是不可访问的调解人。然后,我们给出了一个决策过程,验证了一个调解人满足此不披露政策可以有效地合成。该过程已在我们的协议分析工具CL-AtSe中实现。该过程扩展了约束求解的密码协议分析的一个有意义的方式,因为它能够处理负演绎约束没有限制。特别是它适用于所有子项收敛理论,因此涵盖了形式安全分析中的几个有趣的理论,包括加密,哈希,签名和配对。
英文摘要:
The problem of finding a mediator to compose secured services has been reduced in our former work to the problem of solving deducibility constraints similar to those employed for cryptographic protocol analysis. We extend in this paper the mediator synthesis procedure by a construction for expressing that some data is not accessible to the mediator. Then we give a decision procedure for verifying that a mediator satisfying this non-disclosure policy can be effectively synthesized. This procedure has been implemented in CL-AtSe, our protocol analysis tool. The procedure extends constraint solving for cryptographic protocol analysis in a significative way as it is able to handle negative deducibility constraints without restriction. In particular it applies to all subterm convergent theories and therefore covers several interesting theories in formal security analysis including encryption, hashing, signature and pairing.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。