403 search results - page 41 / 81 » An algebra for commitment protocols |
108
click to vote
BIRTHDAY
2006
Springer
15 years 3 months ago
2006
Springer
The paper presents an approach to reasoning about Web services in a temporal action theory. Web services are described by specifying their interaction protocols in an action theory...
104
click to vote
SCN
2008
Springer
14 years 11 months ago
2008
Springer
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
SIAMCOMP
2008
14 years 10 months ago
2008
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivio...
103
click to vote
CSFW
2009
IEEE
15 years 3 months ago
2009
IEEE
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
IWFM
2003
15 years 1 months ago
2003
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...