Crafting certified elliptic curve cryptography implementations in Coq

Curves based cryptography such as Elliptic Curve Cryptography (ECC) or Hyper-Elliptic Curve Cryptog- raphy (HECC) is known to provide a given security level at a lower cost than

We built the FPC-Coq system to demonstrate the feasibility of using logic programming to check proof certificates produced by external provers and to elaborate such certificates

Using delay data collected over the Internet, it was shown that the optimal monitoring policy enables to obtain a routing performance almost as good as the one obtained when all

In particular this permits to derive sufficient conditions on the parameter κ > 0 so that the optimisation problem is proved to be equivalent to a quadratic program (Boyd

contrast to traditional systems, where the software is built by vendors behind closed doors and chosen by election officials, with E2E-V systems, the verification process is public

To answer the research question RQ3, we design experiments on attributed social networks with two different types of user attributes, which means performing link prediction given

It shows that, despite the modest computational resources of modern programmable logic controllers, it is possible to develop efficient cryptographic appli- cations that enforce

Table 1 organizes the main schema-agnostic Blocking methods in a two-dimensional taxonomy 315 that is formed by two criteria: (i) Indexing Function Definition, which determines