Pages that link to "Item:Q5739206"
From MaRDI portal
The following pages link to On the Size of Pairing-Based Non-interactive Arguments (Q5739206):
Displaying 50 items.
- On the statistical leak of the GGH13 multilinear map and some variants (Q1633467) (← links)
- Election control through social influence with unknown preferences (Q2019485) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- Security of the Poseidon hash function against non-binary differential and linear attacks (Q2044012) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- Public verifiable private decision tree prediction (Q2057148) (← links)
- On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- A classification of computational assumptions in the algebraic group model (Q2096519) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← 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)
- Practical algorithm substitution attack on extractable signatures (Q2119943) (← links)
- Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Proof-carrying data without succinct arguments (Q2120099) (← links)
- An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
- Tight state-restoration soundness in the algebraic group model (Q2128989) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Composition with knowledge assumptions (Q2139641) (← links)
- Signatures of knowledge for Boolean circuits under standard assumptions (Q2143135) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q2145404) (← links)
- Another look at extraction and randomization of Groth's zk-SNARK (Q2145409) (← links)
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
- Mining for privacy: how to bootstrap a snarky blockchain (Q2145411) (← links)
- LOVE a pairing (Q2146100) (← links)
- Practical witness-key-agreement for blockchain-based dark pools financial trading (Q2147265) (← links)
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs (Q2149845) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- Efficient proof composition for verifiable computation (Q2167734) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
- Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) (Q2170055) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- Minting mechanism for proof of stake blockchains (Q2229280) (← links)
- An optimized inner product argument with more application scenarios (Q2673065) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- A Shuffle Argument Secure in the Generic Model (Q2953798) (← links)
