198 search results - page 28 / 40 » The Multiplicative Quantum Adversary |
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
AIM
1998
13 years 7 months ago
1998
Robotic soccer is a challenging research domain which involves multiple agents that need to collaborate in an adversarial environment to achieve specificobjectives. In this paper...
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
Blinding is a popular and well-known countermeasure to protect public-key cryptosystems against side-channel attacks. The high level idea is to randomize an exponentiation in order...
ICPPW
2009
IEEE
14 years 2 months ago
2009
IEEE
A significant fraction of parallel scientific codes are iterative with barriers between iterations or even between phases of the same iteration. The sender of a message is assur...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...