Probabilistic Polynomial-Time Semantics for a Protocol Security Logic-Reference-Cited by-同舟云学术

Probabilistic Polynomial-Time Semantics for a Protocol Security Logic

Published:2005 Issue: Volume: Page:16-29
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Datta Anupam,Derek Ante,Mitchell John C.,Shmatikov Vitaly,Turuani Mathieu

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11523468_2.pdf

Reference18 articles.

1. Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology 15(2), 103–127 (2002)

2. Backes, M., Datta, A., Derek, A., Mitchell, J.C., Turuani, M.: Compositional analysis of contract signing protocols. In: Proceedings of 18th IEEE Computer Security Foundations Workshop. IEEE, Los Alamitos (2005) (to appear)

3. Backes, M., Pfitzmann, B., Waidner, M.: A universally composable cryptographic library. Cryptology ePrint Archive, Report 2003/015 (2003)

4. Lecture Notes in Computer Science;M. Bellare,2000

5. Lecture Notes in Computer Science;M. Bellare,1994

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantum-Secure N2N Authentication Protocol Model for IoT Sensor Networks;Arabian Journal for Science and Engineering;2023-09-14

2. An Epistemic Foundation for Authentication Logics (Extended Abstract);Electronic Proceedings in Theoretical Computer Science;2017-07-25

3. From qualitative to quantitative proofs of security properties using first-order conditional logic1;Journal of Computer Security;2017-03-16

4. The Foundational Cryptography Framework;Lecture Notes in Computer Science;2015

5. Less is more: relaxed yet composable security notions for key exchange;International Journal of Information Security;2013-03-16