17 search results - page 4 / 4 » Computational soundness of symbolic zero-knowledge proofs |
AISC
1998
Springer
13 years 10 months ago
1998
Springer
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
BIRTHDAY
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...