ePrint Report: A Survey to Zero-Knowledge Interactive Verifiable Computing: Utilizing Randomness in Low-Degree Polynomials Angold Wang This survey provides a comprehensive examination of zero-knowledge interactive verifiable computing, emphasizing the utilization of randomnes in low-degree polynomials. We begin by tracing the evolution of general-purpose verifiable computing, starting with the foundational concepts of complexity theory developed in…

ePrint Report: Efficient CPA Attack on Hardware Implementation of ML-DSA in Post-Quantum Root of Trust Merve Karabulut, Reza Azarderakhsh Side-channel attacks (SCA) pose a significant threat to cryptographic implementations, including those designed to withstand the computational power of quantum computers. This paper introduces the first side-channel attack on an industry-grade post-quantum cryptography implementation, Adam’s Bridge.…

ePrint Report: A Combinatorial Approach to IoT Data Security Anandarup Roy, Bimal Kumar Roy, Kouichi Sakurai, Suprita Talnikar This article explores the potential of Secret Sharing-Based Internet of Things (SBIoT) as a promising cryptographic element across diverse applications, including secure data storage in commercial cloud systems (Datachest), smart home environments (encompassing sensors, cameras, smart locks,…

ePrint Report: DL-SCADS: Deep Learning-Based Post-Silicon Side-Channel Analysis Using Decomposed Signal Dipayan Saha, Farimah Farahmandi Side-channel analysis (SCA) does not aim at the algorithm’s weaknesses but rather its implementations. The rise of machine learning (ML) and deep learning (DL) is giving adversaries advanced capabilities to perform stealthy attacks. In this paper, we propose DL-SCADS, a…

ePrint Report: Asymptotically Optimal Adaptive Asynchronous Common Coin and DKG with Silent Setup Hanwen Feng, Qiang Tang This paper presents the first optimal-resilient, adaptively secure asynchronous common coin protocol with $O(lambda n^2)$ communication complexity and $O(1)$ rounds, requiring only a public silent setup. Our protocol immediately implies a sequence of quadratic-communication, constant-round asynchronous Byzantine agreement…

ePrint Report: MicroNova: Folding-based arguments with efficient (on-chain) verification Jiaxing Zhao, Srinath Setty, Weidong Cui We describe the design and implementation of MicroNova, a folding-based recursive argument for producing proofs of incremental computations of the form $y = F^{(ell)}(x)$, where $F$ is a possibly non-deterministic computation (encoded using a constraint system such as R1CS), $x$…

ePrint Report: Compact Key Storage in the Standard Model Yevgeniy Dodis, Daniel Jost In recent work [Crypto’24], Dodis, Jost, and Marcedone introduced Compact Key Storage (CKS) as a modern approach to backup for end-to-end (E2E) secure applications. As most E2E-secure applications rely on a sequence of secrets $(s_1,…,s_n)$ from which, together with the ciphertexts sent…

ePrint Report: Non Linearizable Entropic Operator Daniel Nager In [Pan21] a linearization attack is proposed in order to break the cryp- tosystem proposed in [Gli21]. We want to propose here a non-linearizable operator that disables this attack as this operator doesn’t give raise to a quasigrup and doesn’t obey the latin square property. Go to…

ePrint Report: A Note on the Minimality of One-Way Functions in Post-Quantum Cryptography Sam Buxbaum, Mohammad Mahmoody In classical cryptography, one-way functions (OWFs) play a central role as the minimal primitive that (almost) all primitives imply. The situation is more complicated in quantum cryptography, in which honest parties and adversaries can use quantum computation and…

ePrint Report: Efficient Multi-party Private Set Union Resistant to Maximum Collusion Attacks Qiang Liu, Joon-Woo Lee Multi-party Private Set Union (MPSU) enables multiple participants to jointly compute the union of their private sets without leaking any additional information beyond the resulting union. Liu et al. (ASIACRYPT 2023) presented the first MPSU protocol that scales to…