16 search results - page 2 / 4 » How Hard is Bribery in Party Based Elections |
MMMACNS
2001
Springer
13 years 10 months ago
2001
Springer
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptoti...
IWINAC
2007
Springer
14 years 13 days ago
2007
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
CRYPTO
2006
Springer
13 years 10 months ago
2006
Springer
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
AI
2011
Springer
13 years 1 months ago
2011
Springer
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
TCC
2009
Springer
14 years 6 months ago
2009
Springer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...