Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
From MaRDI portal
Publication:4911614
DOI10.1007/978-3-642-34961-4_40zbMath1292.94082OpenAlexW1593955619MaRDI QIDQ4911614
Krzysztof Pietrzak, Stephan Krenn, Aris Tentes, Abhishek Jain
Publication date: 19 March 2013
Published in: Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-34961-4_40
Related Items (26)
Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ Cryptography from Learning Parity with Noise ⋮ Memory lower bounds of reductions revisited ⋮ Reusable Two-Round MPC from LPN ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ 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 ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Solving the learning parity with noise's open question ⋮ CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ Unnamed Item ⋮ A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions ⋮ Two-Round Man-in-the-Middle Security from LPN ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ A Lattice-Based Group Signature Scheme with Message-Dependent Opening ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ 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 proofs for committed symmetric Boolean functions
This page was built for publication: Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
