Commitments and efficient zero-knowledge proofs from learning parity with noise
From MaRDI portal
Recommendations
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Zero-knowledge proofs for committed symmetric Boolean functions
- scientific article; zbMATH DE number 1559559
- Cryptography from learning parity with noise
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
Cited in
(39)- Memory lower bounds of reductions revisited
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
- A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Zero-knowledge proofs for committed symmetric Boolean functions
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- RLWE-based zero-knowledge proofs for linear and multiplicative relations
- Solving the learning parity with noise's open question
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
- Two-round man-in-the-middle security from LPN
- A lattice-based group signature scheme with message-dependent opening
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- Cryptography from learning parity with noise
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Short zero-knowledge proof of knowledge for lattice-based commitment
- Zero-knowledge proofs from spLWE-based commitments
- Reusable two-round MPC from LPN
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- The security of the code-based signature scheme based on the Stern identification protocol
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Post-quantum plaintext-awareness
- Zero-knowledge range arguments for signed fractional numbers from lattices
- A code-based hybrid signcryption scheme
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- Commitments with efficient zero-knowledge arguments from subset sum problems
- Group encryption: full dynamicity, message filtering and code-based instantiation
- An iterative correction method for practically LPN solving
- Fully dynamic attribute-based signatures for circuits from codes
- Short code-based one-out-of-many proofs and applications
- The hardness of LPN over any integer ring and field for PCG applications
- Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme
- Lattice-based zero-knowledge proofs in action: applications to electronic voting
- Multiparty homomorphic secret sharing and more from LPN and MQ
- Group encryption with oblivious traceability
This page was built for publication: Commitments and efficient zero-knowledge proofs from learning parity with noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911614)
