Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials

• URL: http://arxiv.org/abs/2104.12163v1
• Date: Sun, 25 Apr 2021 13:48:16 GMT
• Title: Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials
• Abstract summary: Homomorphic secret sharing (HSS) allows multiple input clients to secret-share their data among multiple servers. Our scheme could be 3-10 times faster than the previously best construction.
• Score: 3.419406971620478
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Homomorphic secret sharing (HSS) allows multiple input clients to secret-share their data among multiple servers such that each server is able to locally compute a function on its shares to obtain a partial result and all partial results enable the reconstruction of the function's value on the outsourced data by an output client. The existing HSS schemes for {\em high-degree} polynomials either {\em require a large number of servers} or {\em lack verifiability}, which is essential for ensuring the correctness of the outsourced computations. In this paper, we propose a two-server verifiable HSS (VHSS) model and construct a scheme that supports the computation of high-degree polynomials. The degree of the outsourced polynomials can be as high as a polynomial in the system's security parameter. Despite of using only 2 servers, our VHSS ensures that each single server learns no information about the outsourced data and no single server is able to persuade the client to output a wrong function value. Our VHSS is significantly more efficient. When computing degree-7 polynomials, our scheme could be 3-10 times faster than the previously best construction.

Related papers

• On the Context-Hiding Property of Shamir-Based Homomorphic Secret Sharing [8.944044445529766]
  Homomorphic secret sharing (HSS) allows multiple input clients to secretly share their private inputs to a function among several servers.<n>Security requires that the output shares leak no more information about the inputs than the function output.<n>We formalize the context-hiding property of HSS for individual functions, and extend the study to monomials.
  arXiv  Detail & Related papers  (2025-12-01T12:23:19Z)
• Prototype-Based Information Compensation Network for Multi-Source Remote Sensing Data Classification [56.065032039986725]
  Multi-source remote sensing data joint classification aims to provide accuracy and reliability of land cover classification.<n>Existing methods confront two challenges: inter-frequency multi-source feature coupling and inconsistency of complementary information exploration.<n>We present a Prototype-based Information Compensation Network (PICNet) for land cover classification based on HSI and SAR/LiDAR data.
  arXiv  Detail & Related papers  (2025-05-06T22:30:23Z)
• zkVC: Fast Zero-Knowledge Proof for Private and Verifiable Computing [22.9161853847536]
  cryptographic method known as Zero-Knowledge Proof (ZKP) is renowned for facilitating private and verifiable computing. ZkVC integrates optimized ZKP modules, such as Constraint-reduced Polynomial Circuit (CRPC) and Prefix-Sum Query (PSQ) Code is available at https://github.com/UCF-Lou-Lab-PET/zkformer.
  arXiv  Detail & Related papers  (2025-04-16T16:11:11Z)
• Efficient Homomorphically Encrypted Convolutional Neural Network Without Rotation [6.03124479597323]
  This paper proposes a novel reformulated joint procedure and a new filter coefficient packing scheme to eliminate ciphertext rotations without affecting the security of the HE scheme. For various plain-20s over the CIFAR-10/100 datasets, our design reduces the running time of the Conv and FC layers by 15.5% and the communication cost between client and server by more than 50%, compared to the best prior design.
  arXiv  Detail & Related papers  (2024-09-08T19:46:25Z)
• A Characterization of Optimal-Rate Linear Homomorphic Secret Sharing Schemes, and Applications [13.566464121222225]
  Homomorphic Secret Sharing (HSS) scheme is a secret-sharing scheme that shares a secret $x$ among $s$ servers. A key parameter in HSS schemes is download rate, which quantifies how much information the output client needs to download from each server. We show that -- perhaps surprisingly -- the set of $ell$'s for which their construction works is in fact nearly optimal.
  arXiv  Detail & Related papers  (2023-11-24T20:40:50Z)
