Distinguishing two probability ensembles with one sample from each ensemble

DOI10.1007/s00224-015-9661-1zbMath1401.68237OpenAlexW2187586888WikidataQ62038765 ScholiaQ62038765MaRDI QIDQ503466

André Souto, Harry Buhrman, Luís Antunes, Andreia Sofia Teixeira, Armando B. Matos

Publication date: 12 January 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/7057

zbMATH Keywords

communication complexityindistinguishabilitymulti-sample distinguisherssingle-message protocols

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Computational indistinguishability: algorithms vs. circuits
• Communication complexity in a 3-computer model
• Computational indistinguishability: A sample hierarchy
• A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
• Communication Complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item