Results 161 to 170 of about 1,614 (201)

One-More Unforgeability of Blind ECDSA [PDF]

Lecture Notes in Computer Science, 2021
In this paper, we give the first formal security analysis on the one-more unforgeability of blind ECDSA. We start with giving a general attack on blind ECDSA, which is similar to the ROS attack on the blind Schnorr signature. We formulate the ECDSA-ROS problem to capture this attack.
Xianrui Qin, Tsz Hon Yuen, Yuen Tsz Hon
exaly   +5 more sources

One-More Unforgeability for Multi - and Threshold Signatures [PDF]

Lecture Notes in Computer Science
This paper initiates the study of one-more unforgeability for multi-signatures and threshold signatures as a stronger security goal, ensuring that ℓ executions of a signing protocol cannot result in more than ℓ signatures.
Stefano Tessaro, Tessaro Stefano
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Strong unforgeability in group signature schemes

Computer Standards and Interfaces, 2009
A signature scheme is strongly unforgeable if no adversary can produce a new valid signature @s on a message M even after seeing some signatures on M. We define strong unforgeability of group signature schemes and explain why the strong unforgeability of a group signature scheme is necessary. This relatively new security concept was not considered when
Ikkwon Yie, Junghwan Song
exaly   +2 more sources

User-Mediated Authentication Protocols and Unforgeability in Key Collision [PDF]

International Journal of Information Security, 2018
This research provides a computational analysis of the ISO 9798-6 standard’s Mechanism 7a authentication protocol. In contrast to typical authentication protocols, ISO 9798-6 mechanism 7a requires user interaction and aims to authenticate data possession instead of identities. Consequently, we introduce a 3-party possession user mediated authentication
Hale, Britta, Britta Hale
openaire   +3 more sources

QCB is Blindly Unforgeable [PDF]

, 2023
QCB is a proposal for a post-quantum secure, rate-one authenticated encryption with associated data scheme (AEAD) based on classical OCB3 and \(\Theta\)CB, which are vulnerable against a quantum adversary in the Q2 setting.
Jannis Leuther, Stefan Lucks
openaire   +3 more sources

Some Thoughts on Strong Unforgeability in Ring Signature Schemes

Advanced Materials Research, 2012
A signature scheme is strongly unforgeable if the adversary cannot produce a new signature even on a queried message. Some methods have been proposed to enhance some regular signatures.
Wang, Chen
exaly   +4 more sources

BUFFing signature schemes beyond unforgeability and the case of post-quantum signatures

, 2021
Modern digital signature schemes can provide more guarantees than the standard notion of(strong) unforgeability, such as offering security even in the presence of maliciously generated keys, or requiring to know a message to produce a signature for it ...
Cas Cremers, Marc Fischlin, Christian Janson   +2 more
exaly   +2 more sources

Strong Designated Verifier Signature Scheme with Undeniability and Strong Unforgeability in the Standard Model

Applied Sciences (Switzerland), 2019
Strong designated verifier signature can provide an efficient way to protect the identity privacy of the signer and the integrity of the data transmitted over the public channel.
Xiaodong Yang, Guilan Chen, Ting Li
exaly   +2 more sources

The Role of Message-Bound Signatures for the Beyond UnForgeability Features and Weak Keys [PDF]

Lecture Notes in Computer Science
In the present work, we establish a new relationship among the Beyond UnForgeability Features (BUFF) introduced by Cremers et al. (SP’21). There, the BUFF notions have been shown to be independent of one another.
Patrick Struck
exaly   +1 more source