Sciweavers

102 search results - page 6 / 21
» Secure Sketch for Multiple Secrets
Sort
View
EDBT
2008
ACM
172views Database» more  EDBT 2008»
14 years 7 months ago
Distributed privacy preserving k-means clustering with additive secret sharing
Recent concerns about privacy issues motivated data mining researchers to develop methods for performing data mining while preserving the privacy of individuals. However, the curr...
Albert Levi, Erkay Savas, Mahir Can Doganay, Thoma...
IACR
2011
88views more  IACR 2011»
12 years 7 months ago
Storing Secrets on Continually Leaky Devices
We consider the question of how to store a value secretly on devices that continually leak information about their internal state to an external attacker. If the secret value is s...
Yevgeniy Dodis, Allison B. Lewko, Brent Waters, Da...
CHI
2004
ACM
14 years 7 months ago
Passwords you'll never forget, but can't recall
We identify a wide range of human memory phenomena as potential certificates of identity. These "imprinting" behaviors are characterized by vast capacity for complex exp...
Daphna Weinshall, Scott Kirkpatrick
COCOON
2008
Springer
13 years 9 months ago
Visual Cryptography on Graphs
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node an...
Steve Lu, Daniel Manchala, Rafail Ostrovsky
IPPS
2005
IEEE
14 years 1 months ago
On the Optimal Placement of Secure Data Objects over Internet
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farok...