20 search results - page 2 / 4 » Weak Adversaries for the k-Server Problem |
TCC
2012
Springer
12 years 26 days ago
2012
Springer
The (decisional) learning with errors problem (LWE) asks to distinguish “noisy” inner products of a secret vector with random vectors from uniform. In recent years, the LWE pro...
IACR
2011
12 years 5 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. ...
QEST
2007
IEEE
13 years 11 months ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
Forgery and counterfeiting are emerging as serious security risks in low-cost pervasive computing devices. These devices lack the computational, storage, power, and communication r...
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...