Computational indistinguishability: algorithms vs. circuits

DOI10.1016/S0304-3975(97)00162-XMaRDI QIDQ1127328zbMATH OpenFDO

Authors Oded Goldreich, Bernd Meyer

Publication date 13 August 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

computational indistinguishability

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 1335877
• Computational indistinguishability: A sample hierarchy
• scientific article; zbMATH DE number 1301087

Cites work

• A note on computational indistinguishability
• Probabilistic encryption
• Sparse pseudorandom distributions

Cited in

(5)

• scientific article; zbMATH DE number 1301087 (Why is no real title available?)
• Computational indistinguishability: A sample hierarchy
• Distinguishing two probability ensembles with one sample from each ensemble
• Outcome indistinguishability
• A note on computational indistinguishability

This page was built for publication: Computational indistinguishability: algorithms vs. circuits

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