James W. Gray, III, Kin Fai Epsilon Ip, and King-Shan Lui. Provable security for cryptographic protocols|exact analysis and engineering applications. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, pages 45-58, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Reconciling Two Views of Cryptography (The Computational.. - Abadi, Rogaway (2000) (26 citations) (Correct)
....This definition of security can be worked out rigorously and elegantly in both asymptotic and concrete versions (see Section 4.3) In any case, it is based on notions of probability and computational power. Related work The desire to relate the two views of cryptography is not entirely new (e.g. [3, 27, 33]) Nevertheless, there have been hardly any research e#orts in this general direction. The work of Pfitzmann, Schunter, and Waidner [38] which is simultaneous to ours and independent) starts from motivations similar to our own. It proves that some reactive, cryptographic systems satisfy ....
James W. Gray, III, Kin Fai Epsilon Ip, and King-Shan Lui. Provable security for cryptographic protocols---exact analysis and engineering applications. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, pages 45--58, 1997.
Verifying Secrets and Relative Secrecy - Volpano, Smith (2000) (26 citations) (Correct)
....We have only argued that the hardness of copying h using a well typed program with references to fh and calls to f rests squarely upon the hardness of inverting f . Turing reductions have also been used in proving the security of RSA based signature schemes [3, 4] and cryptographic protocols [6, 8]. Again the basic idea is to prove that the security of a protocol rests on the strength of its cryptographic primitives. Our synchronous concurrency example shows that if an intruder can observe the timing behavior of an implementation of a cryptographic operation, then the speci cation of a ....
J. Gray, K. Ip, and K. Lui. Provable security for cryptographic protocols|exact analysis and engineering applications. Journal of Computer Security, 6(1,2):23-52, 1998.
Verifying Secrets and Relative Secrecy - Volpano, Smith (2000) (26 citations) (Correct)
....We have only argued that the hardness of copying h using a well typed program with references to fh and calls to f rests squarely upon the hardness of inverting f . Turing reductions have also been used in proving the security of RSA based signature schemes [3, 4] and cryptographic protocols [6, 8]. Again the basic idea is to prove that the security of a protocol rests on the strength of its cryptographic primitives. Our synchronous concurrency example shows that if an intruder can observe the timing behavior of an implementation of a cryptographic operation, then the specification of a ....
J. Gray, K. Ip, and K. Lui. Provable security for cryptographic protocols---exact analysis and engineering applications. Journal of Computer Security, 6(1,2):23--52, 1998.
Reconciling Two Views of Cryptography (The Computational.. - Abadi, Rogaway (2000) (26 citations) (Correct)
....This definition of security can be worked out rigorously and elegantly in both asymptotic and concrete versions (see Section 4.3) In any case, it is based on notions of probability and computational power. Related work The desire to relate the two views of cryptography is not entirely new (e.g. [3, 20, 26]) Nevertheless, there have been hardly any research e#orts in this general direction. The work of Pfitzmann, Schunter, and Waidner [31] which is simultaneous to ours and independent) starts from motivations similar to our own. It proves that some reactive, cryptographic systems satisfy ....
James W. Gray, III, Kin Fai Epsilon Ip, and King-Shan Lui. Provable security for cryptographic protocols---exact analysis and engineering applications. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, pages 45--58, 1997.
Reconciling Two Views of Cryptography (The Computational.. - Abadi, Rogaway (2000) (26 citations) (Correct)
....This definition of security can be worked out rigorously and elegantly in both asymptotic and concrete versions (see Section 4.3) In any case, it is based on notions of probability and computational power. Related work The desire to relate the two views of cryptography is not entirely new (e.g. [3, 20, 26]) Nevertheless, there have been hardly any research efforts in this general direction. The work of Pfitzmann, Schunter, and Waidner [31] which is simultaneous to ours and independent) starts from motivations similar to our own. It proves that some reactive, cryptographic systems satisfy ....
James W. Gray, III, Kin Fai Epsilon Ip, and King-Shan Lui. Provable security for cryptographic protocols---exact analysis and engineering applications. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, pages 45--58, 1997.
Reconciling Two Views of Cryptography - The Computational Soundness (Correct)
No context found.
James W. Gray, III, Kin Fai Epsilon Ip, and King-Shan Lui. Provable security for cryptographic protocols|exact analysis and engineering applications. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, pages 45-58, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC