Computational indistinguishability logic

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2010, Pages 375-386

  Barthe, Gilles ^a   Daubignard, Marion ^b   Kapron, Bruce ^c   Lakhnech, Yassine ^b  

^a IMDEA SOFTWARE INSTITUTE   (Spain)

^b UNIV GRENOBLE ALPES   (France)

^c UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Bisimulation; Determinization; Logic; Provable security; Random oracle; Signature schemes

Indexed keywords

BISIMULATIONS; DETERMINIZATION; LOGIC; PROVABLE SECURITY; RANDOM ORACLE; SIGNATURE SCHEME;

AUTHENTICATION; CRYPTOGRAPHY;

COMPUTATION THEORY;

EID: 78650031443     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1866307.1866350     Document Type: Conference Paper

References (39)

1. Martín Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The spi calculus. Inf. Comput., 148(1):1-70, 1999.
2. Martín Abadi and Philipp Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002.
3. Michael Backes, Mathias Berg, and Dominique Unruh. A formal language for cryptographic pseudocode. In Proceedings of LPAR'08, pages 353-376. Springer-Verlag, 2008.
4. Michael Backes, Birgit Pfitzmann, and Michael Waidner. A composable cryptographic library with nested operations. In Sushil Jajodia, Vijayalakshmi Atluri, and Trent Jaeger, editors, ACM Conference on Computer and Communications Security, pages 220-230. ACM, 2003.
5. Gilles Barthe, Marion Daubignard, Bruce Kapron, Yassine Lakhnech, and Vincent Laporte. Deciding equality of probabilistic terms. In Proceedings of LPAR'10, Lecture Notes in Computer Science. Springer-Verlag, 2010. To appear.
6. Gilles Barthe, Benjamin Grégoire, Yassine Lakhnech, and Santiago Zanella Béguelin. Beyond Provable Security: Verifiable IND-CCA Security of OAEP, 2010. Manuscript
7. Gilles Barthe, Benjamin Grégoire, and Santiago Zanella Béguelin. Formal certification of code-based cryptographic proofs. In Proceedings of OPL'09, pages 90-101. ACM Press, 2009.
8. Mihir Bellare and Philipp Rogaway. The exactsecurity of digital signatures - How to sign with RSA and Rabin. In Proceedings of EUROCRYPT'96, volume 1070 of Lecture Notes in Computer Science, pages 399-416. Springer-Verlag, 1996.
9. Mihir Bellare and Phillip Rogaway. The security of triple encryption and a framework for code-based game-playing proofs. In Proceedings of EUROCRYPT'06, pages 409-426, 2006.
10. Bruno Blanchet. A computationally sound mechanizedprover for security protocols. In IEEE Symposium on Security and Privacy, pages 140-154. IEEE Computer Society, 2006.
11. Bruno Blanchet, Aaron D. Jaggard, Andre Scedrov, and Joe-Kai Tsay. Computationally sound mechanized proofs for basic and public-key Kerberos. In Proceedings of ASIACCS'08, pages 87-99. ACM, 2008.
12. Bruno Blanchet and David Pointcheval. Automated security proofs with sequences of games. In Advances in Cryptology - CRYPTO'06, volume 4117 of Lecture Notes in Computer Science, pages 537-554. Springer-Verlag, 2006.
13. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS, pages 136-145, 2001.
14. Ran Canetti. Composable formal security analysis: Juggling soundness, simplicity and efficiency. In Proceedings of ICALP'08, pages 1-13, 2008.
15. Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses Liskov, Nancy A. Lynch, Olivier Pereira, and Roberto Segala. Analyzing security protocols using time-bounded task-pioas. Discrete Event Dynamic Systems, 18(1):111-159, 2008.
16. Hubert Comon-Lundh and Véronique Cortier. Computational soundness of observational equivalence. In Proceedings of CCS'08, pages 109-118. ACM Press, October 2008.
17. Ricardo Corin and Jerry den Hartog. A probabilistic Hoare-style logic for game-based cryptographic proofs. In Proceedings of ICALP'06, volume 4052 of LNCS, pages 252-263, 2006.
18. Jean Sébastien Coron. On the exact security of Full Domain Hash. In Proceedings of CRYPTO'00, volume 1880 of Lecture Notes in Computer Science, pages 229-235. Springer-Verlag, 2000.
19. Judicaël Courant, Marion Daubignard, Cristian Ene, Pascal Lafourcade, and Yassine Lakhnech. Towards automated proofs for asymmetric encryption schemes in the random oracle model. In Proceedings of CCS'08, pages 371-380. ACM Press, 2008.
20. Judicaël Courant, Cristian Ene, and Yassine Lakhnech. Computationally sound typing for non-interference: The case of deterministic encryption. In Proceedings of FSTTCS'07, volume 4855 of Lecture Notes in Computer Science, pages 364-375. Springer, 2007.
21. Anupam Datta, Ante Derek, John C. Mitchell, AjithRamanathan, and Andre Scedrov. Games and the impossibility of realizable ideal functionality. In Shai Halevi and Tal Rabin, editors, TCC, volume 3876 of Lecture Notes in Computer Science, pages 360-379. Springer, 2006.
22. Anupam Datta, Ante Derek, John C. Mitchell, andBogdan Warinschi. Computationally sound ompositional logic for key exchange protocols. In Proceedings of CSFW'06, pages 321-334. IEEE Computer Society, 2006.
23. Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, 1984.
24. Jean Goubault-Larrecq. Towards producing formally checkable security proofs, automatically. In Proceedings of CSF'08, pages 224-238. IEEE Computer Society, 2008.
25. Shai Halevi. A plausible approach to computer-aided cryptographic proofs. Cryptology ePrint Archive, Report 2005/181, 2005.
26. Joseph Y. Halpern. From qualitative to quantitative proofs of security properties using first-order conditional logic. In Proceedings of AAAI'08, pages 454-459, 2008.
27. Martin Hofmann. A Mixed Modal/Linear LambdaCalculus with Applications to Bellantoni-Cook Safe Recursion. In Proceedings of CSL'97, pages 275-294, 1997.
28. Russell Impagliazzo and Bruce M. Kapron. Logics for reasoning about cryptographic constructions. Journal of Computer and Systems Sciences, 72(2):286-320, 2006.
29. Peeter Laud. On the computational soundness of cryptographically masked flows. In Proceedings of POPL 2008, pages 337-348. ACM, 2008.
30. Ueli Maurer. Random systems: Theory and applications. In Yvo Desmedt, editor, ICITS 2007, volume 4883 of Lecture Notes in Computer Science, pages 44-45. Springer-Verlag, 2009.
31. Ueli Maurer, Krzysztof Pietrzak, and Renato Renner. Indistinguishability amplification. In Alfred Menezes, editor, Advances in Cryptology - CRYPTO 2007,volume 4622 of Lecture Notes in Computer Science, pages 130-149. Springer-Verlag, August 2007.
32. Daniele Micciancio and Saurabh Panjwani. Adaptivesecurity of symbolic encryption. In Joe Kilian, editor, Proceedings of TCC'05, volume 3378 of Lecture Notes in Computer Science, pages 169-187. Springer-Verlag, 2005.
33. Daniele Micciancio and Bogdan Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proceedings of TCC'04, volume 2951 of Lecture Notes in Computer Science, pages 133-151. Springer, 2004.
34. John C. Mitchell, A. Ramanathan, Andre Scedrov, and Vanessa Teague. Probabilistic Polynominal-Time process calculus and security protocol analysis. In Proceedings of LICS'01, pages 3-8. IEEE Computer Society, 2001.
35. David Nowak. A framework for game-based security proofs. In Proceedings of ICS'07, volume 4861, pages 319-333. Springer-Verlag, 2007.
36. Roberto Segala and Andrea Turrini. Approximated computationally bounded simulation relations for probabilistic automata. In Proceedings of CSF'07, pages 140-156. IEEE Computer Society, 2007.
37. Victor Shoup. Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint 2004/332, 2004.
38. Jacques Stern. Why provable security matters? In Advances in Cryptology - EUROCRYPT'03, volume 2656 of Lecture Notes in Computer Science, pages 449-461. Springer-Verlag, 2003.
39. Yu Zhang. The computational SLR: a logic for reasoning about computational indistinguishability. IACR ePrint Archive 2008/434, 2008. Also in Proc. Of Typed Lambda Calculi and Applications 2009.