Non-local box complexity and secure function evaluation

DOI10.4230/LIPICS.FSTTCS.2009.2322MaRDI QIDQ2920130zbMATH OpenOpenAlexFDO

Authors Iordanis Kerenidis, Sophie Laplante, Jérémie Roland, Marc Kaplan

Publication date 24 October 2012

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

zbMATH Keywords

communication complexitynon-local boxesnon-localitysecure function evaluation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Communication theory (94A05) Cryptography (94A60)

Recommendations

• Non-local box complexity and secure function evaluation
• Implications of superstrong non-locality for cryptography
• On the power of non-local boxes
• The universality of non-local boxes
• No nonlocal box is universal

Cited in

(3)

• On the power of non-local boxes
• Non-local box complexity and secure function evaluation
• Implications of superstrong non-locality for cryptography

This page was built for publication: Non-local box complexity and secure function evaluation

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