A note on computational indistinguishability
From MaRDI portal
Publication:910218
DOI10.1016/0020-0190(90)90010-UzbMath0695.68037MaRDI QIDQ910218
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05)
Related Items (10)
One-Way Functions and (Im)perfect Obfuscation ⋮ Statistical difference beyond the polarizing regime ⋮ Computational indistinguishability: algorithms vs. circuits ⋮ On the feasibility of extending oblivious transfer ⋮ Pseudo-mixing Time of Random Walks ⋮ Cryptography from pseudorandom quantum states ⋮ General properties of quantum bit commitments (extended abstract) ⋮ The final nail in the coffin of statistically-secure obfuscator ⋮ Black-hole radiation decoding is quantum cryptography ⋮ On the Construction of Public Key Encryption with Sender Recovery
Cites Work
This page was built for publication: A note on computational indistinguishability
