A Protocol for a Private Set-Operation

• 作 者: 李荣花 武传坤
• 机 构: State Key Laboratory of Information Securitg Institute of Software,Chinese Academy of Sciences,State
• 出 处: Journal of Computer Science & Technology
• 发表日期: 2007年06期
• 关键词: parties secure secret private party otherwise owning encryption sharing leader

A new private set-operation problem is proposed.Suppose there are n parties with each owning a secret set.Let one of them,say P,be the leader,S be P’s secret set,and t(less than n—1)be a threshold value.For each element w of S,if w appears more than t times in the rest parties’ sets,then P learns which parties’ sets include w, otherwise P cannot know whether w appears in any party’s set.For this problem,a secure protocol is proposed in the senti-honest model based on semantically secure homomorphic encryption scheme,secure sharing scheme,and the polynomial representation of sets.The protocol only needs constant rounds of communication.

A new private set-operation problem is proposed. Each of the parties with each owning a secret set. Let one of them, say P, be the leader, S be P secret set, and t (less than n-1) be a threshold value. For each element w of S, if w appears more than t times in the rest party ’sets, then P learns which parties’ sets include w, otherwise P can not know whether w appears in any party’s set.For this problem , a secure protocol is proposed in the senti-honest model based on semantically secure homomorphic encryption scheme, secure sharing scheme, and the polynomial representation of sets. The protocol only needs constant rounds of communication.