Fully automated analysis of padding-based encryption in the computational model

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2013, Pages 1247-1259

  Barthe, Gilles ^a   Crespo, Juan Manuel ^a   Grégoire, Benjamin ^b   Kunz, César ^a   Lakhnech, Yassine ^c   Schmidt, Benedikt ^a   Zanella Béguelin, Santiago ^d  

^a IMDEA SOFTWARE INSTITUTE   (Spain)

^b INRIA   (France)

^c VERIMAG   (France)

^d MICROSOFT RESEARCH   (United Kingdom)

Author keywords

attack finding; automated proofs; provable security; public key encryption; static equivalence

Indexed keywords

ATTACK FINDING; AUTOMATED PROOFS; PROVABLE SECURITY; PUBLIC-KEY ENCRYPTION; STATIC EQUIVALENCE;

AUTOMATION; COMPUTER AIDED ANALYSIS; HASH FUNCTIONS; PUBLIC KEY CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 84889002380     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2508859.2516663     Document Type: Conference Paper

References (31)

1. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In 28th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, POPL 2001, pages 104-115, 2001. ACM.
2. M. Abadi and P. Rogaway. Reconciling two views of cryptography (The computational soundness of formal encryption). J. Cryptology, 15(2):103-127, 2002.
3. G. Bana and H. Comon-Lundh. Towards unconditional soundness: Computationally complete symbolic attacker. In 1st Conference on Principles of Security and Trust - POST 2012, volume 7215 of LNCS, pages 189-208, 2012. Springer.
4. G. Barthe, B. Grégoire, S. Heraud, and S. Zanella-Béguelin. Computer-aided security proofs for the working cryptographer. In Advances in Cryptology - CRYPTO 2011, volume 6841 of LNCS, pages 71-90, 2011. Springer.
5. G. Barthe, B. Grégoire, Y. Lakhnech, and S. Zanella- Béguelin. Beyond provable security. Verifiable INDCCA security of OAEP. In Topics in Cryptology - CTRSA 2011, volume 6558 of LNCS, pages 180-196, 2011. Springer.
6. G. Barthe, J. M. Crespo, B. Grégoire, C. Kunz, Y. Lakhnech, B. Schmidt, and S. Zanella-Béguelin. Fully automated analysis of padding-based encryption in the computational model. Cryptology ePrint Archive, Report 2012/695.
7. G. Barthe, D. Pointcheval, and S. Zanella-Béguelin. Verified security of redundancy-free encryption from Rabin and RSA. In 19th ACM Conference on Computer and Communications Security, CCS 2012, pages 724-735, 2012. ACM.
8. M. Baudet, V. Cortier, and S. Delaune. Yapa: A generic tool for computing intruder knowledge. In Rewriting Techniques and Applications, pages 148-163, 2009. Springer.
9. M. Baudet, V. Cortier, and S. Kremer. Computationally sound implementations of equational theories against passive adversaries. Inf. Comput., 207(4):496-520, 2009.
10. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In 1st ACM Conference on Computer and Communications Security, CCS 1993, pages 62-73, 1993. ACM.
11. M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology - EUROCRYPT 1994, volume 950 of LNCS, pages 92-111, 1994. Springer.
12. B. Blanchet. A computationally sound mechanized prover for security protocols. In 27th IEEE Symposium on Security and Privacy, S&P 2006, pages 140-154. IEEE Computer Society, 2006.
13. B. Blanchet. Security protocol verification: Symbolic and computational models. In 1st International Conference on Principles of Security and Trust, POST 2012, volume 7215 of LNCS, pages 3-29, 2012. Springer.
14. D. Boneh. Simplified OAEP for the RSA and Rabin functions. In Advances in Cryptology - CRYPTO 2001, volume 2139 of LNCS, pages 275-291, 2001. Springer.
15. Ş. Ciobâcǎ, S. Delaune, and S. Kremer. Computing knowledge in security protocols under convergent equational theories. In Automated Deduction-CADE-22, pages 355-370. Springer, 2009.
16. J.-S. Coron, M. Joye, D. Naccache, and P. Paillier. Universal padding schemes for RSA. In Advances in Cryptology - CRYPTO 2002, volume 2442 of LNCS, pages 226-241, 2002. Springer.
17. 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.
18. J. Courant, M. Daubignard, C. Ene, P. Lafourcade, and Y. Lakhnech. Towards automated proofs for asymmetric encryption schemes in the random oracle model. In 15th ACM Conference on Computer and Communications Security, CCS 2008, pages 371-380, 2008. ACM.
19. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
20. E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern. RSA-OAEP is secure under the RSA assumption. J. Cryptology, 17(2):81-104, 2004.
21. S. Goldwasser and S. Micali. Probabilistic encryption. J. Comput. Syst. Sci., 28(2):270-299, 1984.
22. R. Impagliazzo and B. M. Kapron. Logics for reasoning about cryptographic constructions. J. Comput. Syst. Sci., 72(2):286-320, 2006.
23. T. Kleinjung, K. Aoki, J. Franke, A. Lenstra, E. Thomé, J. Bos, P. Gaudry, A. Kruppa, P. Montgomery, D. Osvik, H. te Riele, A. Timofeev, and P. Zimmermann. Factorization of a 768-bit RSA modulus. In Advances in Cryptology - CRYPTO 2010, volume 6223 of LNCS, pages 333-350, 2010. Springer.
24. Y. Komano and K. Ohta. Taxonomical security consideration of OAEP variants. IEICE Transactions, E89-A (5):1233-1245, 2006.
25. A. K. Lenstra and E. R. Verheul. Selecting cryptographic key sizes. J. Cryptology, 14(4):255-293, 2001.
26. T. Okamoto and D. Pointcheval. The gap-problems: A new class of problems for the security of cryptographic schemes. In 4th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2001, volume 1992 of LNCS, pages 104-118, 2001. Springer.
27. A. Perrig and D. Song. Looking for diamonds in the desert - extending automatic protocol generation to three-party authentication and key agreement protocols. In 13th IEEE Workshop on Computer Security Foundations, CSFW 2000, pages 64-76, 2000. IEEE Computer Society.
28. A. Roy, A. Datta, A. Derek, and J. C. Mitchell. Inductive trace properties for computational security. Journal of Computer Security, 18(6):1035-1073, 2010.
29. V. Shoup. Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004/332.
30. D. Unruh. The impossibility of computationally sound XOR. Cryptology ePrint Archive, Report 2010/389.
31. Y. Zheng and J. Seberry. Practical approaches to attaining security against adaptively chosen ciphertext attacks. In Advances in Cryptology - CRYPTO 1992, volume 740 of LNCS, pages 292-304, 1993. Springer.