Results 71 to 80 of about 291 (124)

LDSEGoV: An Efficient Lightweight Digital-Signature Algorithm Based on CDLP and Provable Security for E-Governance Authentication

open access: yesJournal of Cybersecurity and Privacy
Digital signatures serve as a crucial cryptographic primitive in an e-governance system for authenticating citizen-government interactions. Traditional methods (DSA, ECDSA) impose computational overhead on resource-limited endpoints and centralized ...
Seema Sirpal, Pardeep Singh, Om Pal
doaj   +1 more source

Secure ECDSA SRAM-PUF Based on Universal Single/Double Scalar Multiplication Architecture

open access: yesMicromachines
Physically unclonable functions (PUFs) are crucial for enhancing cybersecurity by providing unique, intrinsic identifiers for electronic devices, thus ensuring their authenticity and preventing unauthorized cloning.
Jingqi Zhang   +8 more
doaj   +1 more source

Secure and scalable client pre-filtering and authentication framework for federated learning systems

open access: yesScientific Reports
A federated learning system, which emphasises decentralisation, allows cooperative model training to ensure the privacy and security of the data. Client authentication is an important factor in a decentralised system to prevent unauthorised access and ...
Prince Rana, Amritpal Singh
doaj   +1 more source

ECDSA-based tamper detection in medical data using a watermarking technique

open access: yesInternational Journal of Cognitive Computing in Engineering
Telemedicine is a form of healthcare delivery that employs communication technology to provide medical care to patients remotely. The use of telemedicine has seen a significant increase in recent years, presenting challenges such as patient privacy, data
Rupa Ch   +3 more
doaj   +1 more source

A structural mapping of ECDSA

open access: yes
A structural mapping of ECDSA a unified geometric interpretation 
openaire   +2 more sources

Undetectable secret key recovery for the ECDSA digital signature algorithm

open access: yesБезопасность информационных технологий, 2010
The following article describes a cryptographic device design, allowing to steal secret keys, the device is using to create digital signatures. The external observer cannot detect this attack without knowing the attacker’s secret key.
A. V. Kovalev, M. A. Ivanov
doaj  

On the BUFF security of ECDSA with key recovery

open access: yesDesigns, Codes and Cryptography
Abstract In the usual syntax of digital signatures, the verification algorithm takes a verification key in addition to a signature and a message, whereas in ECDSA with key recovery, which is used in Ethereum, no verification key is input to the verification algorithm.
openaire   +2 more sources

ECDSA Weak Randomness in Bitcoin

Future Generation Computer Systems, 2020
Abstract Bitcoin security draws more and more attention recently. One of Bitcoin vulnerabilities is caused by ECDSA weak randomness. A random number is not cryptographically secure, which leads to private key leakage and even fund theft. This security problem has been well known in Bitcoin community and fixed by applying RFC 6979 update in 2013.
Zongyang Zhang, Jianwei Liu
exaly   +2 more sources

NOMOP-ECDSA: A Lightweight ECDSA Engine for Internet of Things

Wireless Personal Communications, 2021
Internet of Things (IoT) has received attention recently, featuring tremendous applications. Due to the lack of authentication, popular IoT applications are prone to various attacks. However, because of resource limitation and heterogeneous characteristics of IoT applications, the cryptographic algorithms may fail to be universal adopted and thus, it ...
Xiao-bao Yang 0001   +5 more
openaire   +2 more sources

Threshold ECDSA From ECDSA Assumptions: The Multiparty Case [PDF]

open access: yes2019 IEEE Symposium on Security and Privacy (SP), 2019
Cryptocurrency applications have spurred a resurgence of interest in the computation of ECDSA signatures using threshold protocols---that is, protocols in which the signing key is secret-shared among n parties, of which any subset of size t must interact in order to compute a signature. Among the resulting works to date, that of Doerner et al. requires
Jack Doerner   +2 more
exaly   +4 more sources

Home - About - Disclaimer - Privacy