Sciweavers

352 search results - page 27 / 71
» Proofs as Polynomials
Sort
View
TCC
2009
Springer
123views Cryptology» more  TCC 2009»
14 years 8 months ago
Hierarchical Identity Based Encryption with Polynomially Many Levels
We present the first hierarchical identity based encryption (HIBE) system that has full security for more than a constant number of levels. In all prior HIBE systems in the literat...
Craig Gentry, Shai Halevi
DCG
2007
58views more  DCG 2007»
13 years 7 months ago
Harmonic Algebraic Curves and Noncrossing Partitions
Motivated by Gauss’s first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bou...
Jeremy L. Martin, David Savitt, Ted Singer
LOGCOM
2010
88views more  LOGCOM 2010»
13 years 5 months ago
Tableaux for Public Announcement Logic
Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In thi...
Philippe Balbiani, Hans P. van Ditmarsch, Andreas ...
JAT
2010
109views more  JAT 2010»
13 years 5 months ago
Networks of polynomial pieces with application to the analysis of point clouds and images
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
Ery Arias-Castro, Boris Efros, Ofer Levi
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 7 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin