We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Pr...
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
—New approaches that generate secret keys from radio channel characteristics have been recently proposed. The security of these schemes usually relies on the reciprocity principl...