Security issues of CFS-like digital signature algorithms

12/01/2021
by   Giuseppe D'Alconzo, et al.
0

We analyse the security of some variants of the CFS code-based digital signature scheme. We show how the adoption of some code-based hash-functions to improve the efficiency of CFS leads to the ability of an attacker to produce a forgery compatible to the rightful user's public key.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2020

Security analysis of the W-OTS^+ signature scheme: Updating security bounds

In this work, we discuss in detail a flaw in the original security proof...
research
06/29/2022

A note on a Code-Based Signature Scheme

In this work, we exploit a serious security flaw in a code-based signatu...
research
04/09/2020

The Blob: provable incompressibility and traceability in the whitebox model

We introduce a scheme for distributing and storing software with cryptog...
research
12/08/2018

Cryptanalysis of a One-Time Code-Based Digital Signature Scheme

In this paper, we consider a one-time digital signature scheme recently ...
research
08/29/2023

Double Public Key Signing Function Oracle Attack on EdDSA Software Implementations

EdDSA is a standardised elliptic curve digital signature scheme introduc...
research
03/01/2020

Optimal Binary/Quaternary Adaptive Signature Design for Code-Division Multiplexing

We consider signature waveform design for synchronous code division mult...
research
11/28/2020

Delegated RingCT: faster anonymous transactions

We present a modification to RingCT protocol with stealth addresses that...

Please sign up or login with your details

Forgot password? Click here to reset