Bertlmann's chocolate balls and quantum type cryptography

TL;DR

This paper explores the analogy between quantum cryptography and chocolate balls, proposing that quantum value indefiniteness, rooted in Bell and Kochen-Specker theorems, can certify quantum randomness and security.

Contribution

It introduces a novel approach to certify quantum cryptographic protocols using the concept of value indefiniteness, linking quantum foundations with practical cryptography.

Findings

Certain cryptographic protocols with chocolate balls mimic quantum security features

Value indefiniteness is essential for protocols protected against classical imitation

Proposes certification of quantum randomness based on fundamental quantum principles

Abstract

Some quantum cryptographic protocols can be implemented with specially prepared chocolate balls, others protected by value indefiniteness cannot. Similarities and differences of cryptography with quanta and chocolate are discussed. Motivated by these considerations it is proposed to certify quantum random number generators and quantum cryptographic protocols by value indefiniteness. This feature, which derives itself from Bell- and Kochen-Specker type arguments, is only present in systems with three or more mutually exclusive outcomes.