Autonomic dysfunction in RBD – What can it teach us about disease progression?

详细信息    查看全文

• 作者：Ronald B. Postuma ; Jean-Francois Gagnon ; Jacques Montplaisir
• 关键词：Symbolic cryptography ; Protocol verification ; Abadi– ; Rogaway logic ; Dolev– ; Yao model ; Oracle hashing
• 刊名：Sleep Medicine
• 出版年：2008
• 出版时间：July 2008
• 年：2008
• 卷：9
• 期：5
• 页码：473-474
• 全文大小：62 K

文摘

This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known Abadi–Rogaway logic with probabilistic hashes and give a precise semantic interpretation to it using Canetti’s oracle hashes. These are probabilistic polynomial-time hashes that hide all partial information. We show that, under appropriate conditions on the encryption scheme, this interpretation is computationally sound and complete. This can be used to port security results from the formal world to the computational world when considering passive adversaries. We also give an explicit example showing that oracle hashing is not strong enough to obtain such a result for active adversaries.