Sciweavers

24 search results - page 1 / 5
» Protecting secret keys with personal entropy
Sort
View
FGCS
2000
104views more  FGCS 2000»
13 years 4 months ago
Protecting secret keys with personal entropy
Conventional encryption technology often requires users to protect a secret key by selecting a password or passphrase. While a good passphrase will only be known to the user, it a...
Carl M. Ellison, Chris Hall, Randy Milbert, Bruce ...
ACNS
2010
Springer
172views Cryptology» more  ACNS 2010»
13 years 8 months ago
Secure Sketch for Multiple Secrets
Secure sketches are useful in extending cryptographic schemes to biometric data since they allow recovery of fuzzy secrets under inevitable noise. In practice, secrets derived from...
Chengfang Fang, Qiming Li, Ee-Chien Chang
CCS
2001
ACM
13 years 9 months ago
A Cryptanalysis of the High-Bandwidth Digital Content Protection System
Abstract. We describe a weakness in the High Bandwidth Digital Content Protection (HDCP) scheme which may lead to practical attacks. HDCP is a proposed identity-based cryptosystem ...
Scott Crosby, Ian Goldberg, Robert Johnson, Dawn X...
PAIRING
2010
Springer
152views Cryptology» more  PAIRING 2010»
13 years 3 months ago
Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store Shares
Threshold cryptography has been used to secure data and control access by sharing a private cryptographic key over different devices. This means that a minimum number of these dev...
Koen Simoens, Roel Peeters, Bart Preneel
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
13 years 8 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...