Sciweavers

146 search results - page 16 / 30
» Homomorphic encryption from codes
Sort
View
GLOBECOM
2006
IEEE
14 years 1 months ago
Secure Aggregation in Large Scale Overlay Networks
Overlay networks have been very useful in solving large scale data dissemination problems. In this paper, we consider the case of data gathering which is the inverse of disseminat...
Waseem Ahmad, Ashfaq A. Khokhar
EUROCRYPT
2004
Springer
13 years 11 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
EUROCRYPT
2001
Springer
14 years 2 days ago
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
Eric R. Verheul
SBACPAD
2007
IEEE
143views Hardware» more  SBACPAD 2007»
14 years 1 months ago
A Code Compression Method to Cope with Security Hardware Overheads
Code Compression has been used to alleviate the memory requirements as well as to improve performance and/or minimize energy consumption. On the other hand, implementing security ...
Eduardo Wanderley Netto, Romain Vaslin, Guy Gognia...
HIPEAC
2007
Springer
14 years 1 months ago
Compiler-Assisted Memory Encryption for Embedded Processors
A critical component in the design of secure processors is memory encryption which provides protection for the privacy of code and data stored in off-chip memory. The overhead of ...
Vijay Nagarajan, Rajiv Gupta, Arvind Krishnaswamy