Trusted Hardware Acceleration for Function Secret Sharing

• URL: http://arxiv.org/abs/2608.16223v1
• Date: Mon, 17 Aug 2026 07:58:46 GMT
• Title: Trusted Hardware Acceleration for Function Secret Sharing
• Abstract summary: We present the distributed function accelerator (DFA), a hardware accelerator that targets the dominant primitive in FSS: distributed point function (DPF) generation and evaluation.<n>In untrusted mode, DFA serves as a pure accelerator for DPF evaluation, improving throughput and energy efficiency without changing the protocol.<n>In trusted mode, it further enables local, on-the-fly key generation, eliminating key distribution, and reducing storage and data movement overheads.
• Score: 13.229663073793867
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Function secret sharing (FSS) is a core building block for privacy-preserving systems such as secure inference and private information retrieval (PIR), but incurs significant overhead in key generation, communication, and data movement.We present the distributed function accelerator (DFA), a hardware accelerator that targets the dominant primitive in FSS: distributed point function (DPF) generation and evaluation. DFA combines a high-throughput fixed-function engine for AES-based pseudorandom number generation with a lightweight programmable unit for protocol-specific logic. In untrusted mode, DFA serves as a pure accelerator for DPF evaluation, improving throughput and energy efficiency without changing the protocol. In trusted mode, it further enables local, on-the-fly key generation, eliminating key distribution, and reducing storage and data movement overheads. Across representative workloads, DFA achieves a reduction of 10X end-to-end latency, a reduction of up to 20X communication and more than 5X energy savings for secure inference; and an improvement of 5X throughput and 10X energy reduction for PIR, with modest hardware cost.

Related papers

• PHAT: PHotonic Accelerator for TFHE [3.1535866873383527]
  Homomorphic Encryption (FHE) enables computation on encrypted data, making it a promising solution for privacy-preserving applications in the cloud.<n>FHE over the Torus (TFHE) stands out due to its support for arbitrary operations.<n>We introduce a novel electro-photonic accelerator architecture optimized for TFHE, featuring OPCM-based FFT units, a twiddle-stationary dataflow tailored for OPCM, and a scheduling mechanism.
  arXiv  Detail & Related papers  (2026-09-10T14:30:27Z)
• Faster Than Flash: Exploiting Attention Sparsity for Efficient Long-Context Decoding [51.48425605758328]
  We present Faster Flash Decoding (FFD), a novel hardware-algorithm co-design framework designed to break the memory wall in long-context decoding.<n>FFD integrates the selector and computer into a fully fused kernel, replacing external metadata indices with content-aware scanning.<n>It achieves up to 11.6x kernel-level speedup and scaling to 256K context length, with 2.37x end-to-end throughput improvement.
  arXiv  Detail & Related papers  (2026-08-31T15:13:20Z)
• Secure Authentication in Wireless IoT: Hamming Code Assisted SRAM PUF as Device Fingerprint [3.5816744712666075]
  This work demonstrates a threshold-based authentication proof of concept for constrained Industrial Internet of Things (IIoT) devices.<n>The proposed scheme can reliably cap the post-authentication bit error rate (BER) below 1 %.<n>Inherent PUF unreliability is addressed by a resource-efficient combination of Hamming code (HC) Error Correction (EC) and Temporal Majority Voting (TMV)
  arXiv  Detail & Related papers  (2026-04-17T08:09:02Z)
• 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)
• Hardware-Friendly Randomization: Enabling Random-Access and Minimal Wiring in FHE Accelerators with Low Total Cost [0.0]
  Ring-Learning With Errors problem forms the backbone of efficient encryption schemes.<n>A technique in reducing this overhead generates $a$ from a small seed on the client side via a deterministic process.<n>We detail the benefits of our approach, which maintains the reduction in communication latency and memory footprint.
  arXiv  Detail & Related papers  (2026-02-23T06:49:32Z)
