Blockchain Papers

Anit Kumar Ghosal, Dipanwita RoyChowdhury

No abstract is available for this record.

Christina Boura, Margot Funk, Yann Rotella

No abstract is available for this record.

Hanyu Jia, Xiangxue Li

No abstract is available for this record.

Anupam Chattopadhyay, Shivam Bhasin, Stjepan Picek, Chester Rebeiro

No abstract is available for this record.

Lin Jiao, Yongqiang Li, Yonglin Hao, Xinxin Gong

As the practical applications of fully homomorphic encryption (FHE), secure multi‐party computation (MPC) and zero‐knowledge (ZK) proof continue to increase, so does the need to design and analyze new symmetric‐key primitives that can adapt to these privacy‐preserving protocols. These designs typically have low multiplicative complexity and depth with the parameter domain adapted to their application protocols, aiming to minimize the cost associated with the number of nonlinear operations or the multiplicative depth of their representation as circuits. In this paper, we propose two differential fault attacks against a one‐way function RAIN used for Rainier (CCS 2022), a signature scheme based on the MPC‐in‐the‐head approach and an FHE‐friendly cipher HERA used for the RtF framework (Eurocrypt 2022), respectively. We show that our attacks can recover the keys for both ciphers by only injecting a fault into the internal state and requiring only one normal and one faulty ciphertext blocks. Thus, we can use only the practical complexity of 2 26.6 /2 28.8 /2 30.4 bit operations to break the full‐round RAIN with 128/192/256‐bit keys. For full‐round HERA with 80/128‐bit key, our attack is practical with complexity the complexity of 2 20 encryptions with about 2 16 memory.

Quan Yuan, Chao Sun, Tsuyoshi Takagi

No abstract is available for this record.

Shuai Han, Shengli Liu, Dawu Gu

No abstract is available for this record.

Anders Dalskov, Daniel Escudero, Ariel Nof

No abstract is available for this record.

Andrea Basso, Mingjie Chen, Tako Boris Fouotsa, Péter Kutas · 7 authors

No abstract is available for this record.

Yongming Fan, Yuquan Xu, Christina Garman

No abstract is available for this record.

Ezekiel Ologunde

No abstract is available for this record.

Julia Kästner, Ky Nguyen, Michael Reichle

No abstract is available for this record.

Xiao Yang, Chengru Zhang, Haiyang Xue, Man Ho Au

A Verifiably Encrypted Signature (VES) scheme encrypts a digital signature in a way that allows the public to verify the validity of the encrypted signature. Recently, several practical VES schemes for ECDSA have been proposed to enable escrowed transactions with cryptocurrencies. However, these schemes are inefficient in terms of both communication and computation, or require a large lookup table. In this paper, we present two efficient VES schemes for ECDSA that improve upon previous work. The first scheme is based on Castagnos-Laguillaumie (CL) encryption, while the second is based on modified Joye-Libert (JL) encryption. Our benchmark shows that our schemes outperform existing constructions by a factor of at least 2 in both computation and communication. Additionally, our solution does not rely on any lookup table. We demonstrate that these schemes can also be generalized to design VES for Schnorr signature scheme and EdDSA. The main technical contribution of this paper, which is of independent interest, is a zero-knowledge proof for the equality of the discrete log of an elliptic-curve point and that of a JL ciphertext. Importantly, the security of our proof does not rely on any non-standard assumptions.

Tomer Ashur, Thomas Buschman, Mohammad Mahzoun

No abstract is available for this record.

Rachel Anne B. Balagbis, Orven E. Llantos

The increased internet usage after the pandemic led the UN Forum to improve cybersecurity measures, with zero-knowledge proofs (ZKP) being a viable solution for securing confidential information. ZKP protocols can be demonstrated through the binary puzzle, an NP-complete logic puzzle with four specific constraints. The key contribution of this paper is its successful implementation of the genetic algorithm as a new method to solve the binary puzzle. The optimized fitness function determined the solution at an average of 1.33-2.33 generations for populations ranging from 100 to 500. Its quadratic property calculated the solution faster than the ordinary linear fitness function.

Anaïs Barthoulot, Olivier Blazy, Sébastien Canard

No abstract is available for this record.

Hanlin Liu, Xiao Wang, Kang Yang, Yu Yu

No abstract is available for this record.

Hongrui Cui, Hanlin Liu, Di Yan, Kang Yang · 6 authors

No abstract is available for this record.

Francesca Stabile, Walter Lúcia, Amr Youssef, Giuseppe Franzè

The proliferation of cloud computing technologies has paved the way for deploying networked encrypted control systems, offering high performance, remote accessibility and privacy. However, in scenarios where the control algorithms run on third-party cloud service providers, the control’s logic might be changed by a malicious agent on the cloud. Consequently, it is imperative to verify the correctness of the control signals received from the cloud. Traditional verification methods, like zero-knowledge proof techniques, are computationally demanding in both proof generation and verification, may require several rounds of interactions between the prover and verifier and, consequently, are inapplicable in real-time control system applications. In this paper, we present a novel computationally inexpensive verifiable computing solution inspired by the probabilistic cut-and-choose approach. The proposed scheme allows the plant’s actuator to validate the computations accomplished by the encrypted cloud-based networked controller without compromising the control scheme’s performance. We showcase the effectiveness and real-time applicability of the proposed verifiable computation scheme using a remotely controlled Khepera-IV differential-drive robot.

Jules Maire, Damien Vergnaud

No abstract is available for this record.

Jules Maire, Damien Vergnaud

No abstract is available for this record.

Jing Li, Shengyu Tang

No abstract is available for this record.

Haitao Zhan, Dongyang Bai, Yuzhu Wang, Mingwu Zhang

No abstract is available for this record.

Youcef Mokrani, David Jao

No abstract is available for this record.