28 search results - page 5 / 6 » Concurrent Composition in the Bounded Quantum Storage Model |
IACR
2011
12 years 7 months ago
2011
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
SPAA
2003
ACM
14 years 26 days ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
PADS
2000
ACM
13 years 12 months ago
2000
ACM
Multi-agent systems comprise multiple, deliberative agents embedded in and recreating patterns of interactions. Each agent’s execution consumes considerable storage and calculat...
FSTTCS
2003
Springer
14 years 25 days ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...