A composable computational soundness notion

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2011, Pages 63-74

  Cortier, Véronique ^a   Warinschi, Bogdan ^b  

^a LORIA   (France)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Composability; Computational soundness

Indexed keywords

ASYMMETRIC ENCRYPTION; COMPOSABILITY; COMPUTATIONAL ADVERSARIES; COMPUTATIONAL SECURITY; COMPUTATIONAL SOUNDNESS; CRYPTOGRAPHIC PRIMITIVES; MODULAR EXTENSION; PROTOCOL SPECIFICATIONS;

CRYPTOGRAPHY; SPECIFICATION LANGUAGES;

SECURITY OF DATA;

EID: 80755169513     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2046707.2046717     Document Type: Conference Paper

References (20)

1. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002.
2. A. Armando, R. Carbone, L. Compagna, J. Cuellar, and L. T. Abad. Formal analysis of saml 2.0 web browser single sign-on: Breaking the saml-based single sign-on for google apps. In Proceedings f the 6th ACM Workshop on Formal Methods in Security Engineering (FMSE 2008), pages 1-10, 2008.
3. M. Backes, D. Hofheinz, and D. Unruh. Cosp: A general framework for computational soundness proofs. In ACM CCS 2009, pages 66-78, November 2009. Preprint on IACR ePrint 2009/080.
4. M. Backes and B. Pfitzmann. Symmetric encryption in a simulatable Dolev-Yao style cryptographic library. In Proc. 17th IEEE Computer Science Foundations Workshop (CSFW'04), pages 204-218, 2004.
5. M. Backes, B. Pfitzmann, and M. Waidner. A composable cryptographic library with nested operations. In Proc. 10th ACM Conference on Computer and Communications Security (CCS'03), 2003.
6. M. Backes and D. Unruh. Computational soundness of symbolic zero-knowledge proofs against active attackers. In Proceedings of the 21st IEEE Computer Security Foundations Symposium (CSF'08), pages 255-269, Pittsburgh, PA, USA, June 2008. IEEE Computer Society Press.
7. R. Canetti. Universally composable signature, certification, and authentication. In Proc. 17th IEEE Computer Security Foundations Workshop (CSFW'04), pages 219-235, 2004.
8. R. Canetti and J. Herzog. Universally composable symbolic analysis of mutual authentication and key-exchange protocols (extended abstract). In Proc. 3rd Theory of Cryptography Conference (TCC'06), volume 3876 of LNCS, pages 380-403. Springer, 2006. (Pubitemid 43979859)
9. H. Comon-Lundh and V. Cortier. Computational soundness of observational equivalence. In Proceedings of the 15th ACM Conference on Computer and Communications Security (CCS'08), Alexandria, Virginia, USA, Oct. 2008. ACM Press.
10. H. Comon-Lundh and V. Cortier. How to prove security of communication protocolsň A discussion on the soundness of formal models w.r.t. computational ones. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), volume 9 of Leibniz International Proceedings in Informatics (LIPIcs), pages 29-44, 2011.
11. V. Cortier, S. Kremer, R. Küsters, and B. Warinschi. Computationally sound symbolic secrecy in the presence of hash functions. In Proceedings of the 26th Conference on Fundations of Software Technology and Theoretical Computer Science (FSTTCS'06), volume 4337 of LNCS, pages 176-187, Kolkata, India, 2006. Springer.
12. V. Cortier, S. Kremer, and B. Warinschi. A survey of symbolic methods in computational analysis of cryptographic systems. J. Autom. Reasoning, 46(3-4):225-259, 2011.
13. V. Cortier and B. Warinschi. Computationally sound, automated proofs for security protocols. In European Symposium on Programming (ESOP'05), volume 3444 of LNCS, pages 157-171, Edinburgh, UK, 2005. Springer. (Pubitemid 41274056)
14. D. Galindo, F. D. Garcia, and P. van Rossum. Computational soundness of non-malleable commitments. In Proc. 4th Information Security Practice and Experience Conference (ISPEC'08), LNCS, 2008. To appear.
15. J. Herzog. A computational interpretation of Dolev-Yao adversaries. Theoretical C om puter Science, 340:57-81, June 2005. (Pubitemid 40654648)
16. R. Janvier, Y. Lakhnech, and L. Mazaré. Completing the picture: Soundness of formal encryption in the presence of active adversaries. In European Symposium on Programming (ESOP'05), volume 3444 of LNCS, pages 172-185. Springer, 2005. (Pubitemid 41274057)
17. R. Janvier, Y. Lakhnech, and L. Mazaré. Computational soundness of symbolic analysis for protocols using hash functions. In Proceedings of the Workshop on Information and Computer Security (ICS'06), Electronic Notes in Theoretical Computer Science, Timisoara, Romania, Sept. 2006. Elsevier Science Publishers.
18. R. Küsters and M. Tuengerthal. Computational Soundness for Key Exchange Protocols with Symmetric Encryption. In E. Al-Shaer, S. Jha, and A. D. Keromytis, editors, Proceedings of the 16th ACM Conference on Computer and Communications Security (CCS 2009), pages 91-100. ACM Press, 2009.
19. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), volume 1055 of LNCS, pages 147-166. Springer-Verlag, March 1996. (Pubitemid 126050413)
20. D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference (TCC'04), volume 2951 of LNCS, pages 133-151. Springer, 2004.