-
1
-
-
0003092378
-
A calculus for cryptographic protocols: The spi calculus
-
Martín Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The spi calculus. Inf. Comput., 148(1):1-70, 1999.
-
(1999)
Inf. Comput.
, vol.148
, Issue.1
, pp. 1-70
-
-
Abadi, M.1
Gordon, A.D.2
-
2
-
-
85083027758
-
Reconciling two views of cryptography (the computational soundness of formal encryption)
-
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.
-
(2002)
Journal of Cryptology
, vol.15
, Issue.2
, pp. 103-127
-
-
Abadi, M.1
Rogaway, P.2
-
3
-
-
58049108667
-
A formal language for cryptographic pseudocode
-
Springer-Verlag
-
Michael Backes, Mathias Berg, and Dominique Unruh. A formal language for cryptographic pseudocode. In Proceedings of LPAR'08, pages 353-376. Springer-Verlag, 2008.
-
(2008)
Proceedings of LPAR'08
, pp. 353-376
-
-
Backes Berg, M.M.1
Unruh, D.2
-
4
-
-
1442292329
-
A composable cryptographic library with nested operations
-
Sushil Jajodia, Vijayalakshmi Atluri, and Trent Jaeger, editors,. ACM
-
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.
-
(2003)
ACM Conference on Computer and Communications Security
, pp. 220-230
-
-
Backes, M.1
Pfitzmann, B.2
Waidner, M.3
-
5
-
-
84866895242
-
Deciding equality of probabilistic terms
-
Springer-Verlag,. To appear
-
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.
-
(2010)
Proceedings of LPAR'10, Lecture Notes in Computer Science.
-
-
Barthe, G.1
Daubignard, M.2
Kapron, B.3
Lakhnech, Y.4
Laporte, V.5
-
7
-
-
67649846626
-
Formal certification of code-based cryptographic proofs
-
ACM Press
-
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.
-
(2009)
Proceedings of OPL'09
, pp. 90-101
-
-
Barthe, G.1
Grégoire, B.2
Béguelin, S.Z.3
-
8
-
-
84947906522
-
The exactsecurity of digital signatures - How to sign with RSA and Rabin
-
Lecture Notes in Computer Science, Springer-Verlag
-
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.
-
(1996)
Proceedings of EUROCRYPT'96
, vol.1070
, pp. 399-416
-
-
Bellare, M.1
Rogaway, P.2
-
9
-
-
33746041431
-
The security of triple encryption and a framework for code-based game-playing proofs
-
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.
-
(2006)
Proceedings of EUROCRYPT'06
, pp. 409-426
-
-
Bellare, M.1
Rogaway, P.2
-
10
-
-
33751067991
-
A computationally sound mechanizedprover for security protocols
-
IEEE Computer Society
-
Bruno Blanchet. A computationally sound mechanizedprover for security protocols. In IEEE Symposium on Security and Privacy, pages 140-154. IEEE Computer Society, 2006.
-
(2006)
IEEE Symposium on Security and Privacy
, pp. 140-154
-
-
Blanchet, B.1
-
11
-
-
70350687722
-
Computationally sound mechanized proofs for basic and public-key Kerberos
-
ACM
-
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.
-
(2008)
Proceedings of ASIACCS'08
, pp. 87-99
-
-
Blanchet, B.1
Jaggard, A.D.2
Scedrov, A.3
Tsay, J.-K.4
-
12
-
-
33749579704
-
Automated security proofs with sequences of games
-
Advances in Cryptology - CRYPTO'06, Springer-Verlag
-
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.
-
(2006)
Lecture Notes in Computer Science
, vol.4117
, pp. 537-554
-
-
Blanchet, B.1
Pointcheval, D.2
-
13
-
-
0035163054
-
Universally composable security: A new paradigm for cryptographic protocols
-
Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS, pages 136-145, 2001.
-
(2001)
FOCS
, pp. 136-145
-
-
Canetti, R.1
-
14
-
-
49049110708
-
Composable formal security analysis: Juggling soundness, simplicity and efficiency
-
Ran Canetti. Composable formal security analysis: Juggling soundness, simplicity and efficiency. In Proceedings of ICALP'08, pages 1-13, 2008.
-
(2008)
Proceedings of ICALP'08
, pp. 1-13
-
-
Canetti, R.1
-
15
-
-
39549105169
-
Analyzing security protocols using time-bounded task-pioas
-
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.
-
(2008)
Discrete Event Dynamic Systems
, vol.18
, Issue.1
, pp. 111-159
-
-
Canetti, R.1
Cheung, L.2
Kaynar, D.K.3
Liskov, M.4
Lynch, N.A.5
Pereira, O.6
Segala, R.7
-
16
-
-
60549110127
-
Computational soundness of observational equivalence
-
ACM Press, October
-
Hubert Comon-Lundh and Véronique Cortier. Computational soundness of observational equivalence. In Proceedings of CCS'08, pages 109-118. ACM Press, October 2008.
-
(2008)
Proceedings of CCS'08
, pp. 109-118
-
-
Comon-Lundh, H.1
Cortier, V.2
-
17
-
-
33746332058
-
A probabilistic Hoare-style logic for game-based cryptographic proofs
-
LNCS
-
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.
-
(2006)
Proceedings of ICALP'06
, vol.4052
, pp. 252-263
-
-
Corin, R.1
Den Hartog, J.2
-
18
-
-
84921068281
-
On the exact security of full domain hash
-
Lecture Notes in Computer Science, Springer-Verlag
-
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.
-
(2000)
Proceedings of CRYPTO'00
, vol.1880
, pp. 229-235
-
-
Coron, J.S.1
-
19
-
-
70349275452
-
Towards automated proofs for asymmetric encryption schemes in the random oracle model
-
ACM Press
-
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.
-
(2008)
Proceedings of CCS'08
, pp. 371-380
-
-
Courant, J.1
Daubignard, M.2
Ene, C.3
Lafourcade, P.4
Lakhnech, Y.5
-
20
-
-
38349010576
-
Computationally sound typing for non-interference: The case of deterministic encryption
-
Lecture Notes in Computer Science, Springer
-
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.
-
(2007)
Proceedings of FSTTCS'07
, vol.4855
, pp. 364-375
-
-
Courant, J.1
Ene, C.2
Lakhnech, Y.3
-
21
-
-
33745534937
-
Games and the impossibility of realizable ideal functionality
-
Shai Halevi and Tal Rabin, editors, TCC, Springer
-
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.
-
(2006)
Lecture Notes in Computer Science
, vol.3876
, pp. 360-379
-
-
Datta, A.1
Derek, A.2
Mitchell, J.C.3
Ramanathan, A.4
Scedrov, A.5
-
22
-
-
33947704230
-
Computationally sound ompositional logic for key exchange protocols
-
IEEE Computer Society
-
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.
-
(2006)
Proceedings of CSFW'06
, pp. 321-334
-
-
Datta, A.1
Derek, A.2
Mitchell, J.C.3
Warinschi, B.4
-
24
-
-
51749115322
-
Towards producing formally checkable security proofs, automatically
-
IEEE Computer Society
-
Jean Goubault-Larrecq. Towards producing formally checkable security proofs, automatically. In Proceedings of CSF'08, pages 224-238. IEEE Computer Society, 2008.
-
(2008)
Proceedings of CSF'08
, pp. 224-238
-
-
Goubault-Larrecq, J.1
-
26
-
-
57749207013
-
From qualitative to quantitative proofs of security properties using first-order conditional logic
-
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.
-
(2008)
Proceedings of AAAI'08
, pp. 454-459
-
-
Halpern, J.Y.1
-
27
-
-
84957704802
-
A mixed modal/linear lambdacalculus with applications to bellantoni-cook safe recursion
-
Martin Hofmann. A Mixed Modal/Linear LambdaCalculus with Applications to Bellantoni-Cook Safe Recursion. In Proceedings of CSL'97, pages 275-294, 1997.
-
(1997)
Proceedings of CSL'97
, pp. 275-294
-
-
Hofmann, M.1
-
29
-
-
84865660260
-
On the computational soundness of cryptographically masked flows
-
ACM
-
Peeter Laud. On the computational soundness of cryptographically masked flows. In Proceedings of POPL 2008, pages 337-348. ACM, 2008.
-
(2008)
Proceedings of POPL 2008
, pp. 337-348
-
-
Laud, P.1
-
30
-
-
70549108960
-
Random systems: Theory and applications
-
Yvo Desmedt, editor, ICITS 2007. Springer-Verlag
-
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.
-
(2009)
Lecture Notes in Computer Science
, vol.4883
, pp. 44-45
-
-
Maurer, U.1
-
31
-
-
38049173959
-
Indistinguishability amplification
-
Alfred Menezes, editor, Advances in Cryptology - CRYPTO 2007, Springer-Verlag, August
-
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.
-
(2007)
Lecture Notes in Computer Science
, vol.4622
, pp. 130-149
-
-
Maurer, U.1
Pietrzak, K.2
Renner, R.3
-
32
-
-
24144482305
-
Adaptivesecurity of symbolic encryption
-
Joe Kilian, editor, Lecture Notes in Computer Science, Springer-Verlag
-
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.
-
(2005)
Proceedings of TCC'05
, vol.3378
, pp. 169-187
-
-
Micciancio, D.1
Panjwani, S.2
-
33
-
-
35048899313
-
Soundness of formal encryption in the presence of active adversaries
-
Lecture Notes in Computer Science, Springer
-
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.
-
(2004)
Proceedings of TCC'04
, vol.2951
, pp. 133-151
-
-
Micciancio, D.1
Warinschi, B.2
-
34
-
-
0034873746
-
Probabilistic Polynominal-Time process calculus and security protocol analysis
-
IEEE Computer Society
-
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.
-
(2001)
Proceedings of LICS'01
, pp. 3-8
-
-
Mitchell, J.C.1
Ramanathan, A.2
Scedrov, A.3
Teague, V.4
-
35
-
-
38148999450
-
A framework for game-based security proofs
-
Springer-Verlag
-
David Nowak. A framework for game-based security proofs. In Proceedings of ICS'07, volume 4861, pages 319-333. Springer-Verlag, 2007.
-
(2007)
Proceedings of ICS'07
, vol.4861
, pp. 319-333
-
-
Nowak, D.1
-
36
-
-
35048868422
-
Approximated computationally bounded simulation relations for probabilistic automata
-
IEEE Computer Society
-
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.
-
(2007)
Proceedings of CSF'07
, pp. 140-156
-
-
Segala, R.1
Turrini, A.2
-
38
-
-
35248867842
-
Why provable security matters?
-
Advances in Cryptology - EUROCRYPT'03, Springer-Verlag
-
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.
-
(2003)
Lecture Notes in Computer Science
, vol.2656
, pp. 449-461
-
-
Stern, J.1
-
39
-
-
78650010780
-
The computational SLR: A logic for reasoning about computational indistinguishability
-
IACR ePrint Archive 2008/434, 2008. Also
-
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.
-
(2009)
Proc. of Typed Lambda Calculi and Applications
-
-
Zhang, Y.1
|