24188 search results - page 105 / 4838 » Computing on Encrypted Data |
144
Voted
ESORICS
2005
Springer
15 years 8 months ago
2005
Springer
The freedom and transparency of information flow on the Internet has heightened concerns of privacy. Given a set of data items, clustering algorithms group similar items together...
101
Voted
NDSS
1998
IEEE
15 years 7 months ago
1998
IEEE
In this work, we aim to reduce the computational costs of using public-key digital signatures in securing routing protocols. Two protocols (COSP and IOSP) using one-time digitalsi...
138
Voted
APPROX
2011
Springer
14 years 2 months ago
2011
Springer
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
130
Voted
IACR
2011
14 years 2 months ago
2011
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...
115
Voted
WPES
2005
ACM
15 years 8 months ago
2005
ACM
At the 2004 Workshop on Privacy in the Electronic Society (WPES), Borisov, Goldberg and Brewer, presented “Off the Record Messaging” (OTR), a protocol designed to add endto-e...