Generic Hardness of the Multiple Discrete Logarithm Problem

DOI10.1007/978-3-662-46803-6_27zbMath1371.94661OpenAlexW2406268566MaRDI QIDQ2948404

Aaram Yun

Publication date: 30 September 2015

Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_27

zbMATH Keywords

generic group modelmultiple discrete logarithmsearch-by-hyperplane-queries

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures ⋮ Bootstrapping for approximate homomorphic encryption ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Everybody's a target: scalability in public-key encryption ⋮ DLP in semigroups: algorithms and lower bounds ⋮ The ``Quantum annoying property of password-authenticated key exchange protocols

This page was built for publication: Generic Hardness of the Multiple Discrete Logarithm Problem