Pinocchio

swMATH10193MaRDI QIDQ22160FDOQ22160

Author name not available (Why is that?)

Cited In (58)

• Sublinear zero-knowledge arguments for RAM programs
• \textsf{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
• Quadratic span programs and succinct NIZKs without PCPs
• Algorithms for elliptic curves
• Non-interactive zero-knowledge arguments for QMA, with preprocessing
• Authenticated hash tables based on cryptographic accumulators
• A unified framework for non-universal SNARKs
• 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
• Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
• How to build time-lock encryption
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• Verifiable multi-party computation with perfectly private audit trail
• Privacy-preserving verifiable delegation of polynomial and matrix functions
• Aurora: transparent succinct arguments for R1CS
• Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
• Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
• Composition with knowledge assumptions
• Verifiable set operations over outsourced databases
• On the (in)security of SNARKs in the presence of oracles
• On QA-NIZK in the BPK model
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
• On subversion-resistant SNARKs
• Time-optimal interactive proofs for circuit evaluation
• Interactive oracle proofs
• Security of the Poseidon hash function against non-binary differential and linear attacks
• Computational integrity with a public random string from quasi-linear PCPs
• Gemini: elastic SNARKs for diverse environments
• Practical non-interactive publicly verifiable secret sharing with thousands of parties
• Public verifiable private decision tree prediction
• Proof-of-work certificates that can be efficiently computed in the cloud (invited talk)
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
• Mining for privacy: how to bootstrap a snarky blockchain
• A symmetric cryptographic scheme for data integrity verification in cloud databases
• Updateable Inner Product Argument with Logarithmic Verifier and Applications
• Shorter arithmetization of nondeterministic computations
• Multikey fully homomorphic encryption and applications
• Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption
• Scalable zero knowledge via cycles of elliptic curves
• Scalable zero knowledge via cycles of elliptic curves
• Square span programs with applications to succinct NIZK arguments
• An algebraic attack on ciphers with low-degree round functions: application to full MiMC
• Batch verifiable computation with public verifiability for outsourcing polynomials and matrix computations
• The hunting of the SNARK
• Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
• Snarks for C: verifying program executions succinctly and in zero knowledge
• An introduction to the use of zk-SNARKs in blockchains
• 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

This page was built for software: Pinocchio