搜索结果: 1-11 共查到“Polynomial Functions”相关记录11条 . 查询时间(0.132 秒)
Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions
public-key encryption key-dependent messages chosen-ciphertext security
2016/12/10
KDM[F][F]-CCA secure public-key encryption (PKE) protects the security of message f(sk)f(sk), with f∈Ff∈F, that is computed directly from the secret key, even if the adversary has access to a decrypti...
Partitioning via Non-Linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
Ring LWE Bilinear Maps Identity-Based Encryption
2016/12/10
In this paper, we present new adaptively secure identity-based encryption (IBE) schemes. One of the distinguishing property of the schemes is that it achieves shorter public parameters than previous s...
Homomorphic Signatures with Efficient Verification for Polynomial Functions
homomorphic signatures verifiable computation
2016/1/9
A homomorphic signature scheme for a class of functions C
allows a client to sign and upload elements of some data set D on a
server. At any later point, the server can derive a (publicly verifiable...
Online-Offline Homomorphic Signatures for Polynomial Functions
Homomorphic Signatures Online-Offline Signatures
2015/12/22
The advent of cloud computing has given rise to a plethora of work
on verifiable delegation of computation. Homomorphic signatures are a powerful
tool that can be tailored for verifiable computation...
Homomorphic Signatures for Polynomial Functions
Polynomial Functions Homomorphic Signatures
2015/8/5
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 efficient algorithm t...
Homomorphic Signatures for Polynomial Functions
public-key cryptography / homomorphic signatures ideals lattices
2012/3/30
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 efficient algorithm t...
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 efficient algorithm t...
The scope of refinable functions in wavelet theory is focused to localized functions. In our
paper we like to widen that scope, in particular we show that all polynomial functions are refinable. This...
Number formula and degree level of ergodic polynomial functions over $\mathbb{Z}$/$2^{n}\mathbb{Z}$ and generalized result of linear equation on ergodic power-series T-Function
T-function ergodic polynomial ergodic power-series
2010/9/29
In this paper, using Anashin's general theory, some detail combinatorial result of stirling numbers and Larin's result , we can give the counting formula for the given degree polynomial ergodic(single...
Motivic invariant of real polynomial functions and Newton polyhedron
Zeta functions virtual Betti numbers blow-Nash equivalence
2010/12/1
We propose a computation of real motivic zeta functions for real polynomial functions, using Newton polyhedron. As a consequence we show that the weights are blow-Nash invariants of convenient weighte...
On Polynomial Functions Over Finite Commutative Rings
Polynomial function Finite commutative local ring Generalized Witt polynomial
2007/12/12
Let $R$ be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over $R$ to be a polynomial function. Before this paper, necessary a...