A note on computational indistinguishability

DOI10.1016/0020-0190(90)90010-UMaRDI QIDQ910218zbMATH OpenFDO

Authors Oded Goldreich

Publication date 1990

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexityanalysis of algorithmsrandomness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• scientific article; zbMATH DE number 1301087
• Computational indistinguishability: algorithms vs. circuits
• Computational indistinguishability: A sample hierarchy
• scientific article; zbMATH DE number 1335877
• Bounded indistinguishability and the complexity of recovering secrets
• A Simple and Unified Method of Proving Indistinguishability
• Indistinguishability obfuscation: from approximate to exact
• Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
• Random-oracle uninstantiability from indistinguishability obfuscation
• Inductive Proofs of Computational Secrecy

Cites work

• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Probabilistic encryption

Cited in

(20)

• The computational SLR: a logic for reasoning about computational indistinguishability
• Computational indistinguishability: algorithms vs. circuits
• On central primitives for quantum cryptography with classical communication
• Unconditionally secure quantum commitments with preprocessing
• On the feasibility of extending oblivious transfer
• A duality between one-way functions and average-case symmetry of information
• Quantum cryptography in Algorithmica
• General properties of quantum bit commitments (extended abstract)
• scientific article; zbMATH DE number 1301087 (Why is no real title available?)
• The final nail in the coffin of statistically-secure obfuscator
• One-Way Functions and (Im)perfect Obfuscation
• Pseudo-mixing Time of Random Walks
• Cryptography from pseudorandom quantum states
• Statistical difference beyond the polarizing regime
• On Input Indistinguishable Proof Systems
• Symbolic encryption with pseudorandom keys
• On the construction of public key encryption with sender recovery
• A measure-theoretic proof of Turing incomparability
• Exponential quantum one-wayness and EFI pairs
• Black-hole radiation decoding is quantum cryptography

This page was built for publication: A note on computational indistinguishability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910218)