Pages that link to "Item:Q1606932"
From MaRDI portal
The following pages link to Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring (Q1606932):
Displaying 9 items.
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Efficient selective identity-based encryption without random oracles (Q656924) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- On the complexity of the discrete logarithm and Diffie-Hellman problems (Q1827563) (← links)
- The RSA group is pseudo-free (Q2267366) (← links)
- A Digital Signature Scheme Based on Two Hard Problems (Q2790443) (← links)
- Oblivious signature-based envelope (Q5917932) (← links)
- Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)