swMATH10193MaRDI QIDQ22160FDOQ22160
Author name not available (Why is that?)
Official website: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=6547113
Cited In (only showing first 100 items - show all)
- Quadratic span programs and succinct NIZKs without PCPs
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Authenticated hash tables based on cryptographic accumulators
- A unified framework for non-universal SNARKs
- MiMC
- 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
- LegoSNARK
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- Verifiable set operations over outsourced databases
- On QA-NIZK in the BPK model
- On subversion-resistant SNARKs
- Time-optimal interactive proofs for circuit evaluation
- Interactive oracle proofs
- Libra
- Security of the Poseidon hash function against non-binary differential and linear attacks
- MIRACL
- Barreto-Naehrig
- PandA
- MiniLEGO
- PBC Library
- RELIC
- Charm
- SWIFFT
- eBATS
- SNARKs for C
- Computational integrity with a public random string from quasi-linear PCPs
- ADSNARK
- Plutus
- SiRiUS
- fhe
- zk-SNARK
- HAL
- gmpy2
- CryptDB
- Arya
- Ligero
- EMP-toolkit
- vSQL
- vRAM
- ZKBoo
- Geppetto
- libiop
- libsnark
- Picnic
- Public verifiable private decision tree prediction
- Proof-of-work certificates that can be efficiently computed in the cloud (invited talk)
- U-Prove
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- 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
- Scalable zero knowledge via cycles of elliptic curves
- Scalable zero knowledge via cycles of elliptic curves
- CPSNARKs-Set
- Halo2
- jsnark
- Marlin
- dalek
- xJsnark
- Square span programs with applications to succinct NIZK arguments
- An algebraic attack on ciphers with low-degree round functions: application to full MiMC
- SWIFFTX
- The hunting of the SNARK
- Snarks for C: verifying program executions succinctly and in zero knowledge
- 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
- libff
- constantine
- SwiftEC
- wasmcurves
- zkCNN
- Algorithms for elliptic curves
- Sublinear zero-knowledge arguments for RAM programs
- CIRCL
- EDRAX
- DIZK
- Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
- Composition with knowledge assumptions
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- On the (in)security of SNARKs in the presence of oracles
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Pinocchio-based adaptive zk-SNARKs and secure/correct adaptive function evaluation
- Gemini: elastic SNARKs for diverse environments
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- On the classification of knowledge-of-exponent assumptions in cyclic groups
- Multikey fully homomorphic encryption and applications
This page was built for software: Pinocchio
