Sciweavers

125 search results - page 24 / 25
» On the Performance of Hyperelliptic Cryptosystems
Sort
View
IACR
2011
141views more  IACR 2011»
12 years 5 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
CCS
2008
ACM
13 years 8 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
JAMIA
2011
68views more  JAMIA 2011»
12 years 9 months ago
A secure protocol for protecting the identity of providers when disclosing data for disease surveillance
Background Providers have been reluctant to disclose patient data for public-health purposes. Even if patient privacy is ensured, the desire to protect provider confidentiality h...
Khaled El Emam, Jun Hu, Jay Mercer, Liam Peyton, M...
GI
2004
Springer
13 years 11 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
14 years 3 months ago
Speeding Up Secure Computations via Embedded Caching.
Most existing work on Privacy-Preserving Data Mining (PPDM) focus on enabling conventional data mining algorithms with the ability to run in a secure manner in a multi-party setti...
K. Zhai, W. K. Ng, A. R. Herianto, S. Han