In this paper we present and prove secure a new identity-based identification scheme based on error-correcting codes. Our scheme combines two well known schemes by Courtois-Finiasz-Sendrier and Stern. It inherits some of their practical weaknesses, …
We first prove part (a). We just prove (2.22) and (2.23), since the derivation of (2.24) and (2.25) is very similar. Let f be a representative for F, i.e. F=f(η). Then, by the binomial identity, we have
We prove (a) and (b) simultaneously. By assumption, H:=FG∈L2(P) and, hence, H has a chaotic decomposition of the form
In this work, we investigate the validity of model learning for the purpose of PMC. We propose a novel GA-based approach to overcome limitations of existing model learning algorithms and conducted an empirical study to systematically evaluate the ef…
In this section, it is shown how the main results of this article can be applied to give rates of convergence for the functional Breuer-Major theorems recently proved in [CNN18] and [NN18].
There aren't more papers