Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
From MaRDI portal
Recommendations
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- scientific article; zbMATH DE number 1302863
Cited in
(55)- Efficient, actively secure MPC with a dishonest majority: a survey
- Lattice-based zero-knowledge proofs for blockchain confidential transactions
- Efficient verifiable mixnets from lattices, revisited
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- Lova: lattice-based folding scheme from unstructured lattices
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Zero-knowledge proofs for committed symmetric Boolean functions
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Subquadratic SNARGs in the random oracle model
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
- Lattice-based zero-knowledge arguments for integer relations
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- A compressed \(\varSigma \)-protocol theory for lattices
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Ligero: lightweight sublinear arguments without a trusted setup
- More efficient amortization of exact zero-knowledge proofs for LWE
- Practical sublinear proofs for R1CS from lattices
- Orion: zero knowledge proof with linear prover time
- The Fiat-Shamir transformation of (_1,,_ )-special-sound interactive proofs
- RoK and Roll -- verifier-efficient random projection for \(\tilde{O}(\lambda )\)-size lattice arguments (extended abstract)
- A note on short invertible ring elements and applications to cyclotomic and trinomials number fields
- Functional commitments for all functions, with transparent setup and from SIS
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- A non-PCP approach to succinct quantum-safe zero-knowledge
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Asymptotically quasi-optimal cryptography
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
- Boosting verifiable computation on encrypted data
- \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Succinct arguments in the quantum random oracle model
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
- Laconic private set intersection and applications
- An efficient ZK compiler from SIMD circuits to general circuits
- Lattice-based zero-knowledge proofs in action: applications to electronic voting
- Post-quantum lattice-based e-voting for multiple candidates
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- Field-agnostic SNARKs from expand-accumulate codes
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- Attribute-based keyed fully homomorphic encryption
- Verifiable decryption in the head
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Generic construction of threshold ring signatures and lattice-based instantiations
- Round-efficient sub-linear zero-knowledge arguments for linear algebra
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- Lower bound on SNARGs in the random oracle model
This page was built for publication: Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784111)
