Pages that link to "Item:Q1629413"
From MaRDI portal
The following pages link to Round optimal black-box ``commit-and-prove'' (Q1629413):
Displaying 11 items.
- Distinguisher-dependent simulation in two rounds and its applications (Q1678369) (← links)
- Delayed-input cryptographic protocols (Q2011641) (← links)
- 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)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality (Q2152072) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
- Four-round black-box non-malleable schemes from one-way permutations (Q6114274) (← 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)
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols (Q6660381) (← links)
