arXiv (All)
open access
Amplifying Randomized Encodings & Applications
A randomized encoding for a promise problem is a randomized reduction whose outcome distribution on input $x$ can be simulated within some distance $d$, called privacy, using only one bit of information about $x$: whether it is a YES or NO instance. The encoding is one-sided if this holds only for Y
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
- Can Prompt Anonymity Protect Your Identity From LLM Providers?#1118976
- When Machine Learning Meets Spectrum Sharing Security: Methodologies and Challenges#134004
- Mixture-of-Top-k Attention: Efficient Attention via Scalable Fast Weights#1117316
- FedSHE: privacy preserving and efficient federated learning with adaptive segmented CKKS homomorphic encryption#177253
- An innovative framework for secure data transmission using machine learning based classification and ElGamal encryption with Ramanujan primes.#1151
Record · ID 1061604
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