arXiv (All)
open access
Witness Encryption via Prime-Order Generic Groups
We unconditionally construct witness encryption for NP in the classical generic-group model, using an ordinary cyclic group of prime order. For SAT instances of size $n$, the encryption algorithm runs in time poly$(n)$, and any satisfying assignment can be used to decrypt in poly$(n)$ time with corr
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
- Witness Encryption via Prime-Order Generic Groups#965347
- State-Separation and Hybrid Argument for Circuit Lower Bounds: A Structural Approach Toward P̸=NP#101306
- The dual Burnside process#798668
- The dual Burnside process#797254
- How to Help when it Hurts: ACT Individually (and in Groups)#725000
Record · ID 1012471
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