The following pages link to Ligero (Q40216):
Displaying 29 items.
- Arya: nearly linear-time zero-knowledge proofs for correct program execution (Q1633476) (← links)
- Traceable ring signatures: general framework and post-quantum security (Q2034982) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Zero-knowledge proofs for committed symmetric Boolean functions (Q2118554) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- Recursive proof composition from accumulation schemes (Q2119035) (← links)
- An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630) (← links)
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) (Q2148762) (← links)
- More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits (Q2151307) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup (Q2289212) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Libra: succinct zero-knowledge proofs with optimal prover computation (Q2304944) (← links)
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments (Q2697847) (← links)
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography (Q5041168) (← links)
- Updateable Inner Product Argument with Logarithmic Verifier and Applications (Q5041169) (← links)
- Polynomial IOPs for Linear Algebra Relations (Q5087271) (← links)
- (Q5121912) (← links)
