Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption
ACM Trans. Comput. Log.（2008）
摘要
We show that the insecurity problem for protocols with modular exponentiation and arbitrary products allowed in exponents is NP-complete. This result is based on a protocol and intruder model which is powerful enough to uncover known attacks on the Authenticated Group Diffie-Hellman (A-GDH.2) protocol suite. To prove our results, we develop a general framework in which the Dolev-Yao intruder is extended by generic intruder rules. This framework is also applied to obtain complexity results for protocols with commuting public key encryption.
更多查看译文
关键词
dolev-yao intruder,complexity,categories and subject descriptors: : computer security general terms: security protocols,general framework,diffie-hellman exponentiation,verification additional key words and phrases: algebraic properties,security protocol,arbitrary product,insecurity problem,modular exponentiation,complexity result,die- hellman exponentiation,protocol suite,dolev-yao model,generic intruder rule,intruder model,authenticated group diffie-hellman,public key encryption,computer security,diffie hellman,protocols
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要