  Coin tossing is a cryptographic task in which two parties who do not trust
each other aim to generate a common random bit. Using classical communication
this is impossible, but non trivial coin tossing is possible using quantum
communication. Here we consider the case when the parties do not want to toss a
single coin, but many. This is called bit string generation. We report the
experimental generation of strings of coins which are provably more random than
achievable using classical communication. The experiment is based on the ``plug
and play'' scheme developed for quantum cryptography, and therefore well suited
for long distance quantum communication.
