Towards a classification of non-interactive computational assumptions in cyclic groups
From MaRDI portal
Recommendations
- A classification of computational assumptions in the algebraic group model
- Déjà Q: using dual systems to revisit \(q\)-type assumptions
- On the classification of knowledge-of-exponent assumptions in cyclic groups
- An algebraic framework for Diffie-Hellman assumptions
- Automated analysis of cryptographic assumptions in generic group models
Cited in
(7)- A classification of computational assumptions in the algebraic group model
- Signatures of knowledge for Boolean circuits under standard assumptions
- On the classification of knowledge-of-exponent assumptions in cyclic groups
- Déjà Q: using dual systems to revisit \(q\)-type assumptions
- On the concrete security of BBS/BBS+ signatures
- Ba\textit{loo}: algebraic lookup arguments
- Revisiting discrete logarithm reductions
This page was built for publication: Towards a classification of non-interactive computational assumptions in cyclic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1703915)