ePrint Report: TallyGuard: Privacy Preserving Tallied-as-cast Guarantee Athish Pranav Dharmalingam, Sai Venkata Krishnan, KC Sivaramakrishnan, N.S. Narayanaswamy This paper presents a novel approach to verifiable vote tallying using additive homomorphism, which can be appended to existing voting systems without modifying the underlying infrastructure. Existing End-to-End Verifiable (E2E-V) systems like Belenios and ElectionGuard rely on distributed…

ePrint Report: Breaking the Blindfold: Deep Learning-based Blind Side-channel Analysis Azade Rezaeezade, Trevor Yap, Dirmanto Jap, Shivam Bhasin, Stjepan Picek Physical side-channel analysis (SCA) operates on the foundational assumption of access to known plaintext or ciphertext. However, this assumption can be easily invalidated in various scenarios, ranging from common encryption modes like Cipher Block Chaining…

ePrint Report: Optimizing Key Recovery in Impossible Cryptanalysis and Its Automated Tool Jianing Zhang, Haoyang Wang Impossible differential (ID) cryptanalysis and impossible boomerang (IB) cryptanalysis are two methods of impossible cryptanalysis against block ciphers. Since the seminal work introduced by Boura et al. in 2014, there have been no substantial advancements in the key recovery…

ePrint Report: Error floor prediction with Markov models for QC-MDPC codes Sarah Arpin, Jun Bo Lau, Ray Perlner, Angela Robinson, Jean-Pierre Tillich, Valentin Vasseur Quasi-cyclic moderate-density parity check (QC-MDPC) code-based encryption schemes under iterative decoders offer highly-competitive performance in the quantum-resistant space of cryptography, but the decoding-failure rate (DFR) of these algorithms are not well-understood.…

ePrint Report: Shadowfax: Combiners for Deniability Phillip Gajland, Vincent Hwang, Jonas Janneck As cryptographic protocols transition to post-quantum security, most adopt hybrid solutions combining pre-quantum and post-quantum assumptions. However, this shift often introduces trade-offs in terms of efficiency, compactness, and in some cases, even security. One such example is deniability, which enables users, such as…

ePrint Report: Quantum function secret sharing Alex B. Grilo, Ramis Movassagh We propose a quantum function secret sharing scheme in which the communication is exclusively classical. In this primitive, a classical dealer distributes a secret quantum circuit $C$ by providing shares to $p$ quantum parties. The parties on an input state $ket{psi}$ and a projection…

ePrint Report: Efficient Quantum-safe Distributed PRF and Applications: Playing DiSE in a Quantum World Sayani Sinha, Sikhar Patranabis, Debdeep Mukhopadhyay We propose the first $textit{distributed}$ version of a simple, efficient, and provably quantum-safe pseudorandom function (PRF). The distributed PRF (DPRF) supports arbitrary threshold access structures based on the hardness of the well-studied Learning with Rounding…

Job Posting: Researcher in Cryptographic Protocols and Key Exchange Technology Innovation Institute (TII), Abu Dhabi, UAE We are looking for a permanent researcher to join the Cryptographic Protocols team within the Cryptography Research Center (CRC) at TII. The main task of the team is to conduct applied academic research and assist in product development, spanning…