Computationally sound implementations of equational theories against passive adversaries

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 652-663

  Baudet, Mathieu ^a   Cortier, Véronique ^b   Kremer, Steve ^a  

^a CNRS   (France)

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL METHODS; NETWORK PROTOCOLS; SECURITY OF DATA;

ARBITRARY EQUATIONAL THEORY; SECURITY PROTOCOLS; STATIC EQUIVALENCE;

CRYPTOGRAPHY;

EID: 26444541858     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_53     Document Type: Conference Paper

References (14)

1. M. Abadi and V. Cortier. Deciding knowledge in security protocols under equational theories. In Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP'04), volume 3142 of LNCS, pages 46-58, 2004.
2. M. Abadi and C. Fournet. Mobile values, new names, and secure communications. In Proc. 28th Annual ACM Symposium on Principles of Programming Languages (POPL'01), pages 104-115, 2001.
3. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). In Proc. 1st IFIP International Conference on Theoretical Computer Science (IFIP-TCS'00), volume 1872 of LNCS, pages 3-22, 2000.
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. G. Bana. Soundness and Completeness of Formal Logics of Symmetric Encryption. PhD thesis, University of Pennsylvania, 2004.
7. M. Baudet, V. Cortier, and S. Kremer. Computationally sound implementations of equational theories against passive adversaries. Research Report 2005/074, Cryptology ePrint Archive, Mar. 2005. 28 pages.
8. B. Blanchet. Automatic proof of strong secrecy for security protocols. In Proc. 25th IEEE Symposium on Security and Privacy (SSP'04), pages 86-100, 2004.
9. D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT-29(12): 198-208, 1983.
10. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
11. P. Laud. Symmetric encryption in automatic analyses for confidentiality against active adversaries. In Proc. IEEE Symposium on Security and Privacy (SSP'04), pages 71-85, 2004.
12. D. Micciancio and B. Warinschi. Completeness theorems for the Abadi-Rogaway logic of encrypted expressions. Journal of Computer Security, 12(1):99-129, 2004.
13. D.H. Phan and D. Pointcheval. About the security of ciphers (semantic security and pseudorandom permutations). In Proc. Selected Areas in Cryptography (SAC'04), volume 3357 of LNCS, pages 185-200, 2004.
14. R.L. Rivest. On the notion of pseudo-free groups. In Proc. 1st Theory of Cryptography Conference (TCC'04), volume 2951 of LNCS, pages 505-521, 2004.