Pages that link to "Item:Q1690273"
From MaRDI portal
The following pages link to On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments (Q1690273):
Displaying 15 items.
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Incrementally verifiable computation via incremental PCPs (Q2175954) (← links)
- Towards malicious security of private coin honest verifier zero knowledge for NP via witness encryption (Q2331988) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- (Q5090398) (← links)
- Theory of Cryptography (Q5898641) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More (Q6488375) (← links)
- On black-box knowledge-sound commit-and-prove SNARKs (Q6562559) (← 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)
