The following pages link to (Q4249629):
Displaying 16 items.
- On the complexity of the discrete logarithm and Diffie-Hellman problems (Q1827563) (← links)
- Generic-group delay functions require hidden-order groups (Q2055651) (← links)
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions (Q2102077) (← links)
- The ``Quantum annoying'' property of password-authenticated key exchange protocols (Q2118533) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Cryptography and algorithmic randomness (Q2354584) (← links)
- On the analysis of cryptographic assumptions in the generic ring model (Q2377063) (← links)
- Homomorphic public-key cryptosystems and encrypting Boolean circuits (Q2432559) (← links)
- Generic groups, collision resistance, and ECDSA (Q2572964) (← links)
- Public-key cryptography and invariant theory (Q2577586) (← links)
- On non-Abelian homomorphic public-key cryptosystems (Q2577587) (← links)
- Correspondences on Hyperelliptic Curves and Applications to the Discrete Logarithm (Q2902925) (← links)
- Efficiency Limitations for Σ-Protocols for Group Homomorphisms (Q3408215) (← links)
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks (Q4933209) (← links)
- On the Equivalence of Generic Group Models (Q5505469) (← links)
- On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (Q5744697) (← links)
