arXiv (All)
open access
Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits
We propose the notion of succinct oblivious tensor evaluation (OTE), where two parties compute an additive secret sharing of a tensor product of two vectors $\mathbf{x} \otimes \mathbf{y}$, exchanging two simultaneous messages. Crucially, the size of both messages and of the CRS is independent of th
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
- Standing Algebra Σᴿ: A Domain-Agnostic Closure-Theoretic Framework for Admissibility Enforcement Under Structural Invariants#31447
- Guaranteed Tensor Recovery Fused Low-rankness and Smoothness#651986
- Guaranteed Tensor Recovery Fused Low-rankness and Smoothness#650533
- A Hyper-Relation Characterization of Weak Pseudo-Rationalizability#770583
- Streaming Belief Propagation on Mixed-Alphabet Tanner Graphs for Practical Quantum Memory#925028
Record · ID 1143613
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