19866 search results - page 175 / 3974 » Computing all factorizations in *** |
199
click to vote
IACR
2011
14 years 6 months ago
2011
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
174
click to vote
SIGCSE
2006
ACM
16 years 14 days ago
2006
ACM
A hands-on embedded computing project is introduced into an undergraduate social sciences course. In the pilot module, nine student teams created working prototypes, using the tec...
154
click to vote
ICDCS
2007
IEEE
16 years 25 days ago
2007
IEEE
This paper proposes a methodology for designing a class of algorithms for computing functions in dynamic distributed systems in which communication channels and processes may ceas...
171
click to vote
NDSS
1999
IEEE
15 years 10 months ago
1999
IEEE
We describe an implementation of a distributed algorithm to generate a shared RSA key. At the end of the computation, an RSA modulus N = pq is publicly known. All servers involved...
171
click to vote
EDBTW
2006
Springer
15 years 10 months ago
2006
Springer
This paper is a critical analysis of the concept of ontology thus as it is used in computing science. It identifies three main problems with such a concept, two of which are intri...