14518 search results - page 188 / 2904 » Two Problems for Sophistication |
116
Voted
ASIACRYPT
2008
Springer
15 years 2 months ago
2008
Springer
In this paper, we show that two variants of Stern's identification scheme [IEEE Transaction on Information Theory '96] are provably secure against concurrent attack unde...
122
Voted
WCE
2007
15 years 1 months ago
2007
—We consider Initial-Boundary value problems associated with nonlinear hyperbolic partial differential equation in three independent variables, in a general setting wherein the ...
99
Voted
CORR
2010
Springer
15 years 23 days ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
69
Voted
EOR
2006
15 years 21 days ago
2006
There are many resource restrictions in real production/inventory systems (for example, budget, storage, transportation capacity, etc.). But unlike other research areas, there is ...
COMPUTING
2007
15 years 20 days ago
2007
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...