Importance

Loading Importance Indicators...

Abstract

A cryptographic decision-making of set membership is a method or system which make a secure decision-making for positive membership e∈S or negative membership e∉S in an unforgeable and non-repudiation way for any element e and a set S. The proposed method of the present invention comprises: acquire a set U={e₁, . . . , e_n} and map each element e_i in U into a random point v_i in a cryptography space; acquire a set S={e′₁, . . . , e′_m}⊂U, determine a random point v′_i corresponding to each element e′_i in the set S, and construct a function ƒ_S(x) according to all random points v′_i; introduce a random secret γ to generate ƒ_S(γ) by using the function ƒ_S(x), and produce a public parameter mpk according to the random secret γ; and generate the cryptographic representation of set S by using the function ƒ_S(γ) and the public parameter mpk. In the embodiments, we provide two kinds of cryptographic representations of set, including Poles-based Aggregation and Zeros-based Aggregation, to make the decision on positive membership e_i∈S and negative membership e_i∉S.

Loading the Abstract Image...

First Claim