Making Code Voting Secure against Insider Threats using Unconditionally Secure MIX Schemes and Human PSMT Protocols

Code voting was introduced by Chaum as a solution for using a possibly infected-by-malware device to cast a vote in an electronic voting application. Chaum's work on code voting assumed voting codes are physically delivered to voters using the mail system, implicitly requiring to trust the mail system. This is not necessarily a valid assumption to make - especially if the mail system cannot be trusted. When conspiring with the recipient of the cast ballots, privacy is broken. It is clear to the public that when it comes to privacy, computers and "secure" communication over the Internet cannot fully be trusted. This emphasizes the importance of using: (1) Unconditional security for secure network communication. (2) Reduce reliance on untrusted computers. In this paper we explore how to remove the mail system trust assumption in code voting. We use PSMT protocols (SCN 2012) where with the help of visual aids, humans can carry out $\mod 10$ addition correctly with a 99\% degree of accuracy. We introduce an unconditionally secure MIX based on the combinatorics of set systems. Given that end users of our proposed voting scheme construction are humans we \emph{cannot use} classical Secure Multi Party Computation protocols. Our solutions are for both single and multi-seat elections achieving: \begin{enumerate}[i)] \item An anonymous and perfectly secure communication network secure against a $t$-bounded passive adversary used to deliver voting, \item The end step of the protocol can be handled by a human to evade the threat of malware. \end{enumerate} We do not focus on active adversaries

Isogeny-based post-quantum key exchange protocols

The goal of this project is to understand and analyze the supersingular isogeny Diffie Hellman (SIDH), a post-quantum key exchange protocol which security lies on the isogeny-finding problem between supersingular elliptic curves. In order to do so, we first introduce the reader to cryptography focusing on key agreement protocols and motivate the rise of post-quantum cryptography as a necessity with the existence of the model of quantum computation. We review some of the known attacks on the SIDH and finally study some algorithmic aspects to understand how the protocol can be implemented

Framework for classifying logical operators in stabilizer codes

Entanglement, as studied in quantum information science, and non-local quantum correlations, as studied in condensed matter physics, are fundamentally akin to each other. However, their relationship is often hard to quantify due to the lack of a general approach to study both on the same footing. In particular, while entanglement and non-local correlations are properties of states, both arise from symmetries of global operators that commute with the system Hamiltonian. Here, we introduce a framework for completely classifying the local and non-local properties of all such global operators, given the Hamiltonian and a bi-partitioning of the system. This framework is limited to descriptions based on stabilizer quantum codes, but may be generalized. We illustrate the use of this framework to study entanglement and non-local correlations by analyzing global symmetries in topological order, distribution of entanglement and entanglement entropy.Comment: 20 pages, 9 figure

Dagstuhl Reports : Volume 1, Issue 2, February 2011

Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro Pezzé, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn

From Necklace Quivers to the F-theorem, Operator Counting, and T(U(N))

The matrix model of Kapustin, Willett, and Yaakov is a powerful tool for exploring the properties of strongly interacting superconformal Chern-Simons theories in 2+1 dimensions. In this paper, we use this matrix model to study necklace quiver gauge theories with {\cal N}=3 supersymmetry and U(N)^d gauge groups in the limit of large N. In its simplest application, the matrix model computes the free energy of the gauge theory on S^3. The conjectured F-theorem states that this quantity should decrease under renormalization group flow. We show that for a simple class of such flows, the F-theorem holds for our necklace theories. We also provide a relationship between matrix model eigenvalue distributions and numbers of chiral operators that we conjecture holds more generally. Through the AdS/CFT correspondence, there is therefore a natural dual geometric interpretation of the matrix model saddle point in terms of volumes of 7-d tri-Sasaki Einstein spaces and some of their 5-d submanifolds. As a final bonus, our analysis gives us the partition function of the T(U(N)) theory on S^3.Comment: 3 figures, 41 pages; v2 minor improvements, refs adde

Cryptography from tensor problems

We describe a new proposal for a trap-door one-way function. The new proposal belongs to the "multivariate quadratic" family but the trap-door is different from existing methods, and is simpler

On the Communication Complexity of High-Dimensional Permutations

We study the multiparty communication complexity of high dimensional permutations in the Number On the Forehead (NOF) model. This model is due to Chandra, Furst and Lipton (CFL) who also gave a nontrivial protocol for the Exactly-n problem where three players receive integer inputs and need to decide if their inputs sum to a given integer n. There is a considerable body of literature dealing with the same problem, where (N,+) is replaced by some other abelian group. Our work can be viewed as a far-reaching extension of this line of research. We show that the known lower bounds for that group-theoretic problem apply to all high dimensional permutations. We introduce new proof techniques that reveal new and unexpected connections between NOF communication complexity of permutations and a variety of well-known problems in combinatorics. We also give a direct algorithmic protocol for Exactly-n. In contrast, all previous constructions relied on large sets of integers without a 3-term arithmetic progression