Publication:2920130

DOI10.4230/LIPIcs.FSTTCS.2009.2322zbMath1248.68218MaRDI QIDQ2920130

Sophie Laplante, Jérémie Roland, Iordanis Kerenidis, M. A. Kaplan

Publication date: 24 October 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_d82e.html

zbMATH Keywords

communication complexity; secure function evaluation; non-locality; non-local boxes

Mathematics Subject Classification ID

94A60: Cryptography

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

94A05: Communication theory

68Q12: Quantum algorithms and complexity in the theory of computing