In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
We propose a programming language, called PCML5, for building distributed applications with distributed access control. Target applications include web-based systems in which prog...
In cryptographic protocols, zero knowledge proofs are employed for a principal A to communicate some non-trivial information t to B while at the same time ensuring that B cannot de...