Pages that link to "Item:Q2055643"
From MaRDI portal
The following pages link to \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643):
Displaying 47 items.
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Proof-carrying data without succinct arguments (Q2120099) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- On interactive oracle proofs for Boolean R1CS statements (Q6045202) (← links)
- Proof-carrying data from arithmetized random oracles (Q6061366) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- NIZK from SNARGs (Q6110372) (← links)
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup (Q6132411) (← links)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) (← links)
- Inner product functional commitments with constant-size public parameters and openings (Q6134851) (← links)
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions (Q6157543) (← links)
- Proofs for inner pairing products and applications (Q6157545) (← links)
- Lower bound on SNARGs in the random oracle model (Q6163944) (← links)
- Orion: zero knowledge proof with linear prover time (Q6166953) (← links)
- Nova: recursive zero-knowledge arguments from folding schemes (Q6166957) (← links)
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives (Q6169365) (← links)
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II (Q6169368) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- GUC-secure commitments via random oracles: new impossibility and feasibility (Q6175972) (← links)
- Fiat-Shamir security of FRI and related SNARKs (Q6562558) (← links)
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines (Q6562561) (← links)
- A simple and efficient framework of proof systems for NP (Q6562565) (← links)
- Sigma protocols from verifiable secret sharing and their applications (Q6562568) (← links)
- Generic security of the SAFE API and its applications (Q6562590) (← links)
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors (Q6582222) (← links)
- Efficient KZG-based univariate sum-check and lookup argument (Q6635778) (← links)
- Concurrently secure blind Schnorr signatures (Q6636502) (← links)
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin} (Q6636508) (← links)
- SLAP: succinct lattice-based polynomial commitments from standard assumptions (Q6637716) (← links)
- Loquat: a SNARK-friendly post-quantum signature based on the Legendre PRF with applications in ring and aggregate signatures (Q6648186) (← links)
- Sometimes you can't distribute random-oracle-based proofs (Q6652973) (← links)
- FRIDA: data availability sampling from FRI (Q6652989) (← links)
- On soundness notions for interactive oracle proofs (Q6655868) (← links)
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup (Q6660298) (← links)
- How to prove statements obliviously? (Q6660309) (← links)
- On the concrete security of non-interactive FRI (Q6660394) (← links)
