Computational indistinguishability: algorithms vs. circuits

DOI10.1016/S0304-3975(97)00162-XzbMath0895.68048MaRDI QIDQ1127328

Bernd Meyer, Oded Goldreich

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)

Related Items (2)

Computational indistinguishability: A sample hierarchy ⋮ Distinguishing two probability ensembles with one sample from each ensemble

Cites Work

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

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