The distinction between fixed and random generators in group-based assumptions
From MaRDI portal
Publication:2305002
DOI10.1007/978-3-030-26951-7_27OpenAlexW2967236513MaRDI QIDQ2305002
Fermi Ma, James Bartusek, Mark Zhandry
Publication date: 9 March 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26951-7_27
Related Items (11)
The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Full quantum equivalence of group action DLog and CDH, and more ⋮ Redeeming reset indifferentiability and applications to post-quantum security ⋮ Augmented random oracles ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ Generic hardness of inversion on ring and its relation to self-bilinear map ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Everybody's a target: scalability in public-key encryption ⋮ A classification of computational assumptions in the algebraic group model
This page was built for publication: The distinction between fixed and random generators in group-based assumptions
