Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Nakarmi, Abhinav"'
Autor:
Agrawal, Prashant, Nakarmi, Abhinav, Jhawar, Mahavir Prasad, Sharma, Subodh, Banerjee, Subhashis
Publikováno v:
Proceedings on Privacy Enhancing Technologies 2024(2)
We introduce the notion of \emph{traceable mixnets}. In a traditional mixnet, multiple mix-servers jointly permute and decrypt a list of ciphertexts to produce a list of plaintexts, along with a proof of correctness, such that the association between
Externí odkaz:
http://arxiv.org/abs/2305.08138
Autor:
Agrawal, Prashant, Nakarmi, Abhinav, Jhanwar, Mahabir Prasad, Sharma, Subodh, Banerjee, Subhashis
We study the problem of simultaneously addressing both ballot stuffing and participation privacy for pollsite voting systems. Ballot stuffing is the attack where fake ballots (not cast by any eligible voter) are inserted into the system. Participatio
Externí odkaz:
http://arxiv.org/abs/2210.14833
Autor:
Agrawal, Prashant, Tomer, Kabir, Nakarmi, Abhinav, Jhanwar, Mahabir Prasad, Sharma, Subodh, Banerjee, Subhashis
Publikováno v:
E-Vote-ID 2023. Lecture Notes in Computer Science, vol 14230
In this paper we address the problem of recovery from failures without re-running entire elections when elections fail to verify. We consider the setting of \emph{dual voting} protocols, where the cryptographic guarantees of end-to-end verifiable vot
Externí odkaz:
http://arxiv.org/abs/1908.09557