Alireza Gharib Blog

Event Calendar: WEIS 2025: The 24th Annual Workshop on the Economics of Information Security Tokyo, Japan, 23 June – 25 June 2025 Event date: 23 June to 25 June 2025 Submission deadline: 31 January 2025 Notification: 14 March 2025 Go to Source

Event Calendar: RWMPC 2025: Real World MPC (RWMPC 2025) Workshop Sofia, Bulgaria, 25 March 2025 Event date: 25 March 2025 Submission deadline: 28 January 2025 Notification: 14 February 2025 Go to Source

Event Calendar: MOZAIK Winter School 2025 Leuven, Belgium, 31 March – 4 April 2025 Event date: 31 March to 4 April 2025 Go to Source

Event Calendar: CAW ’25: Cryptographic Applications Workshop 2025 Madrid, Spain, 4 May – Event date: 4 May to Submission deadline: 7 February 2025 Go to Source

Event Calendar: PBC 2025: Permutation-based Crypto 2025 Madrid, Spain, 4 May 2025 Event date: 4 May 2025 Submission deadline: 28 February 2025 Notification: 15 March 2025 Go to Source

ePrint Report: Forking the RANDAO: Manipulating Ethereum’s Distributed Randomness Beacon Ábel Nagy, János Tapolcai, István András Seres, Bence Ladóczki Proof-of-stake consensus protocols often rely on distributed randomness beacons (DRBs) to generate randomness for leader selection. This work analyses the manipulability of Ethereum’s DRB implementation, RANDAO, in its current consensus mechanism. Even with its efficiency, RANDAO…

ePrint Report: Scalable Post-Quantum Oblivious Transfers for Resource-Constrained Receivers Aydin Abadi, Yvo Desmedt It is imperative to modernize traditional core cryptographic primitives, such as Oblivious Transfer (OT), to address the demands of the new digital era, where privacy-preserving computations are executed on low-power devices. This modernization is not merely an enhancement but a necessity to…

ePrint Report: Long Paper: All-You-Can-Compute: Packed Secret Sharing for Combined Resilience Sebastian Faust, Maximilian Orlt, Kathrin Wirschem, Liang Zhao Unprotected cryptographic implementations are vulnerable to implementation attacks, such as passive side-channel attacks and active fault injection attacks. Recently, countermeasures like polynomial masking and duplicated masking have been introduced to protect implementations against combined attacks that…

ePrint Report: ZODA: Zero-Overhead Data Availability Alex Evans, Nicolas Mohnblatt, Guillermo Angeris We introduce ZODA, short for ‘zero-overhead data availability,’ which is a protocol for proving that symbols received from an encoding (for tensor codes) were correctly constructed. ZODA has optimal overhead for both the encoder and the samplers. Concretely, the ZODA scheme incurs essentially…

ePrint Report: Parametrizing Maximal Orders Along Supersingular $ell$-Isogeny Paths Laia Amorós, James Clements, Chloe Martindale Suppose you have a supersingular $ell$-isogeny graph with vertices given by $j$-invariants defined over $mathbb{F}_{p^2}$, where $p = 4 cdot f cdot ell^e – 1$ and $ell equiv 3 pmod{4}$. We give an explicit parametrization of the maximal orders in…