Pages that link to "Item:Q6104342"
From MaRDI portal
The following pages link to Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342):
Displaying 17 items.
- Non-interactive delegation and batch NP verification from standard computational assumptions (Q4977995) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- Sequential half-aggregation of lattice-based signatures (Q6550626) (← links)
- On black-box knowledge-sound commit-and-prove SNARKs (Q6562559) (← 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)
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin} (Q6636508) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
- Monotone-policy aggregate signatures (Q6637524) (← links)
- Strong batching for non-interactive statistical zero-knowledge (Q6637570) (← links)
- Aggregating Falcon signatures with LaBRADOR (Q6648189) (← links)
- Fully-succinct multi-key homomorphic signatures from standard assumptions (Q6652902) (← links)
- Non-interactive zero-knowledge from LPN and MQ (Q6653050) (← links)
- Adaptive security in SNARGs via iO and lossy functions (Q6660293) (← links)
