Let us now examine one specific model – a physical assumption – that allows the secure implementation of any two-party cryptographic primitive: the noisy-storage model.

While physical assumptions such as noisy-storage do of course make assumptions they are quite appealing in that they only need to be valid for a short time during the execution of the protocol. In particular, they cannot be broken later on if the adversary gains more computational or storage powers.