Pages that link to "Item:Q1629411"
From MaRDI portal
The following pages link to Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411):
Displaying 10 items.
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? (Q2055669) (← links)
- Round-optimal black-box commit-and-prove with succinct communication (Q2096539) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
- Full round zero-sum distinguishers on \textsf{TinyJAMBU}-128 and \textsf{TinyJAMBU}-192 keyed-permutation in the known-key setting (Q6169473) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- Black-box (and fast) non-malleable zero knowledge (Q6653055) (← links)
