72 search results - page 2 / 15 » Computational and Information-Theoretic Soundness and Comple... |
CCS
2010
ACM
13 years 5 months ago
2010
ACM
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
TCC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
CCS
2009
ACM
14 years 8 hour ago
2009
ACM
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
TCS
2008
13 years 5 months ago
2008
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
SKG
2006
IEEE
13 years 11 months ago
2006
IEEE
Semantic completeness and syntax completeness are important characters of the general formal systems, two the completeness have different meaning for a formal system. This paper a...