29 search results - page 3 / 6 » Homomorphic Signatures for Polynomial Functions |
FROCOS
2005
Springer
14 years 1 months ago
2005
Springer
In a previous paper, we have introduced a general approach for connecting two many-sorted theories through connection functions that behave like homomorphisms on the shared signatu...
DATE
1999
IEEE
13 years 12 months ago
1999
IEEE
We formalize the problem of analog data compression and analyze the existence of a polynomial data compression function. Under relaxed conditions we explore the existence of a sol...
DISCO
1993
13 years 11 months ago
1993
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
FC
2004
Springer
14 years 1 months ago
2004
Springer
Looking at current cryptographic-based e-voting protocols, one can distinguish three basic design paradigms (or approaches): (a) Mix-Networks based, (b) Homomorphic Encryption base...