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.
- Efficient chameleon hash functions in the enhanced collision resistant model (Q2658065) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation (Q2822680) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- A Shuffle Argument Secure in the Generic Model (Q2953798) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Delegating RAM Computations (Q3181023) (← links)
- An Introduction to the Use of zk-SNARKs in Blockchains (Q3294800) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Pinocchio-Based Adaptive zk-SNARKs and Secure/Correct Adaptive Function Evaluation (Q4975176) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- Updateable Inner Product Argument with Logarithmic Verifier and Applications (Q5041169) (← links)
- On QA-NIZK in the BPK Model (Q5041171) (← links)
- Signatures of Knowledge for Boolean Circuits Under Standard Assumptions (Q5048960) (← links)
- UC Updatable Databases and Applications (Q5048962) (← links)
- A Unified Framework for Non-universal SNARKs (Q5087272) (← links)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups (Q5135711) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← links)
- Optimally Sound Sigma Protocols Under DCRA (Q5854433) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) (← links)
- SnarkPack: practical SNARK aggregation (Q6045200) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← links)
- Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
- Practical sublinear proofs for R1CS from lattices (Q6104331) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- NIZK from SNARGs (Q6110372) (← links)
- Verifiable Computation and Succinct Arguments for NP (Q6111785) (← links)
- On the impossibility of algebraic vector commitments in pairing-free groups (Q6114273) (← links)
- Obtaining simulation extractable NIZKs in the updatable CRS model generically (Q6118305) (← links)
- Enhancing privacy preservation and trustworthiness for decentralized federated learning (Q6127142) (← links)
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK (Q6132412) (← links)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) (← links)
- Unconditionally secure NIZK in the fine-grained setting (Q6132420) (← links)
- MyOPE: malicious security for oblivious polynomial evaluation (Q6134853) (← links)
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? (Q6134856) (← links)
- SNACKs: leveraging proofs of sequential work for blockchain light clients (Q6135422) (← links)
- Short-lived zero-knowledge proofs and signatures (Q6135445) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions (Q6157543) (← links)
