Sciweavers

313 search results - page 7 / 63
» Solving Structured Polynomial Systems and Applications to Cr...
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
ICMLA
2009
13 years 6 months ago
Exact Graph Structure Estimation with Degree Priors
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
Bert Huang, Tony Jebara
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
14 years 25 days ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
TCC
2009
Springer
123views Cryptology» more  TCC 2009»
14 years 9 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
SIAMJO
2008
108views more  SIAMJO 2008»
13 years 8 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel