Pages that link to "Item:Q4924436"
From MaRDI portal
The following pages link to Quadratic Span Programs and Succinct NIZKs without PCPs (Q4924436):
Displaying 50 items.
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Balancing privacy and accountability in blockchain identity management (Q826291) (← links)
- Batch verifiable computation of outsourced functions (Q887441) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency (Q2051777) (← 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)
- Compactness of hashing modes and efficiency beyond Merkle tree (Q2056724) (← links)
- Public verifiable private decision tree prediction (Q2057148) (← links)
- Publicly verifiable zero knowledge from (collapsing) blockchains (Q2061968) (← links)
- Flexible and efficient verifiable computation on encrypted data (Q2061972) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← 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)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- Non-interactive zero-knowledge arguments for QMA, with preprocessing (Q2104244) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
- An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact (Q2128569) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Signatures of knowledge for Boolean circuits under standard assumptions (Q2143135) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← 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)
- Practical witness-key-agreement for blockchain-based dark pools financial trading (Q2147265) (← 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)
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs (Q2149845) (← links)
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits (Q2151307) (← links)
- Pribank: confidential blockchain scaling using short commit-and-proof NIZK argument (Q2152182) (← links)
- Efficient proof composition for verifiable computation (Q2167734) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← 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)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
