Succinct non-interactive arguments for distributions
From MaRDI portal
Cites work
- A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
- A lower bound on the complexity of testing grained distributions
- A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP
- Arguments of proximity (extended abstract)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Boosting batch arguments and RAM delegation
- Computationally Sound Proofs
- Constant-round interactive proofs for delegating computation
- Correlation intractability and SNARGs from sub-exponential DDH
- Delegating computation: interactive proofs for muggles
- Doubley-efficient interactive proofs for distribution properties
- Fiat-Shamir: from practice to theory
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- Incrementally verifiable computation via rate-1 batch arguments
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Interactive proofs for general distribution properties
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive delegation and batch NP verification from standard computational assumptions
- On the communication complexity of secure function evaluation with long output
- Proofs of proximity for distribution testing
- Public coin interactive proofs for label-invariant distribution properties
- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Rate-1 non-interactive arguments for batch-NP and applications
- SNARGs for \(\mathcal{P}\) from LWE
- SNARGs for P from sub-exponential DDH and QR
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Testing that distributions are close
- The random oracle methodology, revisited.
- Verifiable private information retrieval
- Verifying the unseen: interactive proofs for label-invariant distribution properties
This page was built for publication: Succinct non-interactive arguments for distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443626)