403 search results - page 63 / 81 » An algebra for commitment protocols |
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
We introduce ctm, a process calculus which embodies a notion of trust for global computing systems. In ctm each principal (location) is equipped with a policy, which determines its...
102
click to vote
AISC
2008
Springer
15 years 3 months ago
2008
Springer
We present three examples of the composition of Computer Algebra Systems to illustrate the progress on a composability infrastructure as part of the SCIEnce (Symbolic Computation I...
114
click to vote
ACNS
2005
Springer
15 years 7 months ago
2005
Springer
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
109
click to vote
LICS
2003
IEEE
15 years 6 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
116
click to vote
IANDC
2008
15 years 1 months ago
2008
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...