29 search results - page 1 / 6 » Homomorphic Signatures for Polynomial Functions |
EUROCRYPT
2011
Springer
12 years 10 months ago
2011
Springer
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
PKC
2012
Springer
11 years 9 months ago
2012
Springer
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
ISSAC
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polyn...
ASIACRYPT
2010
Springer
13 years 4 months ago
2010
Springer
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
EUROCRYPT
2011
Springer
12 years 10 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...