Model: GGM (Generic Group Model)
Statements with model: ggm. This page only exists because at least one statement currently uses this value – if you add a statement with a new model value not listed under Problems, copy this page as the starting point for its facet page (see CONTRIBUTING.md).
| Status | Statement | Tags |
|---|---|---|
|
Four-party NIKE, quadratic, Maurer’s model Open. Achieved in Shoup’s generic group model by the source paper (Construction 9, Theorem 10); in Maurer’s model the paper’s own O(n^2) attack sets a ceiling that a construction would meet exactly, and nothing is known about reaching it. 5 open |
ggmseparationresearch-opennew-idea (ai) | |
|
Quadratic attack on 3-NIKE, Shoup’s model Open in Shoup’s model. Settled by the source paper in Maurer’s model for every K at least 3, including imperfect correctness; its own three-party Shoup construction achieves only an n^1.5 gap, so the truth for three parties lies somewhere between n^1.5 and n^2. 5 open |
ggmlower-boundresearch-opennew-idea (ai) | |
|
Groth16 optimality (pure GGM) Open: whether every sound, non-interactive, publicly verifiable pairing-based argument in the pure generic group model needs at least three group elements, matching Groth16. 2 open |
ggmtight-boundresearch-opennew-idea (ai) | |
|
No round-optimal pairing-free blind signature Open for a polynomial query budget. The impossibility is proved when User_2 and Verify together make O(log lambda) random-oracle queries, including when oracle outputs contain group elements; the superpolynomial message space hypothesis is retained. 5 open |
ggmimpossibilityresearch-openadaptation (ai) |
No matching items