July 22, 2010April 9th, 2024
FiledApril 9th, 2024
July 22, 2010October 20th, 2010
FiledOctober 20th, 2010Consider two parties holding samples from correlated distributions W and W ′, respectively, that are within distance t of each other in some metric space. These parties wish to agree on a uniformly distributed secret key R by sending a single message over an insecure channel controlled by an all-powerful adversary. We consider both the keyless case, where the parties share no additional secret information, and the keyed case, where the parties share a long-term secret SK that they can use to generate a sequence of session keys {Rj} using multiple pairs
July 22, 2010August 20th, 2010
FiledAugust 20th, 2010Consider two parties holding samples from correlated distributions W and W ′, respectively, that are within distance t of each other in some metric space. These parties wish to agree on a uniformly distributed secret key R by sending a single message over an insecure channel controlled by an all-powerful adversary. We consider both the keyless case, where the parties share no additional secret information, and the keyed case, where the parties share a long-term secret SK that they can use to generate a sequence of session keys {Rj} using multiple pairs