Sciweavers

391 search results - page 31 / 79
» On-Line Secret Sharing
Sort
View
PODC
2010
ACM
13 years 7 months ago
Brief announcement: swarming secrets
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 ...
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 6 months ago
Secret Key Generation for a Pairwise Independent Network Model
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...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
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...
Yevgeniy Dodis, Daniel Wichs
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
14 years 5 days ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
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...
Ronald Cramer, Ivan Damgård, Serge Fehr
NTMS
2009
IEEE
14 years 2 months ago
An Adaptive Quantization Algorithm for Secret Key Generation Using Radio Channel Measurements
—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...
Sana Tmar Ben Hamida, Jean-Benoît Pierrot, C...