A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on factoring and discrete log, but still they are practical schemes based on NP-hard problems. Among them, the problem SD of decoding linear codes is in spite of some 30 years of research effort, still exponential. We stu...

R = R(X,Z,L, σ) = H(X, R) = k ⊕H(X, R1)⊕H(X, R2)⊕ · · · By [RS2, Theorem 3.1], R is noetherian with qgr-R ' qgr-R. Proposition 1.2. [RS2, Proposition 3.20]. Keep the above assumptions and assume that L is also ample and generated by its global sections. Then there exists M ∈ N such that, for m ≥M : (1) In ⊗ L⊗m n is generated by its global sections for all n ≥ 1. (2) R(X,Z,L⊗m, σ) is generated ...

Explicit, implicit–explicit and Crank–Nicolson implicit–explicit numerical schemes for solving the generalized lubrication equation are derived. We prove that the implicit– explicit and Crank–Nicolson implicit–explicit numerical schemes are unconditionally stable. Numerical solutions obtained from both schemes are compared. Initial curves with both zero and finite contact angles are considered....

This work studies the effect of short-term exposure to temperatures -15°C, 5°C, 40°C and 60°C on flexural performance Fibre Reinforced Concretes (FRCs) with steel synthetic fibres in cracked conditions. The results will be compared conditions at 20°C (submerged air environments). content was chosen guarantee similar residual strength all mixes. beams were pre-cracked following EN 14651 ambient ...

Association schemes are combinatorial objects that allow us solve problems in several branches of mathematics. They have been used in the study of permutation groups and graphs and also in the design of experiments, coding theory, partition designs etc. In this paper we show some techniques for computing properties of association schemes. The main framework arises from the fact that we can char...

Higher-level cryptographic privacy-enhancing protocols such as anonymous credentials, voting schemes, and e-cash are often constructed by suitably combining signature, commitment, and encryption schemes with zero-knowledge proofs. Indeed, a large body of protocols have been constructed in that manner from Camenisch-Lysyanskaya signatures and generalized Schnorr proofs. In this paper, we build a...

This paper presents a part-based face detection approach where the spatial relationship between the face parts is represented by a hidden 3D model with six parameters. The computational complexity of the search in the six dimensional pose space is addressed by proposing meaningful 3D pose candidates by image-based regression from detected face keypoint locations. The 3D pose candidates are eval...