Intel

ePrint Report: On Hull Attacks on the Module Lattice Isomorphism Problem Franciele C. Silva, Maja Lie, Cong Ling The Lattice Isomorphism Problem (LIP) is a relatively recent cryptographic assumption whose precise hardness remains not fully understood. Certain weak instances have been identified through hull attacks on $p$-ary lattices constructed via Construction A using linear codes…

ePrint Report: On the (strong) linkability of Linkable Ring Signatures Danai Balla, Pyrros Chaidos We demonstrate that the LLRing linkable ring signature scheme of Hui and Chau (ESORICS 2024) has a unlinkability vulnerability, meaning an adversary can create more unlinkable signatures than the number of secret keys they own, contradicting its security guarantees. We also…

ePrint Report: An Attack to Universally Composable Commitments from Malicious Physically Uncloneable Functions and how to Avoid it Lourenço Abecasis, Paulo Mateus, Chrysoula Vlachou In this work, we explore the possibility of unconditionally secure universally composable (UC) commitments, a very relevant cryptographic primitive in the context of secure multi-party computation. To this end, we assume…

ePrint Report: A Zero-Knowledge Proof for the Syndrome Decoding Problem in the Lee Metric Mladen Kovačević, Tatjana Grbić, Darko Čapko, Nemanja Nedić, Srđan Vukmirović The syndrome decoding problem is one of the NP-complete problems lying at the foundation of code-based cryptography. The variant thereof where the distance between vectors is measured with respect to the…

ePrint Report: Gluon W: A Cryptocurrency Stabilization Protocol Bruno Woltzenlogel Paleo, Luca D’Angelo, Mohammad Shaheer, Giselle Reis This paper introduces Gluon W, a novel stablecoin protocol inspired by nuclear physics and named after the particle responsible for the stability of matter in the universe. The key idea in Gluon W is to split (as in…

ePrint Report: Securing Credential Sequence Verification Mamunur Rashid Akand, Reihaneh Safavi-Naini Credentials are used to verify a user’s identity and attributes and form the basis of securing user access to the system resources. Users obtain credentials and store them on their (mobile) devices, and present them when needed. Anonymous credentials protect the user’s identity, and…

Award: Announcing the 2025 IACR Test-of-Time Award for Crypto We are proud to announce the winners of the 2024 IACR Test-of-Time Award for Crypto. The IACR Test-of-Time Award honors papers published at the 3 IACR flagship conferences 15 years ago which have had a lasting impact on the field. The Test-of-Time award for Crypto 2010…

ePrint Report: Randomized Distributed Function Computation (RDFC): Ultra-Efficient Semantic Communication Applications to Privacy Onur Gunlu We establish the randomized distributed function computation (RDFC) framework, in which a sender transmits just enough information for a receiver to generate a randomized function of the input data. Describing RDFC as a form of semantic communication, which can be…

ePrint Report: Cube-Attack-Like Cryptanalysis of Keccak-Based Constructions Exploiting State Differences (Full Version) MOHAMMAD VAZIRI, Vesselin Velichkov This paper presents an enhancement to cube-attack-like cryptanalysis by minimizing output-bit dependency on related key bits, thereby improving attack complexity. We construct two distinct initial states differing exclusively in predetermined bit positions. Through independent cube summation and state difference…

ePrint Report: Post-Quantum Readiness in EdDSA Chains Foteini Baldimtsi, Konstantinos Chalkias, Arnab Roy The impending threat posed by large-scale quantum computers necessitates a reevaluation of signature schemes deployed in blockchain protocols. In particular, blockchains relying on ECDSA, such as Bitcoin and Ethereum, exhibit inherent vulnerabilities due to on-chain public key exposure and the lack of…