Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
From MaRDI portal
Publication:6132417
DOI10.1007/978-3-031-22966-4_13zbMath1519.94117OpenAlexW4316590254MaRDI QIDQ6132417
Damien Vergnaud, Matthieu Rivain, Thibauld Feneuil, Jules Maire
Publication date: 16 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22966-4_13
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the modular inversion hidden number problem
- Improved low-density subset sum algorithms
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- New results on Modular Inversion Hidden Number problem and inversive congruential generator
- Aurora: transparent succinct arguments for R1CS
- TFHE: fast fully homomorphic encryption over the torus
- Scalable zero knowledge with no trusted setup
- Efficient cryptographic schemes provably as secure as subset sum
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Improved classical and quantum algorithms for subset-sum
- How to Prove Knowledge of Small Secrets
- Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- New Generic Algorithms for Hard Knapsacks
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Computing Partitions with Applications to the Knapsack Problem
- A new identification scheme based on syndrome decoding
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Reducibility among Combinatorial Problems
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- LegRoast: Efficient Post-quantum Signatures from the Legendre PRF
- On the Size of Pairing-Based Non-interactive Arguments
- Hiding information and signatures in trapdoor knapsacks
- On lattices, learning with errors, random linear codes, and cryptography
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
This page was built for publication: Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
