Ligero

From MaRDI portal
Software:40216



swMATH28502MaRDI QIDQ40216


No author found.





Related Items (29)

An algebraic framework for universal and updatable SNARKsConcretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based CryptographyUpdateable Inner Product Argument with Logarithmic Verifier and ApplicationsOn the round complexity of black-box secure MPCA compressed \(\varSigma \)-protocol theory for latticesArya: nearly linear-time zero-knowledge proofs for correct program execution\textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctionsBooLigero: improved sublinear zero knowledge proofs for Boolean circuitsMPC-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 LWEA simple post-quantum non-interactive zero-knowledge proof from garbled circuitsAsymptotically quasi-optimal cryptographyStacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctionsPolynomial IOPs for Linear Algebra RelationsPractical exact proofs from lattices: new techniques to exploit fully-splitting ringsEfficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codesAcyclicity programming for sigma-protocolsDory: efficient, transparent arguments for generalised inner products and polynomial commitmentsTraceable ring signatures: general framework and post-quantum securityEfficient non-interactive zero-knowledge proofs in cross-domains without trusted setupOn the power of secure two-party computationLibra: succinct zero-knowledge proofs with optimal prover computationUnnamed ItemA non-PCP approach to succinct quantum-safe zero-knowledgeSpartan: efficient and general-purpose zkSNARKs without trusted setupTurboIKOS: improved non-interactive zero knowledge and post-quantum signaturesZero-knowledge proofs for committed symmetric Boolean functionsThe price of active security in cryptographic protocolsRecursive proof composition from accumulation schemes


This page was built for software: Ligero