The following pages link to Pinocchio (Q22160):
Displaying 50 items.
- Authenticated hash tables based on cryptographic accumulators (Q262258) (← links)
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- A symmetric cryptographic scheme for data integrity verification in cloud databases (Q781030) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Trusted computing with addition machines. II (Q1745689) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Proof-of-work certificates that can be efficiently computed in the cloud (invited talk) (Q1798302) (← links)
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme (Q2004727) (← links)
- New publicly verifiable computation for batch matrix multiplication (Q2004759) (← links)
- Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- Security of the Poseidon hash function against non-binary differential and linear attacks (Q2044012) (← links)
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency (Q2051777) (← links)
- Public verifiable private decision tree prediction (Q2057148) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- Non-interactive zero-knowledge arguments for QMA, with preprocessing (Q2104244) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Composition with knowledge assumptions (Q2139641) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q2145404) (← links)
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
- Mining for privacy: how to bootstrap a snarky blockchain (Q2145411) (← links)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Aurora: transparent succinct arguments for R1CS (Q2292641) (← links)
- Libra: succinct zero-knowledge proofs with optimal prover computation (Q2304944) (← links)
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions (Q2306905) (← links)
- Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption (Q2403232) (← links)
- An algebraic attack on ciphers with low-degree round functions: application to full MiMC (Q2692352) (← links)
- Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations (Q2817469) (← links)
- Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation (Q2822680) (← links)
- Verifiable Multi-party Computation with Perfectly Private Audit Trail (Q2822682) (← links)
- Time-Optimal Interactive Proofs for Circuit Evaluation (Q2849387) (← links)
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge (Q2849388) (← links)
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes (Q2867210) (← links)
- Scalable Zero Knowledge via Cycles of Elliptic Curves (Q2874542) (← links)
- Square Span Programs with Applications to Succinct NIZK Arguments (Q2938864) (← links)
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity (Q2958119) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- An Introduction to the Use of zk-SNARKs in Blockchains (Q3294800) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Quadratic Span Programs and Succinct NIZKs without PCPs (Q4924436) (← links)
- Pinocchio-Based Adaptive zk-SNARKs and Secure/Correct Adaptive Function Evaluation (Q4975176) (← links)
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography (Q5041168) (← links)
- Updateable Inner Product Argument with Logarithmic Verifier and Applications (Q5041169) (← links)
- On QA-NIZK in the BPK Model (Q5041171) (← links)
- A Unified Framework for Non-universal SNARKs (Q5087272) (← links)
