Leakage-resilient cryptography aims at formally proving the security of cryptographic implementations against large classes of sidechannel adversaries. One important challenge for such an approach to be relevant is to adequately connect the formal models used in the proofs with the practice of side-channel attacks. It raises the fundamental problem of finding reasonable restrictions of the leak...

In building intelligent tutoring systems, it is critical to be able to understand and diagnose student responses in interactive problem solving. We present a novel application of the q-matrix method, an educational data mining technique, to the problem of analyzing formal proofs. Our results indicate that automated analysis of formal proof data can provide an intelligent tutoring system with us...

A symbolic-style proof system is presented to reason about observational equivalence for applied pi-calculus. The proofs of the soundness and completeness of the system rely on a recently developed theory of symbolic bisimulation for applied pi-calculus. The completeness result of the proof system is restricted to the finite fragment of applied pi-calculus which admits finite partition, and it ...

BioModel Analyzer (bma) is a tool for modeling and analyzing biological networks. Designed with a lightweight graphical user interface, the tool facilitates usage for biologists with no previous knowledge in programming or formal methods. The current implementation analyzes systems to establish stabilization. The results of the analysis— whether they be proofs or counterexamples—are represented...

in this paper, some recent results established by marin borcut [m. borcut, tripled fixed point theorems for monotone mappings in partially ordered metric spaces, carpathian j. math. 28, 2 (2012), 207--214] and [m. borcut, tripled coincidence theorems for monotone mappings in partially ordered metric spaces, creat. math. inform. 21, 2 (2012), 135--142] are generalized and improved, with much sho...

We discuss two combinatorial problems for which we have only sub-optimal solutions. We describe known solutions and we explain why better solutions would be of importance to Cryptography. The areas of application are in improving the ef-ciency of Zero-Knowledge proofs, in relating the quadratic residuosity problem to the problem of integer factorization, and in analyzing some cryptographic sche...