• HHEML: Hybrid Homomorphic Encryption for Privacy-Preserving Machine Learning on Edge [4.623074730653607]
  Privacy-preserving machine learning (PPML) is an emerging topic to handle secure machine learning inference over sensitive data in untrusted environments.<n>Fully homomorphic encryption (FHE) enables computation directly on encrypted data on the server side, but it introduces significant communication and computation overhead on the client side.<n>HHE addresses this limitation by combining symmetric encryption (SE) with FHE to reduce the computational cost on the client side.<n>Our work proposes a hardware-accelerated HHE architecture built around a lightweight symmetric cipher optimized for FHE compatibility.
  arXiv  Detail & Related papers  (2025-10-23T05:51:55Z)
• High-Energy Concentration for Federated Learning in Frequency Domain [62.90597472173119]
  We propose a novel Frequency-Domain aware FL method with high-energy concentration (FedFD) to address this problem.<n>FedFD is inspired by the discovery that the discrete cosine transform predominantly distributes energy to specific regions, referred to as high-energy concentration.<n>On five image and speech datasets, FedFD achieves superior performance than state-of-the-art methods while reducing communication costs.
  arXiv  Detail & Related papers  (2025-09-16T03:49:26Z)
• RISecure-PUF: Multipurpose PUF-Driven Security Extensions with Lookaside Buffer in RISC-V [12.294919757082608]
  RISecure-PUF is a security extension utilizing existing Physical Unclonable Functions. A one-way hash function is integrated to ensure provable security against modeling attacks. RISecure-PUF improves at least $2.72times$ in batch scenarios with negligible hardware overhead.
  arXiv  Detail & Related papers  (2024-11-21T11:26:23Z)
• Neuromorphic Split Computing with Wake-Up Radios: Architecture and Design via Digital Twinning [97.99077847606624]
  This work proposes a novel architecture that integrates a wake-up radio mechanism within a split computing system consisting of remote, wirelessly connected, NPUs. A key challenge in the design of a wake-up radio-based neuromorphic split computing system is the selection of thresholds for sensing, wake-up signal detection, and decision making.
  arXiv  Detail & Related papers  (2024-04-02T10:19:04Z)
• Transforming Image Super-Resolution: A ConvFormer-based Efficient Approach [58.57026686186709]
  We introduce the Convolutional Transformer layer (ConvFormer) and propose a ConvFormer-based Super-Resolution network (CFSR) CFSR inherits the advantages of both convolution-based and transformer-based approaches. Experiments demonstrate that CFSR strikes an optimal balance between computational cost and performance.
  arXiv  Detail & Related papers  (2024-01-11T03:08:00Z)
• Computation Offloading and Resource Allocation in F-RANs: A Federated Deep Reinforcement Learning Approach [67.06539298956854]
  fog radio access network (F-RAN) is a promising technology in which the user mobile devices (MDs) can offload computation tasks to the nearby fog access points (F-APs)
  arXiv  Detail & Related papers  (2022-06-13T02:19:20Z)
• Federated Learning for Energy-limited Wireless Networks: A Partial Model Aggregation Approach [79.59560136273917]
  limited communication resources, bandwidth and energy, and data heterogeneity across devices are main bottlenecks for federated learning (FL) We first devise a novel FL framework with partial model aggregation (PMA) The proposed PMA-FL improves 2.72% and 11.6% accuracy on two typical heterogeneous datasets.
  arXiv  Detail & Related papers  (2022-04-20T19:09:52Z)
• EdgeBERT: Sentence-Level Energy Optimizations for Latency-Aware Multi-Task NLP Inference [82.1584439276834]
  Transformer-based language models such as BERT provide significant accuracy improvement for a multitude of natural language processing (NLP) tasks. We present EdgeBERT, an in-depth algorithm- hardware co-design for latency-aware energy optimization for multi-task NLP.
  arXiv  Detail & Related papers  (2020-11-28T19:21:47Z)

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.