Sciweavers

116 search results - page 2 / 24
» Efficient and Secure Evaluation of Multivariate Polynomials ...
Sort
View
EUROCRYPT
2011
Springer
12 years 10 months ago
Homomorphic Signatures for Polynomial Functions
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...
Dan Boneh, David Mandell Freeman
DAGSTUHL
2006
13 years 8 months ago
Probabilistically Stable Numerical Sparse Polynomial Interpolation
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomia...
Mark Giesbrecht, George Labahn, Wen-shin Lee
EUROCRYPT
2006
Springer
13 years 10 months ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
13 years 9 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
AES
2004
Springer
151views Cryptology» more  AES 2004»
14 years 9 days ago
General Principles of Algebraic Attacks and New Design Criteria for Cipher Components
This paper is about the design of multivariate public key schemes, as well as block and stream ciphers, in relation to recent attacks that exploit various types of multivariate alg...
Nicolas Courtois