198 search results - page 22 / 40 » The Multiplicative Quantum Adversary |
TIT
2008
13 years 7 months ago
2008
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Denoting by P = [k]G the elliptic-curve double-and-add multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representa...
AIPS
2004
13 years 9 months ago
2004
Coordinated action for a team of robots is a challenging problem, especially in dynamic, unpredictable environments. Robot soccer is an instance of a domain where well defined goa...
ESORICS
2011
Springer
12 years 7 months ago
2011
Springer
This paper critically examines some recently proposed RFID privacy models. It shows that some models suffer from weaknesses such as insufficient generality and unrealistic assumpt...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...