| 注册
首页|期刊导航|密码学报(中英文)|基于多方混淆电路的常数轮多方私有函数计算方案

基于多方混淆电路的常数轮多方私有函数计算方案

吴伟宁 李宏博 黄建业 黄琼

密码学报(中英文)2024,Vol.11Issue(6):1331-1353,23.
密码学报(中英文)2024,Vol.11Issue(6):1331-1353,23.DOI:10.13868/j.cnki.jcr.000740

基于多方混淆电路的常数轮多方私有函数计算方案

Constant-Round Multi-Party Private Function Evaluation Scheme Based on Multi-Party Garbled Circuit

吴伟宁 1李宏博 1黄建业 2黄琼3

作者信息

  • 1. 华南农业大学 数学与信息学院、软件学院,广州 510642
  • 2. 伍伦贡大学 计算机与信息技术学院,伍伦贡 新南威尔士 2500
  • 3. 华南农业大学 数学与信息学院、软件学院,广州 510642||广州市智慧农业重点实验室,广州 510642
  • 折叠

摘要

Abstract

The purpose of private function evaluation(PFE)is to securely compute a function f(x1,x2,…,xn)without revealing any information other than that revealed by the output,and PFE is suitable for computing multi-party big data analysis tasks of joint dataset whose analysis algorithm f is not conveniently public.Mohassel et al.proposed a passively secure multi-party private function evaluation scheme based on a multi-party secret sharing scheme(GMW)in EUROCRYPT 2013.Their protocol has linear rounds of interaction and is not applicable to high latency networks,which limits the practicality of multi-party private function evaluation.To address such problems,this study utilizes the optimized multi-party garbled circuit BMR scheme proposed by Ben-Efraim et al,the oblivious extended permutation based on homomorphic encryption scheme(HE-OEP)proposed by Mohassel et al.and the oblivious extended permutation based on switching network scheme(SN-OEP)proposed by Katz et al.to achieve circuit protection by hiding the topology of the circuit Cf compiled from the function f and constructing the multi-party private function evaluation protocol ΠBMR-PFE(HE-OEP)based on homomorphic encryption and ΠBMR-PFE(SN-OEP)based on switching network,respectively.Both protocols proposed in this study have a constant rounds of interaction,the former is constructed mainly based on asymmetric cryptographic primitives with linear complexity O(g),and its rounds of interaction can be compressed to 7 rounds of interaction,while the latter is constructed mainly based on symmetric cryptographic primitives construction with complexity O(g log(g)),and its rounds of interaction can be compressed to 8 rounds of interaction.The scheme proposed in this study can resist semi-honest adversaries to corrupt at most n-1 participants,which can effectively protect one's important private data property from data leakage in a protocol execution environment where most of the participants are untrusted.In addition,the protocols proposed in this study has similar communication and computation complexities and rounds of interaction as the protocols proposed by Xu et al.in 2023.When the number of participants starts from 5,the proposed protocols in this study has lower specific communication overhead than their protocols in the number of circuit gates between 210 and 220,while the communication overhead has been the performance bottleneck of the garbled circuit since it was proposed.Therefore,the multi-party private function evaluation scheme based on the multi-party garbled circuit with constant rounds of interaction proposed in this study can effectively improve the efficiency of the multi-party private function evaluation protocol when computing large circuits in a high-latency network environment.

关键词

多方私有函数计算/BMR/OEP/被动安全/常数轮

Key words

multi-party private function evaluation/BMR/OEP/passively secure/constant rounds

分类

信息技术与安全科学

引用本文复制引用

吴伟宁,李宏博,黄建业,黄琼..基于多方混淆电路的常数轮多方私有函数计算方案[J].密码学报(中英文),2024,11(6):1331-1353,23.

基金项目

国家自然科学基金(62272174) (62272174)

广东省基础与应用基础研究重大项目(2019B030302008) (2019B030302008)

广州市科技计划(2024A04J6542)National Natural Science Foundation of China(62272174) (2024A04J6542)

Major Program of Guangdong Basic and Applied Research(2019B030302008) (2019B030302008)

Science and Technology Program of Guangzhou Municipality(2024A04J6542) (2024A04J6542)

密码学报(中英文)

OA北大核心CSTPCD

2095-7025

访问量11
|
下载量0
段落导航相关论文