Re-randomize and extract: a novel commitment construction framework based on group actions
From MaRDI portal
Cites work
- \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist
- A note on the graph isomorphism counting problem
- A note on unimodular lattices with trivial automorphism groups
- Automata, Languages and Programming
- Bit commitment using pseudorandomness
- CCA security and trapdoor functions via key-dependent-message security
- Classical hardness of learning with errors
- Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
- Cryptanalysis of rank-2 module-LIP with symplectic automorphisms
- Cryptographic group actions and applications
- CSIDH: an efficient post-quantum commutative group action
- Dense and smooth lattices in any genus
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- General linear group action on tensors: a candidate for post-quantum cryptography
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- How to construct constant-round zero-knowledge proof systems for NP
- How to construct quantum FHE, generically
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 503244 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- Hull attacks on the lattice isomorphism problem
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
- Lattice-based signatures with tight adaptive corruptions and more
- Lattices with symmetry
- Leftover Hash Lemma, Revisited
- LESS is more: code-based signatures without syndromes
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- Non-interactive commitment from non-transitive group actions
- On the lattice isomorphism problem
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Positive definite unimodular lattices with trivial automorphism groups
- Practical and provably-secure commitment schemes from collision-free hashing
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Properties of lattice isomorphism as a cryptographic group action
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme
- Some NP-Complete Problems Similar to Graph Isomorphism
- Trapdoors for hard lattices and new cryptographic constructions
This page was built for publication: Re-randomize and extract: a novel commitment construction framework based on group actions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897184)
