arXiv (All)
open access
On the generic structures of the protocols for quantum auction and quantum summation and their relation
Secure multi-party computation (SMC) addresses the problem of jointly computing global functions of private inputs while revealing minimal information about individual data. Two prominent examples of SMC tasks are sealed-bid auction and secure multi-party summation. Existing schemes for quantum auct
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
- Quantum Secret Sharing with a Helper and Programmable Access Structures#819683
- Quantum Secret Sharing with a Helper and Programmable Access Structures#809687
- Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation#1154550
- Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation#1136751
- Characterization-free classification and identification of the environment between two quantum players#1155126
Record · ID 1156405
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