641 search results - page 23 / 129 » Formal Reliability Analysis Using Theorem Proving |
122
click to vote
CSFW
2002
IEEE
15 years 7 months ago
2002
IEEE
We formalize aspects of the Kerberos 5 authentication protocol in the Multi-Set Rewriting formalism (MSR) on two levels of detail. The more detailed formalization reflects the in...
CSFW
2010
IEEE
15 years 6 months ago
2010
IEEE
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
142
click to vote
CSFW
2012
IEEE
13 years 4 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
137
click to vote
JSYML
2007
15 years 2 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
114
click to vote
TSMC
2010
14 years 9 months ago
2010
Computer system reliability is conventionally modeled and analyzed using techniques such as fault tree analysis (FTA) and reliability block diagrams (RBD), which provide static rep...