In a verifiably encrypted signature scheme, signers encrypt their signature under the public key of a trusted third party and prove that they did so correctly. The security properties, due to Boneh et al. (Eurocrypt 2003), are unforgeability and opacity. This paper proposes two novel fundamental requirements for verifiably encrypted signatures, called extractability and abuse-freeness, and anal...

We propose a new authentication scheme of binding update protocol, which its Correspondent Node (CN) issues a ticket to Mobile Node (MN) when MN first executes the Binding Update (BU). This ticket assist that it is able to do efficiently the BU whenever MN requires the BU for the future. The proposed protocol need not be repeated equal BU course whenever the MN moves to foreign link or network,...

Allowing a proxy signer to generate a signature on behalf of an original signer, a proxy signature should satisfy the property of strong unforgeability: anyone except the designated proxy signer cannot create a valid proxy signature on behalf of the original signer. Since proxy signatures, as well as their derivatives, can be used in many applications in reality, such as secure mobile agent, e-...

In this paper we consider the problem of securely instantiating Probabilistic Signature Scheme (PSS) in the standard model. PSS, proposed by Bellare and Rogaway [3] is a widely deployed randomized signature scheme, provably secure (unforgeable under adaptively chosen message attacks) in Random Oracle Model. Our main result is a black-box impossibility result showing that one can not prove unfor...

Sanitizable signature schemes, as defined by Ateniese et al. (ESORICS 2005), allow a signer to partly delegate signing rights to another party, called the sanitizer. That is, the sanitizer is able to modify a predetermined part of the original message such that the integrity and authenticity of the unchanged part is still verifiable. Ateniese et al. identify five security requirements for such ...

Recently, Herranz presented an identity-based ring signature scheme featuring signer verifiability where a signer can prove that he or she is the real signer by releasing an authorship proof. In this paper we show that this scheme is vulnerable to a key recovery attack in which a user’s secret signing key can be efficiently recovered through the use of two known ring signatures and their corres...

Overbooking is a strategy of extra ticket reservation, which needs precise models concerning the probability of ticket acquisition. Without such models a company will have losses related to unused seats or compensation for the absence of these seats. In the paper we consider several models for such a forecast and demonstrate their functionality on real data of one Peruvian railway company. The ...

In this paper, we reinvestigate the security analysis of blind signature scheme over braid groups proposed by Verma in 2008. A blind signature scheme is a cryptographic primitive used for e-commerce for getting a signature from the signer without revealing any information about its contents. These schemes are especially used in e-transactions, e-votings, DRM systems, etc. The security of blind ...

Seat belt use is an important factor in the prevention of automobile accidents involving injuries and fatalities. The current study used a multielement design to compare the "Click It or Ticket" and "Please Buckle Up--I Care" procedures. Results indicate that the Click It or Ticket prompt resulted in a 20-percentage-point increase in seat belt use, and Please Buckle Up-I Care resulted in a 14-p...