Post-quantum cryptography from quantum stabilizer decoding
From MaRDI portal
Cites work
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- A method for obtaining digital signatures and public-key cryptosystems
- An efficient pseudo-random generator provably as secure as syndrome decoding
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Authenticating Pervasive Devices with Human Protocols
- Authentication of quantum messages
- Black holes as mirrors: quantum information in random subsystems
- Breaking rainbow takes a weekend on a laptop
- Breaking SIDH in polynomial time
- Cloning games, black holes and cryptography
- Collision resistant hashing from sub-exponential learning parity with noise
- Cryptographic primitives based on hard learning problems
- Cryptography from learning parity with noise
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- CSIDH: an efficient post-quantum commutative group action
- Efficient fully homomorphic encryption from (standard) LWE
- Efficient quantum pseudorandomness from Hamiltonian phase states
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Hardness of Decoding Quantum Stabilizer Codes
- How to Encrypt with the LPN Problem
- How to Verify a Quantum Computation
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- IPRainbow
- Low-complexity cryptographic hash functions
- More on average case vs approximation complexity
- New Algorithms for Learning in Presence of Errors
- New directions in cryptography
- New results for learning noisy parities and halfspaces
- Noise-tolerant learning, the parity problem, and the statistical query model
- NTRU: A ring-based public key cryptosystem
- On lattices, learning with errors, random linear codes, and cryptography
- On the hardnesses of several quantum decoding problems
- On the inherent intractability of certain coding problems (Corresp.)
- One-wayness in quantum cryptography
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- Post-quantum PKE from unstructured noisy linear algebraic assumptions: beyond LWE and Alekhnovich's LPN
- Quantum computation vs. firewalls
- Quantum cryptography and meta-complexity
- Quantum information theory
- Reduction from sparse LPN to LPN, dual attack 3.0
- Secure communications over insecure channels
- Secure human identification protocols
- Secure multi-party quantum computation with a dishonest majority
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- The learning stabilizers with noise problem
- The relationship between public key encryption and oblivious transfer
- Two-round oblivious transfer from CDH or LPN
- Unitary complexity and the Uhlmann transformation problem
- Universally composable oblivious transfer based on a variant of LPN
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
This page was built for publication: Post-quantum cryptography from quantum stabilizer decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7447185)