Pages that link to "Item:Q910218"
From MaRDI portal
The following pages link to A note on computational indistinguishability (Q910218):
Displaying 14 items.
- A measure-theoretic proof of Turing incomparability (Q638476) (← links)
- Computational indistinguishability: algorithms vs. circuits (Q1127328) (← links)
- Statistical difference beyond the polarizing regime (Q2175943) (← links)
- On the feasibility of extending oblivious transfer (Q2413614) (← links)
- (Q4246732) (← links)
- Pseudo-mixing Time of Random Walks (Q5098785) (← links)
- On Input Indistinguishable Proof Systems (Q5167801) (← links)
- On the Construction of Public Key Encryption with Sender Recovery (Q5250274) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- Cryptography from pseudorandom quantum states (Q6097262) (← links)
- The final nail in the coffin of statistically-secure obfuscator (Q6161431) (← links)
- Unconditionally secure quantum commitments with preprocessing (Q6653000) (← links)
- On central primitives for quantum cryptography with classical communication (Q6653009) (← links)
- Exponential quantum one-wayness and EFI pairs (Q6660384) (← links)