scientific article; zbMATH DE number 1303114
From MaRDI portal
Publication:4249629
zbMath0919.94027MaRDI QIDQ4249629
Publication date: 6 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitylower boundsgeneric algorithmsDiffie-Hellman problemcomputational problems in cyclic groupsgeneric reduction of the discrete logarithm problemroots in finite groups
Related Items
Correspondences on Hyperelliptic Curves and Applications to the Discrete Logarithm ⋮ On the analysis of cryptographic assumptions in the generic ring model ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ Homomorphic public-key cryptosystems and encrypting Boolean circuits ⋮ On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols ⋮ Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks ⋮ Generic-group delay functions require hidden-order groups ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ On the Equivalence of Generic Group Models ⋮ Generic groups, collision resistance, and ECDSA ⋮ Public-key cryptography and invariant theory ⋮ On non-Abelian homomorphic public-key cryptosystems ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions ⋮ Cryptography and algorithmic randomness ⋮ The ``Quantum annoying property of password-authenticated key exchange protocols ⋮ On instantiating the algebraic group model from falsifiable assumptions
This page was built for publication:
