Pages that link to "Item:Q2056667"
From MaRDI portal
The following pages link to Non-interactive zero knowledge from sub-exponential DDH (Q2056667):
Displayed 15 items.
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Statistical ZAPs from group-based assumptions (Q2695645) (← links)
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption (Q6061370) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? (Q6157611) (← links)
- PPAD is as hard as LWE and iterated squaring (Q6169422) (← links)
- Universal ring signatures in the standard model (Q6175977) (← links)
- A framework for statistically sender private OT with optimal rate (Q6186604) (← links)
- Non-interactive zero-knowledge from non-interactive batch arguments (Q6186697) (← links)
- Correlation intractability and SNARGs from sub-exponential DDH (Q6190125) (← links)
- On the impossibility of algebraic NIZK in pairing-free groups (Q6190127) (← links)
- A note on non-interactive zero-knowledge from CDH (Q6190128) (← links)
- Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) (Q6190138) (← links)