2000 character limit reached
Universally-composable privacy amplification from causality constraints (0807.2158v4)
Published 14 Jul 2008 in quant-ph, cs.CR, cs.IT, and math.IT
Abstract: We consider schemes for secret key distribution which use as a resource correlations that violate Bell inequalities. We provide the first security proof for such schemes, according to the strongest notion of security, the so called universally-composable security. Our security proof does not rely on the validity of quantum mechanics, it solely relies on the impossibility of arbitrarily-fast signaling between separate physical systems. This allows for secret communication in situations where the participants distrust their quantum devices.