Sciweavers

116 search results - page 3 / 24
» Efficient and Secure Evaluation of Multivariate Polynomials ...
Sort
View
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 6 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
ASIACRYPT
2010
Springer
13 years 5 months ago
Constant-Size Commitments to Polynomials and Their Applications
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...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg
TCC
2005
Springer
132views Cryptology» more  TCC 2005»
14 years 11 days ago
Evaluating 2-DNF Formulas on Ciphertexts
Let ψ be a 2-DNF formula on boolean variables x1, . . . , xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an en...
Dan Boneh, Eu-Jin Goh, Kobbi Nissim
ESORICS
2009
Springer
14 years 7 months ago
Secure Evaluation of Private Linear Branching Programs with Medical Applications
Abstract. Diagnostic and classification algorithms play an important role in data analysis, with applications in areas such as health care, fault diagnostics, or benchmarking. Bran...
Mauro Barni, Pierluigi Failla, Vladimir Kolesnikov...
MOC
2010
13 years 1 months ago
The structure of balanced multivariate biorthogonal multiwavelets and dual multiframelets
Abstract. Multiwavelets and multiframelets are of interest in several applications such as numerical algorithms and signal processing, due to their desirable properties such as hig...
Bin Han