Pages that link to "Item:Q2139642"
From MaRDI portal
The following pages link to Non-interactive batch arguments for NP from standard assumptions (Q2139642):
Displaying 14 items.
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Triply adaptive UC NIZK (Q6132421) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- PPAD is as hard as LWE and iterated squaring (Q6169422) (← links)
- A simple and efficient framework of proof systems for NP (Q6562565) (← links)
- Locally verifiable distributed SNARGs (Q6581783) (← links)
- On black-box verifiable outsourcing (Q6581787) (← links)
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors (Q6582222) (← links)
- Rate-1 fully local somewhere extractable hashing from DDH (Q6635830) (← links)
- Monotone-policy aggregate signatures (Q6637524) (← links)
- Strong batching for non-interactive statistical zero-knowledge (Q6637570) (← links)
- Fully-succinct multi-key homomorphic signatures from standard assumptions (Q6652902) (← links)
- Non-interactive zero-knowledge from LPN and MQ (Q6653050) (← links)
