Sciweavers

222 search results - page 11 / 45
» How to Forget a Secret
Sort
View
ACNS
2009
Springer
168views Cryptology» more  ACNS 2009»
15 years 4 months ago
How to Extract and Expand Randomness: A Summary and Explanation of Existing Results
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
Yvonne Cliff, Colin Boyd, Juan Manuel Gonzá...
ASIACRYPT
2004
Springer
15 years 3 months ago
Secret Handshakes from CA-Oblivious Encryption
Secret handshakes were recently introduced [BDS+ 03] to allow members of the same group to authenticate each other secretly, in the sense that someone who is not a group member ca...
Claude Castelluccia, Stanislaw Jarecki, Gene Tsudi...
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
15 years 2 months 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
TIFS
2010
184views more  TIFS 2010»
14 years 8 months ago
Information-theoretically secret key generation for fading wireless channels
—The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, ...
Chunxuan Ye, Suhas Mathur, Alex Reznik, Yogendra S...
DRM
2004
Springer
15 years 3 months ago
Analysis of an incentives-based secrets protection system
Once electronic content has been released it is very difficult to prevent copies of the content from being widely distributed. Such distribution can cause economic harm to the con...
N. Boris Margolin, Matthew Wright, Brian Neil Levi...