Non-local box complexity and secure function evaluation

MaRDI QIDQ3171624zbMATHFDO

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

Publication date 5 October 2011

Full work available at URL https://arxiv.org/abs/0903.2179

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

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)

• Non-local box complexity and secure function evaluation
• Efficient reductions for non-signaling cryptographic primitives
• 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 Q3171624)