-
1
-
-
85083027758
-
Reconciling two views of cryptography (the computational soundness of formal encryption)
-
M. Abadi and P. 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
-
-
4944234643
-
Symmetric encryption in a simulatable Dolev-Yao style cryptographic library
-
IEEE, June
-
M. Backes and B. Pfitzmann. Symmetric encryption in a simulatable Dolev-Yao style cryptographic library. In CSFW'04- IEEE, June 2004.
-
(2004)
CSFW'04
-
-
Backes, M.1
Pfitzmann, B.2
-
5
-
-
1442292329
-
A composable cryptographic library with nested operations
-
ACM, Oct.
-
M. Backes, B. Pfitzmann, and M. Waidner. A composable cryptographic library with nested operations. In CCS'03, pages 220-230. ACM, Oct. 2003.
-
(2003)
CCS'03
, pp. 220-230
-
-
Backes, M.1
Pfitzmann, B.2
Waidner, M.3
-
6
-
-
0142250274
-
Symmetric authentication within a simulatable cryptographic library
-
LNCS 2808. Springer, Oct.
-
M. Backes, B. Pfitzmann, and M. Waidner. Symmetric authentication within a simulatable cryptographic library. In ESORICS'03, LNCS 2808, pages 271-290. Springer, Oct. 2003.
-
(2003)
ESORICS'03
, pp. 271-290
-
-
Backes, M.1
Pfitzmann, B.2
Waidner, M.3
-
7
-
-
9444263192
-
A machine-checked formalization of the generic model and the random oracle model
-
LNCS 3097. Springer, July
-
G. Barthe, J. Cederquist, and S. Tarento. A machine-checked formalization of the generic model and the random oracle model. In IJCAR'04, LNCS 3097, pages 385-399. Springer, July 2004.
-
(2004)
IJCAR'04
, pp. 385-399
-
-
Barthe, G.1
Cederquist, J.2
Tarento, S.3
-
8
-
-
84947928286
-
Practice-oriented provable security
-
LNCS 1396. Springer
-
M. Bellare. Practice-Oriented Provable Security. In ISW'97, LNCS 1396. Springer, 1997.
-
(1997)
ISW'97
-
-
Bellare, M.1
-
9
-
-
0027726717
-
Random oracles are practical: A paradigm for designing efficient protocols
-
ACM Press
-
M. Bellare and P. Rogaway. Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In CCS'93, pages 62-73. ACM Press, 1993.
-
(1993)
CCS'93
, pp. 62-73
-
-
Bellare, M.1
Rogaway, P.2
-
10
-
-
84947906522
-
The exact security of digital signatures - How to sign with RSA and rabin
-
LNCS 1070. Springer
-
M. Bellare and P. Rogaway. The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In Eurocrypt '96, LNCS 1070, pages 399-416. Springer, 1996.
-
(1996)
Eurocrypt '96
, pp. 399-416
-
-
Bellare, M.1
Rogaway, P.2
-
12
-
-
3543058869
-
Automatic proof of strong secrecy for security protocols
-
May
-
B. Blanchet. Automatic proof of strong secrecy for security protocols. In IEEE Symposium on Security and Privacy, pages 86-100, May 2004.
-
(2004)
IEEE Symposium on Security and Privacy
, pp. 86-100
-
-
Blanchet, B.1
-
14
-
-
33751067991
-
A computationally sound mechanized prover for security protocols
-
May
-
B. Blanchet. A computationally sound mechanized prover for security protocols. In IEEE Symposium on Security and Privacy, pages 140-154, May 2006.
-
(2006)
IEEE Symposium on Security and Privacy
, pp. 140-154
-
-
Blanchet, B.1
-
16
-
-
0035163054
-
Universally composable security: A new paradigm for cryptographic protocols
-
IEEE, Oct. An updated version is available at Cryptology ePrint Archive
-
R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS'01, pages 136-145. IEEE, Oct. 2001. An updated version is available at Cryptology ePrint Archive, http://eprint.iacr.org/2000/ 067.
-
(2001)
FOCS'01
, pp. 136-145
-
-
Canetti, R.1
-
18
-
-
24644437051
-
Computationally sound, automated proofs for security protocols
-
LNCS 3444. Springer, Apr.
-
V. Cortier and B. Warinschi. Computationally sound, automated proofs for security protocols. In ESOP'05, LNCS 3444, pages 157-171. Springer, Apr. 2005.
-
(2005)
ESOP'05
, pp. 157-171
-
-
Cortier, V.1
Warinschi, B.2
-
19
-
-
26444565771
-
Probabilistic polynomial-time semantics for a protocol security logic
-
LNCS 3580. Springer, July
-
A. Datta, A. Derek, J. C. Mitchell, V. Shmatikov, and M. Turuani. Probabilistic polynomial-time semantics for a protocol security logic. In ICALP'05, LNCS 3580, pages 16-29. Springer, July 2005.
-
(2005)
ICALP'05
, pp. 16-29
-
-
Datta, A.1
Derek, A.2
Mitchell, J.C.3
Shmatikov, V.4
Turuani, M.5
-
23
-
-
0023985465
-
A digital signature scheme secure against adaptative chosen-message attacks
-
April
-
S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure Against Adaptative Chosen-Message Attacks. SIAM Journal of Computing, 17(2):281-308, April 1988.
-
(1988)
SIAM Journal of Computing
, vol.17
, Issue.2
, pp. 281-308
-
-
Goldwasser, S.1
Micali, S.2
Rivest, R.3
-
25
-
-
24644476184
-
Completing the picture: Soundness of formal encryption in the presence of active adversaries
-
LNCS 3444. Springer, Apr.
-
R. Janvier, Y. Lakhnech, and L. Mazaré. Completing the picture: Soundness of formal encryption in the presence of active adversaries. In ESOP'05, LNCS 3444, pages 172-185. Springer, Apr. 2005.
-
(2005)
ESOP'05
, pp. 172-185
-
-
Janvier, R.1
Lakhnech, Y.2
Mazaré, L.3
-
26
-
-
35248840989
-
Handling encryption in an analysis for secure information flow
-
LNCS 2618. Springer, Apr.
-
P. Laud. Handling encryption in an analysis for secure information flow. In ESOP'03, LNCS 2618, pages 159-173. Springer, Apr. 2003.
-
(2003)
ESOP'03
, pp. 159-173
-
-
Laud, P.1
-
27
-
-
3543052976
-
Symmetric encryption in automatic analyses for confidentiality against active adversaries
-
May
-
P. Laud. Symmetric encryption in automatic analyses for confidentiality against active adversaries. In IEEE Symposium on Security and Privacy, pages 71-85, May 2004.
-
(2004)
IEEE Symposium on Security and Privacy
, pp. 71-85
-
-
Laud, P.1
-
28
-
-
33745787443
-
Secrecy types for a simulatable cryptographic library
-
ACM, Nov.
-
P. Laud. Secrecy types for a simulatable cryptographic library. In CCS'05, pages 26-35. ACM, Nov. 2005.
-
(2005)
CCS'05
, pp. 26-35
-
-
Laud, P.1
-
29
-
-
0032218226
-
A probabilistic poly-time framework for protocol analysis
-
Nov.
-
P. D. Lincoln, J. C. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In CCS'98, pages 112-121, Nov. 1998.
-
(1998)
CCS'98
, pp. 112-121
-
-
Lincoln, P.D.1
Mitchell, J.C.2
Mitchell, M.3
Scedrov, A.4
-
30
-
-
84958052989
-
Probabilistic polynomial-time equivalence and security protocols
-
LNCS 1708. Springer, Sept.
-
P. D. Lincoln, J. C. Mitchell, M. Mitchell, and A. Scedrov. Probabilistic polynomial-time equivalence and security protocols. In FM'99, LNCS 1708, pages 776-793. Springer, Sept. 1999.
-
(1999)
FM'99
, pp. 776-793
-
-
Lincoln, P.D.1
Mitchell, J.C.2
Mitchell, M.3
Scedrov, A.4
-
31
-
-
35248861970
-
Composition of cryptographic protocols in a probabilistic polynomial-time process calculus
-
LNCS 2761. Springer, Sept.
-
P. Mateus, J. Mitchell, and A. Scedrov. Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In CONCUR 2003, LNCS 2761, pages 327-349. Springer, Sept. 2003.
-
(2003)
CONCUR 2003
, pp. 327-349
-
-
Mateus, P.1
Mitchell, J.2
Scedrov, A.3
-
32
-
-
35048899313
-
Soundness of formal encryption in the presence of active adversaries
-
LNCS 2951. Springer, Feb.
-
D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In TCC'04, LNCS 2951, pages 133-151. Springer, Feb. 2004.
-
(2004)
TCC'04
, pp. 133-151
-
-
Micciancio, D.1
Warinschi, B.2
-
33
-
-
33244491452
-
A probabilistic polynomial-time calculus for the analysis of cryptographic protocols
-
Mar.
-
J. C. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague. A probabilistic polynomial-time calculus for the analysis of cryptographic protocols. Theoretical Computer Science, 353(1-3):118-164, Mar. 2006.
-
(2006)
Theoretical Computer Science
, vol.353
, Issue.1-3
, pp. 118-164
-
-
Mitchell, J.C.1
Ramanathan, A.2
Scedrov, A.3
Teague, V.4
-
34
-
-
0024867751
-
Universal one-way hash functions and their cryptographic applications
-
ACM Press
-
M. Naor and M. Yung. Universal One-Way Hash Functions and Their Cryptographic Applications. In STOC'89, pages 33-43. ACM Press, 1989.
-
(1989)
STOC'89
, pp. 33-43
-
-
Naor, M.1
Yung, M.2
-
35
-
-
84974554584
-
Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack
-
LNCS 576. Springer
-
C. Rackoff and D. R. Simon. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In Crypto '91, LNCS 576, pages 433-444. Springer, 1992.
-
(1992)
Crypto '91
, pp. 433-444
-
-
Rackoff, C.1
Simon, D.R.2
-
36
-
-
35048876713
-
Probabilistic bisimulation and equivalence for security analysis of network protocols
-
LNCS 2987. Springer, Mar.
-
A. Ramanathan, J. Mitchell, A. Scedrov, and V. Teague. Probabilistic bisimulation and equivalence for security analysis of network protocols. In FOSSACS'04, LNCS 2987, pages 468-483. Springer, Mar. 2004.
-
(2004)
FOSSACS'04
, pp. 468-483
-
-
Ramanathan, A.1
Mitchell, J.2
Scedrov, A.3
Teague, V.4
-
38
-
-
33947656534
-
Cryptographically sound theorem proving
-
IEEE, July. To appear
-
C. Sprenger, M. Backes, D. Basin, B. Pfitzmann, and M. Waidner. Cryptographically sound theorem proving. In CSFW'06. IEEE, July 2006. To appear.
-
(2006)
CSFW'06
-
-
Sprenger, C.1
Backes, M.2
Basin, D.3
Pfitzmann, B.4
Waidner, M.5
-
39
-
-
33646027052
-
Machine-checked security proofs of cryptographic signature schemes
-
LNCS 3679. Springer, Sept.
-
S. Tarento. Machine-checked security proofs of cryptographic signature schemes. In ESORICS'05, LNCS 3679, pages 140-158. Springer, Sept. 2005.
-
(2005)
ESORICS'05
, pp. 140-158
-
-
Tarento, S.1
|