Pages that link to "Item:Q5041168"
From MaRDI portal
The following pages link to Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography (Q5041168):
Displaying 29 items.
- Compilation of function representations for secure computing paradigms (Q826238) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes (Q2055652) (← links)
- Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
- Banquet: short and fast signatures from AES (Q2061922) (← links)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications (Q2181847) (← links)
- Generalized proofs of knowledge with fully dynamic setup (Q2695646) (← links)
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems (Q3408195) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general (Q6104329) (← links)
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection (Q6132417) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- MR-DSS -- smaller MinRank-based (ring-)signatures (Q6166980) (← links)
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes (Q6488026) (← links)
- Building MPCitH-based signatures from MQ, MinRank, and rank SD (Q6547988) (← links)
- Biscuit: new MPCitH signature scheme from structured multivariate polynomials (Q6547993) (← links)
- Commitments with efficient zero-knowledge arguments from subset sum problems (Q6550619) (← links)
- Ramp hyper-invertible matrices and their applications to MPC protocols (Q6595682) (← links)
- Threshold linear secret sharing to the rescue of MPC-in-the-head (Q6595690) (← links)
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\) (Q6595940) (← links)
- New proof systems and an OPRF from CSIDH (Q6635825) (← links)
- On round elimination for special-sound multi-round identification and the generality of the hypercube for MPCitH (Q6648198) (← links)
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6653054) (← links)
