Computational indistinguishability: algorithms vs. circuits

DOI10.1016/S0304-3975(97)00162-XzbMATH Open0895.68048MaRDI QIDQ1127328FDOQ1127328

Authors: Oded Goldreich, Bernd Meyer 

Publication date: 13 August 1998

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

Recommendations

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

zbMATH Keywords

computational indistinguishability

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Computational indistinguishability: A sample hierarchy
• Title not available (Why is that?)
• Outcome indistinguishability
• A note on computational indistinguishability
• Distinguishing two probability ensembles with one sample from each ensemble

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)