CryptDough: A Unified Analytics Engine for Secure Multiparty Computation
- URL: http://arxiv.org/abs/2608.17529v1
- Date: Tue, 18 Aug 2026 08:50:49 GMT
- Title: CryptDough: A Unified Analytics Engine for Secure Multiparty Computation
- Abstract summary: CryptDough is a unified analytics engine for secure multiparty computation (MPC)<n>It enables multiple distrusting parties to jointly execute a data analysis pipeline on their private inputs and learn nothing beyond the result.<n>We show that CryptDough generalizes the functionality of state-of-the-art MPC systems and remains competitive on the analytics they support.
- Score: 40.143278251997494
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We present CryptDough, a unified analytics engine for secure multiparty computation (MPC). CryptDough enables multiple distrusting parties to jointly execute a data analysis pipeline on their private inputs and learn nothing beyond the result (e.g., aggregate statistics). Unlike existing MPC solutions that support a single threat model or workload type, CryptDough provides built-in support for cross-domain analytics (relational, time series, ML inference) under various threat models, all within the same system runtime. CryptDough contributes (i) a hierarchical system design that facilitates modularity and extensibility through progressive lowering of abstractions, and (ii) the concept of virtual vectors that enable users to write single-threaded code across all layers of the software stack, while pushing the complexity of communication, parallelization, and memory management down to the execution engine. We show that CryptDough generalizes the functionality of state-of-the-art MPC systems and remains competitive on the analytics they support, often outperforming them by more than $2\times$.
Related papers
- Two-Way Confidential VMs (2cVM): Collaborative Confidential Computing for Mutually Distrustful Parties [2.617654879276715]
Cryptographic approaches such as fully homomorphic encryption and secure multi-party computation provide strong confidentiality.<n>We present the Two-Way Confidential Virtual Machine (2cVM), a two-layer architecture that pairs a hardware trusted execution environment with an intra-workload isolation layer.<n>Unlike regular Confidential Virtual Machines, 2cVM enforces mutual isolation between co-resident workloads, ensuring that participants retain control over their data and code.
arXiv Detail & Related papers (2026-06-09T09:15:15Z) - Heuristic-Based Merging of HPC Traces to Extend Hardware Counter Coverage [0.08399688944263843]
We propose a methodology to merge execution traces from multiple runs, each instrumented with a different set of hardware counters.<n>Our approach matches bursts across executions by analyzing MPI structure, timing, and communication patterns.<n>The output is a new synthetic trace with all merged counters, which can be used both for HPC performance prediction and for conventional performance analysis.
arXiv Detail & Related papers (2026-05-15T10:36:15Z) - Beyond Short-Horizon: VQ-Memory for Robust Long-Horizon Manipulation in Non-Markovian Simulation Benchmarks [96.60530830276281]
RuleSafe is a new articulated manipulation benchmark built upon a scalable LLM-aided simulation framework.<n>VQ-Memory is a compact and structured temporal representation that uses vector-quantized variational autoencoders.
arXiv Detail & Related papers (2026-03-10T11:13:54Z) - Detecting Cryptographically Relevant Software Packages with Collaborative LLMs [0.0]
The move towards crypto-agility and post-quantum cryptography (PQC) requires a reliable inventory of cryptographic assets across heterogeneous IT environments.<n>Our research explores the use of large language models (LLMs) as tools for cryptographic asset discovery.<n>To preserve data privacy, the approach operates on-premises without reliance on external servers.
arXiv Detail & Related papers (2026-03-07T13:24:53Z) - Every Step Counts: Decoding Trajectories as Authorship Fingerprints of dLLMs [63.82840470917859]
We show that the decoding mechanism of dLLMs can be used as a powerful tool for model attribution.<n>We propose a novel information extraction scheme called the Directed Decoding Map (DDM), which captures structural relationships between decoding steps and better reveals model-specific behaviors.
arXiv Detail & Related papers (2025-10-02T06:25:10Z) - Loong: Synthesize Long Chain-of-Thoughts at Scale through Verifiers [103.4410890572479]
We introduce the Loong Project: an open-source framework for scalable synthetic data generation and verification.<n>LoongBench is a curated seed dataset containing 8,729 human-vetted examples across 12 domains.<n>LoongEnv is a modular synthetic data generation environment that supports multiple prompting strategies to produce new question-answer-code triples.
arXiv Detail & Related papers (2025-09-03T06:42:40Z) - MCP-Orchestrated Multi-Agent System for Automated Disinformation Detection [84.75972919995398]
This paper presents a multi-agent system that uses relation extraction to detect disinformation in news articles.<n>The proposed Agentic AI system combines four agents: (i) a machine learning agent (logistic regression), (ii) a Wikipedia knowledge check agent, and (iv) a web-scraped data analyzer.<n>Results demonstrate that the multi-agent ensemble achieves 95.3% accuracy with an F1 score of 0.964, significantly outperforming individual agents and traditional approaches.
arXiv Detail & Related papers (2025-08-13T19:14:48Z) - Decompiling Smart Contracts with a Large Language Model [51.49197239479266]
Despite Etherscan's 78,047,845 smart contracts deployed on (as of May 26, 2025), a mere 767,520 ( 1%) are open source.<n>This opacity necessitates the automated semantic analysis of on-chain smart contract bytecode.<n>We introduce a pioneering decompilation pipeline that transforms bytecode into human-readable and semantically faithful Solidity code.
arXiv Detail & Related papers (2025-06-24T13:42:59Z) - Scalable APT Malware Classification via Parallel Feature Extraction and GPU-Accelerated Learning [0.3277163122167433]
This paper presents a framework for mapping malicious executables to known Persistent Advanced Threat (APT) groups.<n>The main feature of this analysis is the assembly-level instructions present in executables which are also known as opcodes.<n>Traditional and deep learning models are applied to create models capable of classifying malware samples.
arXiv Detail & Related papers (2025-04-22T00:05:05Z) - Reasoning with LLMs for Zero-Shot Vulnerability Detection [0.9208007322096533]
We present textbfVulnSage, a comprehensive evaluation framework and a curated dataset from diverse, large-scale open-source system software projects.<n>The framework supports multi-granular analysis across function, file, and inter-function levels.<n>It employs four diverse zero-shot prompt strategies: Baseline, Chain-of-context, Think, and Think & verify.
arXiv Detail & Related papers (2025-03-22T23:59:17Z) - HasTEE+ : Confidential Cloud Computing and Analytics with Haskell [50.994023665559496]
Confidential computing enables the protection of confidential code and data in a co-tenanted cloud deployment using specialized hardware isolation units called Trusted Execution Environments (TEEs)
TEEs offer low-level C/C++-based toolchains that are susceptible to inherent memory safety vulnerabilities and lack language constructs to monitor explicit and implicit information-flow leaks.
We address the above with HasTEE+, a domain-specific language (cla) embedded in Haskell that enables programming TEEs in a high-level language with strong type-safety.
arXiv Detail & Related papers (2024-01-17T00:56:23Z) - MULTIGAIN 2.0: MDP controller synthesis for multiple mean-payoff, LTL and steady-state constraints [41.94295877935867]
We present MULTIGAIN 2.0, a major extension to the controller synthesis tool MULTIGAIN.
It is built on top of the probabilistic model checker PRISM.
arXiv Detail & Related papers (2023-05-26T08:59:51Z)
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.