arXiv (OAI Expanded)
open access
Trinqet: Private Triangle and Quadrangle Counting over Distributed Graphs
Triangle and quadrangle counts are core statistics in graph analysis. Yet many real-world graphs are distributed across multiple parties and encode highly sensitive relationships, precluding direct data sharing. Secure multi-party computation (MPC) provides a principled alternative, but introduces a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- BRAID: Learning Equilibrium Maps in Interdependent Security Games via Weight-Tied Iterative Graph Neural Networks#609277
- Common pairs of graphs#628826
- Geometric Data Perturbation with Noisy-Anchor Alignment for Privacy-Preserving Collaborative Learning#1156448
- It is not (only) about privacy: How multi-party computation redefines control, trust, and risk in data sharing#679127
- Zeros of the independence polynomial on recursive sequences of graphs#1129703
Record · ID 1084663
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive