Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

POTA: A Pipelined Oblivious Transfer Acceleration Architecture for Secure Multi-Party Computation

View through CrossRef
With the rapid development and deployment of machine learning (ML) and big data technologies, which rely heavily on sensitive user data for training and inference, ensuring privacy and data security has become a pressing challenge. Addressing this issue requires methods that safeguard sensitive information while maintaining the correctness of computational results. Secure multi-party computation (MPC), as a representative application of cryptographic techniques, offers a technical solution to this challenge by enabling privacy-preserving computations. It has been widely applied in scenarios such as cloud-based inference and other privacy-sensitive tasks. However, MPC also introduces significant performance overhead, thus limiting its further application. Our analysis reveals that the foundational element of MPC, the oblivious transfer (OT) protocol collectively account for up to 96.64% of the execution time. It is because the OT protocols are constrained by low network band- width and weak compute engines. To address these challenges, we propose POTA, a high-performance pipelined OT hardware acceleration architecture supporting the silent OT protocol. In the POTA design, we develop efficient subsystems targeting the two most compute-intensive parts: the construction of puncturable pseudoran- dom function (PPRF), and large matrix-vector multiplications under the learning parity with noise (LPN) assumption within the silent OT protocol. In addition, to address the performance overhead caused by data transfer between POTA and the host CPU, we design a host-accelerator execution pipeline to hide the considerable transmission latency. Furthermore, we design a modular multiplication module over a finite field to generate the more complex correlations required by MPC protocols. Finally, we implement a POTA prototype on Xilinx VCU129 FPGAs. Experimental results demonstrate that under various network settings, POTA achieves significant speedups, with maximum improvements of 192.57x for basic operations and 597.57x for convolutional neural networks (CNN).
Title: POTA: A Pipelined Oblivious Transfer Acceleration Architecture for Secure Multi-Party Computation
Description:
With the rapid development and deployment of machine learning (ML) and big data technologies, which rely heavily on sensitive user data for training and inference, ensuring privacy and data security has become a pressing challenge.
Addressing this issue requires methods that safeguard sensitive information while maintaining the correctness of computational results.
Secure multi-party computation (MPC), as a representative application of cryptographic techniques, offers a technical solution to this challenge by enabling privacy-preserving computations.
It has been widely applied in scenarios such as cloud-based inference and other privacy-sensitive tasks.
However, MPC also introduces significant performance overhead, thus limiting its further application.
Our analysis reveals that the foundational element of MPC, the oblivious transfer (OT) protocol collectively account for up to 96.
64% of the execution time.
It is because the OT protocols are constrained by low network band- width and weak compute engines.
To address these challenges, we propose POTA, a high-performance pipelined OT hardware acceleration architecture supporting the silent OT protocol.
In the POTA design, we develop efficient subsystems targeting the two most compute-intensive parts: the construction of puncturable pseudoran- dom function (PPRF), and large matrix-vector multiplications under the learning parity with noise (LPN) assumption within the silent OT protocol.
In addition, to address the performance overhead caused by data transfer between POTA and the host CPU, we design a host-accelerator execution pipeline to hide the considerable transmission latency.
Furthermore, we design a modular multiplication module over a finite field to generate the more complex correlations required by MPC protocols.
Finally, we implement a POTA prototype on Xilinx VCU129 FPGAs.
Experimental results demonstrate that under various network settings, POTA achieves significant speedups, with maximum improvements of 192.
57x for basic operations and 597.
57x for convolutional neural networks (CNN).

Related Results

Quantum Universally Composable Oblivious Linear Evaluation
Quantum Universally Composable Oblivious Linear Evaluation
Oblivious linear evaluation is a generalization of oblivious transfer, whereby two distrustful parties obliviously compute a linear function, f(x)=ax+b, i.e., each one provides the...
Desenvolupament i Caracterització d'un Accionament Rotatiu per a les Potes d'un Robot Caminador. Estudi de l'Eficiència Energètica
Desenvolupament i Caracterització d'un Accionament Rotatiu per a les Potes d'un Robot Caminador. Estudi de l'Eficiència Energètica
Els robots caminadors presenten alguns avantatges respecte als tradicionals robots mòbils amb rodes, que es resumeixen en major mobilitat i capacitat de superació d'obstacles. Un d...
The architecture of differences
The architecture of differences
Following in the footsteps of the protagonists of the Italian architectural debate is a mark of culture and proactivity. The synthesis deriving from the artistic-humanistic factors...
Women in Australian Politics: Maintaining the Rage against the Political Machine
Women in Australian Politics: Maintaining the Rage against the Political Machine
Women in federal politics are under-represented today and always have been. At no time in the history of the federal parliament have women achieved equal representation with men. T...
Pota metalürjisinde oluşan pota cürufunun kolemanit ile ıslahı
Pota metalürjisinde oluşan pota cürufunun kolemanit ile ıslahı
Bu çalışma da demir çelik üretiminde pota metalurjisinde (II. Metalurji) oluşan cürufun, kolemanit kullanılarak ıslahı için endüstriyel çalışma anlatılmış ve sonuçları paylaşılmışt...
Party Law-Making
Party Law-Making
The article assesses the possibility of the party›s participation in law-making. It is established that the understanding of law-making as the activity of the state to create and a...
Reinventing the Party Wall - For Quality City Living
Reinventing the Party Wall - For Quality City Living
<p><b>The party wall is a commonly used building element that is rarely exploited to its full potential due to structural and legal complications. The party wall was in...
A Secure and Lightweight Multi-Party Private Intersection-Sum Scheme over a Symmetric Cryptosystem
A Secure and Lightweight Multi-Party Private Intersection-Sum Scheme over a Symmetric Cryptosystem
A private intersection-sum (PIS) scheme considers the private computing problem of how parties jointly compute the sum of associated values in the set intersection. In scenarios su...

Back to Top