71 search results - page 8 / 15 » Computationally Private Randomizing Polynomials and Their Ap... |
CRYPTO
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some speciļ¬ed coalition of k excl...
ASIACRYPT
2004
Springer
14 years 24 days ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
RECOMB
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. In this paper, we focus on ļ¬nding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We deļ¬ne a generalization of th...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
BROADNETS
2004
IEEE
13 years 11 months ago
2004
IEEE
Multi-homed, mobile wireless computing and communication devices can spontaneously form communities to logically combine and share the bandwidth of each other's wide-area com...