352 search results - page 42 / 71 » Proofs as Polynomials |
107
Voted
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
70
Voted
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
73
Voted
EUROCRYPT
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
71
Voted
PKC
2010
Springer
15 years 2 months ago
2010
Springer
We present an elementary method to construct optimized lattices that are used for finding small roots of polynomial equations. Former methods first construct some large lattice i...
90
Voted
ICISC
2004
14 years 11 months ago
2004
We propose a new broadcast encryption scheme based on polynomial interpolations. Our scheme, obtained from the Naor-Pinkas scheme by partitioning the user set and interpolating mul...