The following pages link to Sparse pseudorandom distributions (Q3990219):
Displaying 7 items.
- Computational indistinguishability: algorithms vs. circuits (Q1127328) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- On the universal steganography of optimal rate (Q2216130) (← links)
- Composition of Zero-Knowledge Proofs with Efficient Provers (Q3408217) (← links)
- Pseudodeterministic constructions in subexponential time (Q4978012) (← links)
- Unconditionally secure quantum commitments with preprocessing (Q6653000) (← links)
- Unconditionally secure commitments with quantum auxiliary inputs (Q6653002) (← links)