Distributed Point Functions and Function Secret Sharing

• URL: http://arxiv.org/abs/2607.27696v1
• Date: Thu, 30 Jul 2026 05:27:27 GMT
• Title: Distributed Point Functions and Function Secret Sharing
• Abstract summary: A distributed point function (DPF) is a cryptographic primitive that enables compressed additive sharing of a secret weight-1 vector.<n>The appealing lightweight structure of DPF constructions has enabled a wide range of applications.<n>These include private information retrieval, anonymous messaging, secure computation with preprocessing, and pseudorandom correlation generators.
• Score: 27.58220080323485
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: A distributed point function (DPF) is a cryptographic primitive that enables compressed additive sharing of a secret weight-1 vector (equivalently, a point function) across two or more parties. The appealing lightweight structure of DPF constructions has enabled a wide range of applications. These include private information retrieval, anonymous messaging, secure computation with preprocessing, and pseudorandom correlation generators for expanding small correlated seeds into large pseudorandom instances of cryptographic correlations. In this article, we survey definitions, constructions, and applications of DPFs. We also discuss the extension of DPF to function secret sharing (FSS), which generalizes point functions to support richer function classes. Efficient FSS schemes yield a similar generalization for most of the applications of DPFs.

Related papers

• Information-Theoretic Distributed Point Functions with Shorter Keys [4.8986598953553555]
  A t-private n-server Information-Theoretic Distributed Point Function ((t,n)-ITDPF) allows one to convert any point function f_alpha,beta(x): [N] -> G into n shares (secret keys)<n>This paper constructs a novel share conversion based on the private information retrieval (PIR) of Ghasemi, Kopparty, and Sudan (STOC 2025)
  arXiv  Detail & Related papers  (2026-04-27T12:17:05Z)
• Efficient DPF-based Error-Detecting Information-Theoretic Private Information Retrieval Over Rings [9.893133639294563]
  Authenticated private information retrieval (APIR) is the state-of-the-art error-detecting private information retrieval (ED-PIR)<n>Its finite field structure restricts it to prime-order DPFs, leading to prohibitively large key sizes under information-theoretic settings.<n>This paper proposes a novel ring-based information-theoretic ED-PIR scheme that overcomes these limitations by leveraging prime-power-order information-theoretic DPFs.
  arXiv  Detail & Related papers  (2026-04-01T02:51:51Z)
• DDH-based schemes for multi-party Function Secret Sharing [3.0966075492209715]
  We propose a DDH-based technique reducing the key size of existing multi-party schemes.<n>Our benchmark highlights key sizes up to $10times$ smaller than state-of-the-art schemes.
  arXiv  Detail & Related papers  (2026-03-18T07:48:19Z)
• Deep Randomized Distributed Function Computation (DeepRDFC): Neural Distributed Channel Simulation [6.141945506223323]
  An autoencoder architecture is proposed to minimize the total variation distance between the probability distribution simulated by the AE outputs and an unknown target distribution, using only data samples.<n>Our designs establish deep learning-based RDFC methods and aim to facilitate the use of RDFC methods, especially when the amount of common randomness is limited and strong function computation guarantees are required.
  arXiv  Detail & Related papers  (2026-03-11T13:24:49Z)
• Eliminating Exponential Key Growth in PRG-Based Distributed Point Functions [3.0966075492209715]
  PRG-based multi-party DPFs have struggled with practicality due to key sizes growing exponentially with the number of parties and the field size.<n>Our work addresses this bottleneck by optimizing the PRG-based multi-party DPF scheme of Boyle et al.<n>Our construction is the first PRG-based multi-party DPF scheme with practical key sizes, and provides key up to 3x smaller than the best known multi-party DPF.
  arXiv  Detail & Related papers  (2025-09-26T07:57:24Z)
• A Refreshed Similarity-based Upsampler for Direct High-Ratio Feature Upsampling [54.05517338122698]
  A popular similarity-based feature upsampling pipeline has been proposed, which utilizes a high-resolution feature as guidance.<n>We propose an explicitly controllable query-key feature alignment from both semantic-aware and detail-aware perspectives.<n>We develop a fine-grained neighbor selection strategy on HR features, which is simple yet effective for alleviating mosaic artifacts.
  arXiv  Detail & Related papers  (2024-07-02T14:12:21Z)
• APP-Net: Auxiliary-point-based Push and Pull Operations for Efficient Point Cloud Classification [48.230170172837084]
  Point-cloud-based 3D classification task involves aggregating features from neighbor points. To address these issues, we propose a new local aggregator of linear complexity, coined as APP. We use an online normal estimation module to provide the explainable geometric information to enhance our APP modeling capability.
  arXiv  Detail & Related papers  (2022-05-02T12:21:11Z)
• Beyond the Prototype: Divide-and-conquer Proxies for Few-shot Segmentation [63.910211095033596]
  Few-shot segmentation aims to segment unseen-class objects given only a handful of densely labeled samples. We propose a simple yet versatile framework in the spirit of divide-and-conquer. Our proposed approach, named divide-and-conquer proxies (DCP), allows for the development of appropriate and reliable information.
  arXiv  Detail & Related papers  (2022-04-21T06:21:14Z)
• GFlowNet Foundations [66.69854262276391]
  Generative Flow Networks (GFlowNets) have been introduced as a method to sample a diverse set of candidates in an active learning context. We show a number of additional theoretical properties of GFlowNets.
  arXiv  Detail & Related papers  (2021-11-17T17:59:54Z)
• A^2-FPN: Attention Aggregation based Feature Pyramid Network for Instance Segmentation [68.10621089649486]
  We propose Attention Aggregation based Feature Pyramid Network (A2-FPN) to improve multi-scale feature learning. A2-FPN achieves an improvement of 2.0% and 1.4% mask AP when integrated into the strong baselines such as Cascade Mask R-CNN and Hybrid Task Cascade.
  arXiv  Detail & Related papers  (2021-05-07T11:51:08Z)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)

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.