Ballot secrecy with malicious bulletin boards

Ben Smyth (1, 2) , David Bernhard (3)

1 Mathematical and Algorithmic Sciences Lab [Paris]
2 PROSECCO - Programming securely with cryptography
3 University of Bristol [Bristol]

This letter proposes a formal definition of ballot secrecy in the computational model of cryptography. The definition builds upon and strengthens earlier definitions by Bernhard et al. (ASIACRYPT'12, ESORICS'11 & ESORICS'13). The new definition is intended to ensure that ballot secrecy is preserved in the presence of malicious bulletin boards, whereas earlier definitions by Bernhard et al. only consider honest bulletin boards.

Domaines: Cryptographie et sécurité [cs.CR]

Ben Smyth, David Bernhard. Ballot secrecy with malicious bulletin boards. [Research Report] 2014/822, Cryptology ePrint Archive. 2014, pp.7. ⟨hal-01102306⟩