-
1
-
-
38149007757
-
-
Affeldt, R., Tanaka, M., Marti, N.: Formal proof of provable security by game- playing in a proof assistant. In: Susilo, W., Liu, J.K., Mu, Y. (eds.) ProvSec 2007. LNCS, 4784, pp. 151-168. Springer, Heidelberg (2007)
-
Affeldt, R., Tanaka, M., Marti, N.: Formal proof of provable security by game- playing in a proof assistant. In: Susilo, W., Liu, J.K., Mu, Y. (eds.) ProvSec 2007. LNCS, vol. 4784, pp. 151-168. Springer, Heidelberg (2007)
-
-
-
-
3
-
-
67049140885
-
Formal certification of code-based cryptographic proofs
-
Barthe, G., Gregoire, B., Janvier, R., Olmedo, F., Beguelin, S.Z.: Formal certification of code-based cryptographic proofs. In: 4th Workshop on Formal and Computational Cryptography (FCC 2008) (2008)
-
(2008)
4th Workshop on Formal and Computational Cryptography (FCC
-
-
Barthe, G.1
Gregoire, B.2
Janvier, R.3
Olmedo, F.4
Beguelin, S.Z.5
-
4
-
-
38149024828
-
Code-based game-playing proofs and the security of triple encryption. Cryptology ePrint Archive
-
Report 2004/331
-
Bellare, M., Rogaway, P.: Code-based game-playing proofs and the security of triple encryption. Cryptology ePrint Archive, Report 2004/331 (2004)
-
(2004)
-
-
Bellare, M.1
Rogaway, P.2
-
5
-
-
0034822279
-
An efficient cryptographic protocol verifier based on Prolog rules
-
IEEE Computer Society, Los Alamitos
-
Blanchet, B.: An efficient cryptographic protocol verifier based on Prolog rules. In: Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW- 14), pp. 82-96. IEEE Computer Society, Los Alamitos (2001)
-
(2001)
Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW
, vol.14
, pp. 82-96
-
-
Blanchet, B.1
-
6
-
-
33749579704
-
Automated security proofs with sequences of games
-
Dwork, C, ed, CRYPTO 2006, Springer, Heidelberg
-
Blanchet, B., Pointcheval, D.: Automated security proofs with sequences of games. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 537-554. Springer, Heidelberg (2006)
-
(2006)
LNCS
, vol.4117
, pp. 537-554
-
-
Blanchet, B.1
Pointcheval, D.2
-
7
-
-
0022716288
-
A simple unpredictable pseudo random number generator. SIAM Journal on Computing 15(2), 364-383 (1986)
-
Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo random number generator. SIAM Journal on Computing 15(2), 364-383 (1986); an earlier version appeared in Proceedings of Crypto 1982
-
(1982)
an earlier version appeared in Proceedings of Crypto
-
-
Blum, L.1
Blum, M.2
Shub, M.3
-
9
-
-
38049031798
-
-
Gonthier, G., Mahboubi, A., Rideau, L., Tassi, E., Thery, L.: A modular formal- isation of finite group theory. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, 4732, pp. 86-101. Springer, Heidelberg (2007)
-
Gonthier, G., Mahboubi, A., Rideau, L., Tassi, E., Thery, L.: A modular formal- isation of finite group theory. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 86-101. Springer, Heidelberg (2007)
-
-
-
-
10
-
-
33746336609
-
A plausible approach to computer-aided cryptographic proofs. Cryptology ePrint Archive
-
Report 2005/181
-
Halevi, S.: A plausible approach to computer-aided cryptographic proofs. Cryptology ePrint Archive, Report 2005/181 (2005)
-
(2005)
-
-
Halevi, S.1
-
12
-
-
70349275452
-
Towards automated proofs of asymmetric encryption schemes in the random oracle model
-
ACM, New York , to appear
-
Lafourcade, P., Lakhnech, Y., Ene, C., Courant, J., Daubignard, M.: Towards automated proofs of asymmetric encryption schemes in the random oracle model. In: Proceedings of the 2008 ACM Conference on Computer and Communications Security, ACM, New York (2008) (to appear)
-
(2008)
Proceedings of the 2008 ACM Conference on Computer and Communications Security
-
-
Lafourcade, P.1
Lakhnech, Y.2
Ene, C.3
Courant, J.4
Daubignard, M.5
-
13
-
-
38148999450
-
-
Nowak, D.: A framework for game-based security proofs. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, 4861, pp. 319-333. Springer, Heidelberg (2007); also available as Cryptology ePrint Archive, Report 2007/199
-
Nowak, D.: A framework for game-based security proofs. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol. 4861, pp. 319-333. Springer, Heidelberg (2007); also available as Cryptology ePrint Archive, Report 2007/199
-
-
-
-
15
-
-
33745142417
-
Sequences of games: A tool for taming complexity in security proofs. Cryptology ePrint Archive
-
Report 2004/332
-
Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004/332 (2004)
-
(2004)
-
-
Shoup, V.1
-
16
-
-
0021548502
-
Efficient and secure pseudo-random number generation. In: Proceedings of the IEEE 25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
-
Vazirani, U.V., Vazirani, V.V.: Efficient and secure pseudo-random number generation. In: Proceedings of the IEEE 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), pp. 458-463. IEEE Computer Society, Los Alami- tos (1984)
-
(1984)
IEEE Computer Society, Los Alami- tos
, pp. 458-463
-
-
Vazirani, U.V.1
Vazirani, V.V.2
|