Results 221 to 230 of about 789 (252)

Universal forgery on Sekhar's signature scheme with message recovery

International Journal of Computer Mathematics, 2004
Owing to the abundance of electronic applications of digital signatures, many additional properties are needed. Recently, Sekhar [Sekhar, M. R. (2004). Signature scheme with message recovery and its application. Int. J. Comput. Math., 81(3), 285–289.] proposed three signature schemes with message recovery designed to protect the identity of the signer.
Fabien Laguillaumie, Jacques Traoré, Damien Vergnaud   +2 more
openaire   +1 more source

Universal forgery of the identity-based sequential aggregate signature scheme

Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, 2009
At CCS'07, a novel identity-based sequential aggregate signature scheme was proposed and the security of the scheme was proven under the hardness assumption of a new computational problem called modified LRSW problem. In the paper, unfortunately, we show that the scheme is universally forgeable, i.e., anyone can generate forged signatures on any ...
Jung Yeon Hwang, Dong Hoon Lee 0001, Moti Yung   +2 more
openaire   +1 more source

Universal Forgery and Key Recovery Attacks: Application to FKS, FKD and Keyak. [PDF]

IACR Cryptol. ePrint Arch., 2017
In this paper, we provide a security analysis of the Full-State Keyed Sponge (FKS), Full-State Keyed Duplex (FKD) and Keyak, one of the third-round CAESAR candidates, in the classic setting and the quantum model, respectively.
Fanbao Liu, Fengmei Liu
openaire   +2 more sources

Fault Based Almost Universal Forgeries on CLOC and SILC

2016
\(\textsf {CLOC}\) and \(\textsf {SILC}\) are two blockcipher based authenticated encryption schemes, submitted to the CAESAR competition, that aim to use low area buffer and handle short input efficiently. The designers of the schemes claimed \(\frac{n}{2}\)-bit integrity security against nonce reusing adversaries, where n is the blockcipher state ...
Debapriya Basu Roy, Avik Chakraborti, Donghoon Chang, S. V. Dilip Kumar, Debdeep Mukhopadhyay, Mridul Nandi   +5 more
openaire   +1 more source

Susceptibility of digital signature schemes based on error-correcting codes to universal forgery

Proceedings of 1994 IEEE International Symposium on Information Theory, 1994
Xinmei's (1990) digital signature scheme and the scheme's modified version as proposed by Harn and Wang have been shown by the authors and others to be susceptible to several different attacks. The authors have since devised and presented a scheme that is impervious to the attacks that were successfully applied to the earlier schemes.
Mohssen Alabbadi, Stephen B. Wicker
openaire   +1 more source

Universal Forgery with Birthday Paradox: Application to Blockcipher-based Message Authentication Codes and Authenticated Encryptions. [PDF]

IACR Cryptol. ePrint Arch., 2017
An universal forgery attack means that for any given message $M$, an adversary without the key can forge the corresponding Message Authentication Code (MAC) tag $\tau$, and the pair $(M,\tau)$ can be verified with probability 1.
Fanbao Liu, Fengmei Liu
openaire   +2 more sources

Forgery at the University of Cambridge

2000
Abstract In 1564 the visit of Queen Elizabeth I to the University of Cambridge provoked a venomous and long-winded debate between the Cambridge physician and classicist John Caius, and his Oxford namesake, Thomas Caius. The object of each man was to assert that his own university was the most ancient, not only in England, but in the ...
openaire   +1 more source

On the Security of the COPA and Marble Authenticated Encryption Algorithms against (Almost) Universal Forgery Attack. [PDF]

IACR Cryptol. ePrint Arch., 2015
. COPA is a block-cipher-based authenticated encryption mode with a provable birthday-bound security under the assumption that the underlying block cipher is a strong pseudorandom permutation, and its instantiation with the AES block cipher is called AES-
Jiqiang Lu
openaire   +2 more sources

Almost Universal Forgery Attacks on the COPA and Marble Authenticated Encryption Algorithms

Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, 2017
The COPA authenticated encryption mode was proved to have a birthday-bound security on integrity, and its instantiation AES-COPA (v1/2) was claimed or conjectured to have a full security on tag guessing. The Marble (v1.0/1.1/1.2) authenticated encryption algorithm was claimed to have a full security on authenticity. Both AES-COPA (v1) and Marble (v1.0)
openaire   +1 more source

Signature Verification Based on a Global Classifier That Uses Universal Forgery Features

2011
Hand written signature verification algorithms are designed to distinguish between genuine signatures and forgeries. One of the central issues with such algorithms is the unavailability of skilled forgeries during the template creation. As a solution, we propose the idea of universal forgery features, where a global classifier is used to classify a ...
Joanna Putz-Leszczynska, Andrzej Pacut
openaire   +1 more source