Ciphergpt: Secure two-party gpt inference

X Hou, J Liu, J Li, Y Li, W Lu, C Hong… - Cryptology ePrint …, 2023 - eprint.iacr.org
ChatGPT is recognized as a significant revolution in the field of artificial intelligence, but it
raises serious concerns regarding user privacy, as the data submitted by users may contain …

Verifiable distributed aggregation functions

H Davis, C Patton, M Rosulek… - Cryptology ePrint …, 2023 - eprint.iacr.org
The modern Internet is built on systems that incentivize collection of information about users.
In order to minimize privacy loss, it is desirable to prevent these systems from collecting …

FOLEAGE: OLE-Based Multi-party Computation for Boolean Circuits

M Bombar, D Bui, G Couteau, A Couvreur… - … Conference on the …, 2025 - Springer
Abstract Secure Multi-party Computation (MPC) allows two or more parties to compute any
public function over their privately-held inputs, without revealing any information beyond the …

More Efficient Zero-Knowledge Protocols over  via Galois Rings

F Lin, C Xing, Y Yao - Annual International Cryptology Conference, 2024 - Springer
A recent line of works on zero-knowledge (ZK) protocols with a vector oblivious linear
function evaluation (VOLE)-based offline phase provides a new paradigm for scalable ZK …

Faster Signatures from MPC-in-the-Head

D Bui, E Carozza, G Couteau, D Goudarzi… - … Conference on the Theory …, 2025 - Springer
Faster Signatures from MPC-in-the-Head | SpringerLink Skip to main content Advertisement
Springer Nature Link Account Menu Find a journal Publish with us Track your research Search …

MPC in the head using the subfield bilinear collision problem

J Huth, A Joux - Annual International Cryptology Conference, 2024 - Springer
MPC in the Head Using the Subfield Bilinear Collision Problem | SpringerLink Skip to main
content Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …

Efficient arithmetic in garbled circuits

D Heath - Annual International Conference on the Theory and …, 2024 - Springer
Garbled Circuit (GC) techniques usually work with Boolean circuits. Despite intense interest,
efficient arithmetic generalizations of GC were only known from strong assumptions, such as …

Leakage-Resilient Circuit Garbling

R Li, Y Sun, C Guo, FX Standaert, W Wang… - Proceedings of the 2024 …, 2024 - dl.acm.org
Due to the ubiquitous requirements and performance leap in the past decade, it has become
feasible to execute garbling and secure computations in settings sensitive to side-channel …

Ramen: Souper fast three-party computation for ram programs

L Braun, M Pancholi, R Rachuri, M Simkin - Proceedings of the 2023 …, 2023 - dl.acm.org
Secure RAM computation allows a number of parties to evaluate a function represented as a
random-access machine (RAM) program in a way that reveals nothing about the private …

: Shorter Signatures from Regular Syndrome Decoding and VOLE-in-the-Head

H Cui, H Liu, D Yan, K Yang, Y Yu, K Zhang - … International Conference on …, 2024 - Springer
We present ReSolveD, a new candidate post-quantum signature scheme under the regular
syndrome decoding (RSD) assumption for random linear codes, which is a well-established …