Loading...

Randomized partial checking revisited

Khazaei, S ; Sharif University of Technology | 2013

281 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-642-36095-4_8
  3. Publisher: 2013
  4. Abstract:
  5. We study mix-nets with randomized partial checking (RPC) as proposed by Jakobsson, Juels, and Rivest (2002). RPC is a technique to verify the correctness of an execution both for Chaumian and homomorphic mix-nets. The idea is to relax the correctness and privacy requirements to achieve a more efficient mix-net. We identify serious issues in the original description of mix-nets with RPC and show how to exploit these to break both correctness and privacy, both for Chaumian and homomorphic mix-nets. Our attacks are practical and applicable to real world mix-net implementations, e.g., the Civitas and the Scantegrity voting systems
  6. Keywords:
  7. Mix-net ; Privacy requirements ; Voting systems ; Cryptography ; Voting machines ; Computerized tomography
  8. Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 7779 LNCS , February , 2013 , Pages 115-128 ; 03029743 (ISSN) ; 9783642360947 (ISBN)
  9. URL: http://link.springer.com/chapter/10.1007%2F978-3-642-36095-4_8