Pinocchio

swMATH10193MaRDI QIDQ22160FDOQ22160

Author name not available (Why is that?)

Cited In (58)

• Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations
• On QA-NIZK in the BPK Model
• Algorithms for elliptic curves
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Square Span Programs with Applications to Succinct NIZK Arguments
• Non-interactive zero-knowledge arguments for QMA, with preprocessing
• Authenticated hash tables based on cryptographic accumulators
• Verifiable Set Operations over Outsourced Databases
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
• New publicly verifiable computation for batch matrix multiplication
• TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• Trusted computing with addition machines. II
• Computational Integrity with a Public Random String from Quasi-Linear PCPs
• An Introduction to the Use of zk-SNARKs in Blockchains
• How to build time-lock encryption
• Multikey Fully Homomorphic Encryption and Applications
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency
• Privacy-preserving verifiable delegation of polynomial and matrix functions
• Aurora: transparent succinct arguments for R1CS
• QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
• Composition with knowledge assumptions
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
• On subversion-resistant SNARKs
• Security of the Poseidon hash function against non-binary differential and linear attacks
• MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
• Verifiable Multi-party Computation with Perfectly Private Audit Trail
• Gemini: elastic SNARKs for diverse environments
• Practical non-interactive publicly verifiable secret sharing with thousands of parties
• Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation
• Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
• Public verifiable private decision tree prediction
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Proof-of-work certificates that can be efficiently computed in the cloud (invited talk)
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Mining for privacy: how to bootstrap a snarky blockchain
• A Unified Framework for Non-universal SNARKs
• A symmetric cryptographic scheme for data integrity verification in cloud databases
• Updateable Inner Product Argument with Logarithmic Verifier and Applications
• On the (In)Security of SNARKs in the Presence of Oracles
• Time-Optimal Interactive Proofs for Circuit Evaluation
• Shorter arithmetization of nondeterministic computations
• Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption
• Scalable zero knowledge via cycles of elliptic curves
• An algebraic attack on ciphers with low-degree round functions: application to full MiMC
• Interactive Oracle Proofs
• The hunting of the SNARK
• Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
• Zero-knowledge proofs for set membership: efficient, succinct, modular
• On succinct arguments and witness encryption from groups
• Libra: succinct zero-knowledge proofs with optimal prover computation
• ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines
• Pinocchio-Based Adaptive zk-SNARKs and Secure/Correct Adaptive Function Evaluation
• On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups
• PandA: Pairings and Arithmetic
• Sublinear Zero-Knowledge Arguments for RAM Programs

This page was built for software: Pinocchio