Answers are grounded in this paper and cite their sources.
This paper shows how a moderate amount of random key stream can be used to generate a lifetime supply of keys for one-time pads. It further shows how arbitrarily many parties can correspond using the same random key, without compromising one another's communications. The net effect is to make the unbreakable one-time pad practical for widespread use.
No takes yet. Share an insight, caveat, or question.
Frank Rubin (1996) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: