How to delegate computations publicly
From MaRDI portal
Recommendations
- Succinct delegation for low-space non-deterministic computation
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- How to delegate computations
- Non-interactive delegation and batch NP verification from standard computational assumptions
- scientific article; zbMATH DE number 5485522
Cited in
(50)- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Delegation with updatable unambiguous proofs and PPAD-hardness
- Non-interactive batch arguments for NP from standard assumptions
- SNARGs for P from sub-exponential DDH and QR
- Incrementally verifiable computation via incremental PCPs
- A compiler for multi-key homomorphic signatures for Turing machines
- Verifiable inner product computation on outsourced database for authenticated multi-user data sharing
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- Non-interactive publicly-verifiable delegation of committed programs
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Parallelizable delegation from LWE
- Non-interactive universal arguments
- SNARGs for monotone policy batch NP
- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
- Verifiable private information retrieval
- Non-interactive zero-knowledge from non-interactive batch arguments
- Correlation intractability and SNARGs from sub-exponential DDH
- Boosting batch arguments and RAM delegation
- On black-box knowledge-sound commit-and-prove SNARKs
- A simple and efficient framework of proof systems for NP
- Compact NIZKs from standard assumptions on bilinear maps
- Locally verifiable distributed SNARGs
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- Lattice-based functional commitments: fast verification and cryptanalysis
- Probabilistically checkable arguments for all NP
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Monotone-policy aggregate signatures
- Reducing the CRS size in registered ABE systems
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- Adaptively sound zero-knowledge SNARKs for UP
- Incrementally verifiable computation for NP from standard assumptions
- Sometimes-decryptable homomorphic encryption from sub-exponential DDH
- Succinct arguments for \textsf{BatchQMA} and friends under 8 rounds
- Functional commitments and SNARGs for P/poly from SIS
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Chosen ciphertext security via BARGs
- Monotone policy BARGs from BARGs and additively homomorphic encryption
- Batching adaptively-sound SNARGs for NP
- Homomorphic secret sharing with verifiable evaluation
- Time-space lower bounds for simulating proof systems with quantum and randomized verifiers
- On succinct non-interactive secure computation with malicious security
- A new paradigm for server-aided MPC
- Boosting SNARKs and rate-1 barrier in arguments of knowledge
- Outsourcing computation: the minimal refereed mechanism
This page was built for publication: How to delegate computations publicly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212851)
