Ligero

swMATH28502MaRDI QIDQ40216FDOQ40216

Author name not available (Why is that?)

Cited In (29)

• Polynomial IOPs for Linear Algebra Relations
• Title not available (Why is that?)
• TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
• Zero-knowledge proofs for committed symmetric Boolean functions
• Recursive proof composition from accumulation schemes
• An algebraic framework for universal and updatable SNARKs
• Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
• A compressed \(\varSigma \)-protocol theory for lattices
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• On the round complexity of black-box secure MPC
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
• MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
• More efficient amortization of exact zero-knowledge proofs for LWE
• A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
• A non-PCP approach to succinct quantum-safe zero-knowledge
• Traceable ring signatures: general framework and post-quantum security
• Asymptotically quasi-optimal cryptography
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• The price of active security in cryptographic protocols
• Updateable Inner Product Argument with Logarithmic Verifier and Applications
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• On the power of secure two-party computation
• Acyclicity programming for sigma-protocols
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
• Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
• Arya: nearly linear-time zero-knowledge proofs for correct program execution
• Libra: succinct zero-knowledge proofs with optimal prover computation

This page was built for software: Ligero