Succinct non-interactive arguments via linear interactive proofs
From MaRDI portal
Recommendations
- Succinct non-interactive arguments via linear interactive proofs
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- On succinct arguments and witness encryption from groups
- On the size of pairing-based non-interactive arguments
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
Cited in
(89)- Fine-grained secure computation
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Scalable zero knowledge via cycles of elliptic curves
- The hunting of the SNARK
- How to build time-lock encryption
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- On succinct arguments and witness encryption from groups
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Succinct non-interactive secure computation
- Linear-time arguments with sublinear verification from tensor codes
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Subquadratic SNARGs in the random oracle model
- Succinct non-interactive arguments via linear interactive proofs
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Practical witness-key-agreement for blockchain-based dark pools financial trading
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- Asymptotically quasi-optimal cryptography
- Secure multiparty computation with sublinear preprocessing
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- On succinct non-interactive arguments in relativized worlds
- SNARGs for P from sub-exponential DDH and QR
- Succinct arguments in the quantum random oracle model
- On the (In)security of Kilian-based SNARGs
- Rational sumchecks
- On the existence of extractable one-way functions
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- On the (in)security of SNARKs in the presence of oracles
- Interactive oracle proofs
- Delegating RAM Computations
- Multikey fully homomorphic encryption and applications
- Shorter arithmetization of nondeterministic computations
- Constant-round interactive proofs for delegating computation
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- A unified framework for non-universal SNARKs
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- Lattice-based SNARGs and their application to more efficient obfuscation
- Computational integrity with a public random string from quasi-linear PCPs
- Sublinear zero-knowledge arguments for RAM programs
- On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
- No-signaling linear PCPs
- No-signaling linear PCPs
- SnarkPack: practical SNARK aggregation
- An efficient identity tracing scheme for blockchain-based systems
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Ligero: lightweight sublinear arguments without a trusted setup
- Non-interactive publicly-verifiable delegation of committed programs
- Rinocchio: SNARKs for ring arithmetic
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- NIZK from SNARGs
- Verifiable Computation and Succinct Arguments for NP
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- MyOPE: malicious security for oblivious polynomial evaluation
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Succinct arguments for RAM programs via projection codes
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
- Lower bound on SNARGs in the random oracle model
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- Non-interactive zero-knowledge from non-interactive batch arguments
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Correlation intractability and SNARGs from sub-exponential DDH
- A simple and efficient framework of proof systems for NP
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Lattice-based functional commitments: fast verification and cryptanalysis
- Succinct verification of compressed sigma protocols in the updatable SRS setting
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Adaptively sound zero-knowledge SNARKs for UP
- Adaptive security in SNARGs via iO and lossy functions
- Succinct non-subsequence arguments
- A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP
- Designated-verifier SNARGs with one group element
- Succinct arguments for \textsf{BatchQMA} and friends under 8 rounds
- An information-sharing system that guarantees the authenticity and privacy of contributors
- From one-time to two-round reusable multi-signatures without nested forking
- Batching adaptively-sound SNARGs for NP
- Homomorphic secret sharing with verifiable evaluation
- Samaritan: linear-time prover SNARK from new multilinear polynomial commitments
- Pairing-based batch arguments for NP with a linear-size CRS
- Verifiable FHE via lattice-based SNARKs
- Boosting SNARKs and rate-1 barrier in arguments of knowledge
This page was built for publication: Succinct non-interactive arguments via linear interactive proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910285)
