With the ongoing popularization of online services, digital document images have been used in various applications. Meanwhile, there emerged some deep learning-based text editing algorithms which alter textual information an image . In this work, we present a forgery algorithm to edit practical images. To achieve goal, limitations existing towards complicated characters and complex background a...

Radio Frequency IDentification (RFID) technology is a wireless identification method in which security and privacy are important parameters for public acceptance and widespread use. In order to thwart such security and privacy problems, a wide variety of authentication protocols have been proposed in the literature. In 2010, Yeh et al’s proposed a new RFID authentication protocol conforming to ...

As a feasible model for signing quantum messages, some cryptanalysis and improvement of arbitrated quantum signature (AQS) have received a great deal of attentions in recent years. However, in this paper we find the previous improvement is not suitable implemented in some typical AQS protocols in the sense that the receiver, Bob, can forge a valid signature under known message attack. We descri...

Website Forgery is a type of web based attack where the phisher builds a website that is completely independent or a replica of a legitimate website, with the goal of deceiving a user by extracting information that could be used to defraud or launch other attacks upon the victim. In this paper we attempt to identify the different types of website forgery phishing attacks and non-technical count...

In 2013, Thadvai et al. proposed a novel authenticated encryption scheme with convertibility. They claimed that the proposed scheme satisfies all the properties of an ideal authenticated encryption scheme (AES). However, this paper shows that Thadvai et al.’s AES scheme still suffers from a forgery converted signature attack, that is, any one Corresponding author: Ki-Dong Bu ([email protected]) 27...

We present a practical selective forgery attack against RSA signatures with fixed-pattern padding shorter than two thirds of the modulus length. Our result extends the practical existential forgery of such RSA signatures that was presented at Crypto 2001. For an n-bit modulus the heuristic asymptotic runtime of our forgery is comparable to the time required to factor a modulus of only 9 64n bit...

Recently, there are several articles proposed based on Yang and Shieh’s password authentication schemes (YS for short) with the following features: (1) A user can choose password freely. (2) The server does not need to maintain a password table. (3) There is no need to involve a trusted third party. Although there were several variants of the YS-like schemes claimed to address the forgery attac...

In this paper we study authenticated encryption algorithms inspired by the OCB mode (Offset Codebook). These algorithms use secret offsets (masks derived from a whitening key) to turn a block cipher into a tweakable block cipher, following the XE or XEX construction. OCB has a security proof up to 2 queries, and a matching forgery attack was described by Ferguson, where the main step of the att...

To provide secure authentication for wireless sensor networks (WSNs), recently Jiang et al. proposed an efficient two-factor user authentication scheme with unlinkability. They argued that the scheme provides resilience of privileged insider attack, stolen-verifier attack, password guessing attack, weak stolen smart card attack, replay attack, forgery attack, identity guessing attack and tracki...