• Scalable Collaborative Learning via Representation Sharing [53.047460465980144]
  Federated learning (FL) and Split Learning (SL) are two frameworks that enable collaborative learning while keeping the data private (on device) In FL, each data holder trains a model locally and releases it to a central server for aggregation. In SL, the clients must release individual cut-layer activations (smashed data) to the server and wait for its response (during both inference and back propagation). In this work, we present a novel approach for privacy-preserving machine learning, where the clients collaborate via online knowledge distillation using a contrastive loss.
  arXiv  Detail & Related papers  (2022-11-20T10:49:22Z)
• Fast Private Parameter Learning and Evaluation for Sum-Product Networks [4.189643331553922]
  We show how to learn the weights for the sum nodes, assuming the architecture is fixed, and the data is horizontally partitioned between multiple parties. The computations will preserve the privacy of each participant. We also show how simple and private evaluations can be performed using the learned SPN.
  arXiv  Detail & Related papers  (2021-04-15T10:21:51Z)
• CoPE: Conditional image generation using Polynomial Expansions [50.67390290190874]
  We introduce a general framework, called CoPE, that enables an expansion of two input variables and captures their auto- and cross-correlations. CoPE is evaluated in five tasks (class-generation, inverse problems, edges-to-image translation, image-to-image translation, attribute-guided generation) involving eight datasets. The thorough evaluation suggests that CoPE can be useful for tackling diverse conditional generation tasks.
  arXiv  Detail & Related papers  (2021-04-11T19:02:37Z)
• Solving Mixed Integer Programs Using Neural Networks [57.683491412480635]
  This paper applies learning to the two key sub-tasks of a MIP solver, generating a high-quality joint variable assignment, and bounding the gap in objective value between that assignment and an optimal one. Our approach constructs two corresponding neural network-based components, Neural Diving and Neural Branching, to use in a base MIP solver such as SCIP. We evaluate our approach on six diverse real-world datasets, including two Google production datasets and MIPLIB, by training separate neural networks on each.
  arXiv  Detail & Related papers  (2020-12-23T09:33:11Z)
• Efficient Human Pose Estimation by Learning Deeply Aggregated Representations [67.24496300046255]
  We propose an efficient human pose estimation network (DANet) by learning deeply aggregated representations. Our networks could achieve comparable or even better accuracy with much smaller model complexity.
  arXiv  Detail & Related papers  (2020-12-13T10:58:07Z)
• On Polynomial Approximations for Privacy-Preserving and Verifiable ReLU Networks [6.130998208629276]
  We propose a degree-2 activation function with a first order term and empirically show that it can lead to much better models. Our proposed function improves the test accuracy by up to 10.4% compared to the square function.
  arXiv  Detail & Related papers  (2020-11-11T03:32:22Z)
• Berrut Approximated Coded Computing: Straggler Resistance Beyond Polynomial Computing [34.69732430310801]
  We propose Berrut Approximated Coded Computing (BACC) as an alternative approach to deal with stragglers effect. BACC is proven to be numerically stable with low computational complexity. In particular, BACC is used to train a deep neural network on a cluster of servers.
  arXiv  Detail & Related papers  (2020-09-17T14:23:38Z)
• Deep Polynomial Neural Networks [77.70761658507507]
  $Pi$Nets are a new class of function approximators based on expansions. $Pi$Nets produce state-the-art results in three challenging tasks, i.e. image generation, face verification and 3D mesh representation learning.
  arXiv  Detail & Related papers  (2020-06-20T16:23:32Z)
• Faster Secure Data Mining via Distributed Homomorphic Encryption [108.77460689459247]
  Homomorphic Encryption (HE) is receiving more and more attention recently for its capability to do computations over the encrypted field. We propose a novel general distributed HE-based data mining framework towards one step of solving the scaling problem. We verify the efficiency and effectiveness of our new framework by testing over various data mining algorithms and benchmark data-sets.
  arXiv  Detail & Related papers  (2020-06-17T18:14:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.