150 search results - page 4 / 30 » Polynomial graph invariants from homomorphism numbers |
ENDM
2008
14 years 9 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
IACR
2011
13 years 9 months ago
2011
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...
178
click to vote
EUROCRYPT
2011
Springer
14 years 1 months ago
2011
Springer
We describe a working implementation of a variant of Gentry’s fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort b...
ENDM
2007
14 years 9 months ago
2007
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...