Calculation for proving that a secret belongs to an interval, implementing binary decomposition

摘要

The method involves calculating a bond based on a secret of a proover entity, and calculating a knowledge proof of the secret using a binary decomposition of the secret and upper and lower bounds. The proof is recalculated by the verifier entity based on the bond so as to verify the proof received from the proover entity, where the bounds are introduced in the entities, and a preliminary treatment calculating the proof is implemented to simplify an expression of the proof such that the expression of the proof is free of components issued from the decomposition of the bounds. Independent claims are also included for the following: (1) a computer program to be stored in memory of a verifier entity for calculation of proof of knowledge of a secret in a given interval (2) a proover entity to prove knowledge of a secret at a verifier entity in a given interval (3) a verifier entity to verify proof of the secret knowledge provided by the proover entity (4) a system for implementing a informatic entities communication method.