Commitments with efficient zero-knowledge arguments from subset sum problems
From MaRDI portal
Publication:6550619
DOI10.1007/978-3-031-50594-2_10MaRDI QIDQ6550619
Publication date: 5 June 2024
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- A discrete logarithm implementation of perfect zero-knowledge blobs
- Minimum disclosure proofs of knowledge
- Improved low-density subset sum algorithms
- More efficient commitments from structured lattice assumptions
- Practical product proofs for lattice commitments
- Efficient cryptographic schemes provably as secure as subset sum
- Improved classical and quantum algorithms for subset-sum
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Universally composable two-party and multi-party secure computation
- The Knowledge Complexity of Interactive Proof Systems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
- Hiding information and signatures in trapdoor knapsacks
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
This page was built for publication: Commitments with efficient zero-knowledge arguments from subset sum problems
