-
1
-
-
34547340512
-
Computationally sound secrecy proofs by mechanized flow analysis
-
ACM
-
M. Backes and P. Laud. Computationally sound secrecy proofs by mechanized flow analysis. In Proc. 13th CCS, pages 370-379. ACM, 2006.
-
(2006)
Proc. 13th CCS
, pp. 370-379
-
-
Backes, M.1
Laud, P.2
-
3
-
-
51749108343
-
-
M. Backes, B. Pfitzmann, and M. Waidner. A universally composable cryptographic library. IACR Cryptology ePrint Archive 2003/015, Jan. 2003.
-
M. Backes, B. Pfitzmann, and M. Waidner. A universally composable cryptographic library. IACR Cryptology ePrint Archive 2003/015, Jan. 2003.
-
-
-
-
4
-
-
2442575906
-
Simple relational correctness proofs for static analyses and program transformations
-
N. Benton. Simple relational correctness proofs for static analyses and program transformations. In Proc. Principles of Programming Languages (POPL), pages 14-25, 2004.
-
(2004)
Proc. Principles of Programming Languages (POPL)
, pp. 14-25
-
-
Benton, N.1
-
5
-
-
0035163054
-
Universally composable security: A new paradigm for cryptographic protocols
-
R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proc. 42nd IEEE FOCS, pages 136-145, 2001.
-
(2001)
Proc. 42nd IEEE FOCS
, pp. 136-145
-
-
Canetti, R.1
-
6
-
-
33745528593
-
Universally composable symbolic analysis of mutual authentication and key exchange protocols
-
Proc. 3rd Theory of Cryptography Conference TCC, of
-
R. Canetti and J. Herzog. Universally composable symbolic analysis of mutual authentication and key exchange protocols. In Proc. 3rd Theory of Cryptography Conference (TCC), volume 3876 of LNCS, pages 380-403, 2006.
-
(2006)
LNCS
, vol.3876
, pp. 380-403
-
-
Canetti, R.1
Herzog, J.2
-
7
-
-
34347206776
-
Explicit randomness is not necessary when modeling probabilistic encryption
-
V. Cortier, H. Hördegen, and B. Warinschi. Explicit randomness is not necessary when modeling probabilistic encryption. ENTCS, 186:49-65, 2007.
-
(2007)
ENTCS
, vol.186
, pp. 49-65
-
-
Cortier, V.1
Hördegen, H.2
Warinschi, B.3
-
9
-
-
0020720357
-
On the security of public key protocols
-
D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Trans, on Inf. Theory, 29(2):198-208, 1983.
-
(1983)
IEEE Trans, on Inf. Theory
, vol.29
, Issue.2
, pp. 198-208
-
-
Dolev, D.1
Yao, A.C.2
-
11
-
-
26444574191
-
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
-
G. Lowe. Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. Software - Concepts and Tools, 17:93-102, 1996.
-
(1996)
Software - Concepts and Tools
, vol.17
, pp. 93-102
-
-
Lowe, G.1
-
12
-
-
35048899313
-
Soundness of formal encryption in the presence of active adversaries
-
Proc. 1st Theory of Cryptography Conference TCC, of
-
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference (TCC), volume 2951 of LNCS, pages 133-151, 2004.
-
(2004)
LNCS
, vol.2951
, pp. 133-151
-
-
Micciancio, D.1
Warinschi, B.2
-
13
-
-
0348126394
-
Isabelle/HOL - A Proof Assistant for Higher-Order Logic
-
of, Springer-Verlag
-
T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer-Verlag, 2002.
-
(2002)
LNCS
, vol.2283
-
-
Nipkow, T.1
Paulson, L.C.2
Wenzel, M.3
-
14
-
-
0031643297
-
The inductive approach to verifying cryptographic protocols
-
L. Paulson. The inductive approach to verifying cryptographic protocols. J. Computer Security, 6:85-128, 1998.
-
(1998)
J. Computer Security
, vol.6
, pp. 85-128
-
-
Paulson, L.1
-
15
-
-
0034447081
-
Composition and integrity preservation of secure reactive systems
-
B. Pfltzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In Proc. 7th CCS, pages 245-254, 2000.
-
(2000)
Proc. 7th CCS
, pp. 245-254
-
-
Pfltzmann, B.1
Waidner, M.2
-
16
-
-
0347668150
-
Evaluation logic
-
G. Birtwistle, editor, Springer, Berlin
-
A. M. Pitts. Evaluation logic. In G. Birtwistle, editor, IVth Higher Order Workshop, Banff 1990, Workshops in Computing, pages 162-189. Springer, Berlin, 1991.
-
(1991)
IVth Higher Order Workshop, Banff 1990, Workshops in Computing
, pp. 162-189
-
-
Pitts, A.M.1
-
17
-
-
33947656534
-
Cryptographically sound theorem proving
-
July
-
C. Sprenger, M. Backes, D. Basin, B. Pfltzmann, and M. Waidner. Cryptographically sound theorem proving. In 19th IEEE CSFW, pages 153-166, July 2006.
-
(2006)
19th IEEE CSFW
, pp. 153-166
-
-
Sprenger, C.1
Backes, M.2
Basin, D.3
Pfltzmann, B.4
Waidner, M.5
-
18
-
-
38049006874
-
A monad-based modeling and verification toolbox with application to security protocols
-
20th TPHOLs
-
C. Sprenger and D. Basin. A monad-based modeling and verification toolbox with application to security protocols. In 20th TPHOLs, LNCS Volume 4732, pages 302-318, 2007.
-
(2007)
LNCS
, vol.4732
, pp. 302-318
-
-
Sprenger, C.1
Basin, D.2
|