Undeniable Property Research Articles

Provable Secure Attribute-Based Proxy Signature Over Lattice Small Integer Solution Problem in Random Oracle Model

Current proxy signature schemes are mostly identity-based proxy signatures that distinguish users by identity. This signature method faces some problems, such as identity information leakage and single access control. Attribute-based proxy signature (ABPS) divides the signer’s identity information into a collection of attributes; thus, users’ identity information can be protected and access control can become fine-grained. With the development of quantum computers, the security of signature schemes based on traditional number theory problems is under threat. Therefore, we construct a new attribute-based proxy signature scheme on a lattice that can resist quantum attacks. This scheme has the properties of both attribute-based signatures and proxy signatures, i.e., fine-grained access control and strong undeniability properties. Moreover, based on the small integer solution problem (SIS), our scheme is provably secure in the random oracle model and protects the proxy signer in the adaptive security model.

A New Approach to Keep the Privacy Information of the Signer in a Digital Signature Scheme

In modern applications, such as Electronic Voting, e-Health, e-Cash, there is a need that the validity of a signature should be verified by only one responsible person. This is opposite to the traditional digital signature scheme where anybody can verify a signature. There have been several solutions for this problem, the first one is we combine a signature scheme with an encryption scheme; the second one is to use the group signature; and the last one is to use the strong designated verifier signature scheme with the undeniable property. In this paper, we extend the traditional digital signature scheme to propose a new solution for the aforementioned problem. Our extension is in the sense that only a designated verifier (responsible person) can verify a signer’s signature, and if necessary (in case the signer refuses to admit his/her signature) the designated verifier without revealing his/her secret key is able to prove to anybody that the signer has actually generated the signature. The comparison between our proposed solution and the three existing solutions shows that our proposed solution is the best one in terms of both security and efficiency.

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

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. These characteristics make it very useful in outsourcing computing, electronic voting, electronic bidding, electronic auction and other fields. However, most strong designated verifier signature schemes are unable to identify the real signature generator when the signer and the designated verifier dispute a signature. In addition, the existing strong designated verifier signature schemes in the standard model rarely satisfy strong unforgeability, and thus cannot prevent the attacker from forging a valid signature on any previously signed message. Therefore, designing a strong designated verifier signature scheme without random oracles that satisfies strong unforgeability and undeniability is very attractive in both practice and theory. Motivated by these concerns, we design the first undeniable strong designated verifier signature scheme without random oracles, in which the arbiter can independently perform the judgment procedure to prove whether a controversial signature is generated by the signer or the designated verifier. Under standard assumptions, the scheme is proved to be strongly unforgeable in standard model. Furthermore, it not only achieves non-transferability and privacy of the signer’s identity but also satisfies the undeniable property of traditional digital signature schemes. Performance analysis results show that the length of the signer’s private key, the designated verifier’s private key and signature length are 40 bits, 40 bits and 384 bits, respectively. Compared with he related schemes, the proposed scheme has higher performance in signature length, private key size and computational overhead. Finally, we show how to apply it to implement outsourcing computation in cloud computing.

Arbitrated Quantum Signature of Quantum Messages with a Semi-honest Arbitrator

A new arbitrated quantum signature of quantum messages with a semi-honest arbitrator is designed by utilizing the chained control-NOT(CNOT) operations encryption and the classical public board. Detailed theoretical analysis show that the proposed scheme satisfies the requirements of unforgeable and undeniable properties. The novelty is that the feasibility of signing quantum messages under the control of a semi-honest arbitrator is demonstrated. And with the help of the decoy technique, shared keys can be reused.

Sachs-Wolfe Effect Disproof – The Fundamental Flaw in the Spectral Analysis of Gravity Wells

The Sachs-Wolfe Effect, a popular wavelength modifying hypothesis involving galaxy clusters and cosmic voids, is based on the belief that a propagating photon gains energy (is blueshifted) during its descent into a gravity well and loses energy (is redshifted) during the ascent as it escapes from the gravity well. A straightforward proof exposes the underlying flaw ---a flaw that extends to the spectral analysis of gravity wells, and hills, in general. The argument is based on three undeniable properties; no reputable physicist refutes these. (1) The photon is not a point-like particle; the particle of light is an extended entity. (2) The three dimensional space of the Universe is not a region of nothingness. (3) Gravity’s influence on photons involves altering the propagation direction and changes to the wavelength. Remarkable agreement with observational evidence is presented. The logic of the arguments and the supporting evidence lead to truly profound implications for cosmology: The expanding-universe hypothesis is untenable. It turns out, we live in a Dynamic Steady State Universe.

Strong Designated Verifier Signature Schemes with Undeniable Property and Their Applications

Most of the strong designated verifier signature (SDVS) schemes cannot tell the real signature generator when the signer and the designated verifier dispute on a signature. In other words, most of the SDVS schemes do not have the undeniability property. In this paper, we propose two SDVS schemes which hold the undeniability property, namely, strong designated verifier signature with undeniability property (SDVSUP). Our two schemes are called SDVSUP-1 and SDVSUP-2. In our two SDVSUP schemes, the signer not only can designate a verifier but also can designate an arbiter who can judge the signature when the signer and the designated verifier dispute on the signature. What is more, the judgment procedure can be performed by the arbiter alone without help from the signer or the designated verifier, which increases the judgment efficiency and reduces the complexity of signature confirmation. We also demonstrate a real instance of applying our SDVSUP scheme to electronic bidding system.

부인봉쇄 성질을 갖는 바이오메트릭 서명 위임 기법

Abstract In a biometric signature scheme, a user’s biometric key is used to sign the document. It also requires the user be authenticated with biometric recognition method, prior to signing the document. Because the biometric recognition is launched every time the signature session started, it is not suitable for electronic commerce applications such as shopping malls where large number of documents to sign are required. Therefore, to commercialize biometric based signature schemes, the new proxy signature scheme is needed to ease the burden of the signer. In the proxy signature scheme, the signer can delegate signing activities to trustful third parties. In this study, the biometric based signature delegation method is proposed. The proposed scheme is suitable for applications where a lot of signing are required. It is consisted of biometric key generation, PKI based mutual authentication, signature generation and verification protocols. Key Words : Biometric Signature, Proxy Signature, PKI, Undeniable Property, Large Scale Authentication

On provably secure code-based multiple grade proxy signature scheme

In multiple grade proxy signatures, the signing right can be delegated from one grade to the next grade. In this paper, we first introduce a code-based multiple grade proxy signatures based on Stern's identification scheme. The proposed scheme is the first code-based multiple grade proxy signature. Our scheme is secure on the syndrome decoding problem and satisfies verifiability, unforgeability, undeniability, non-transferability and distinguishability properties, which are the security requirements for a multiple grade proxy signature.

Security Analyses and Improvement of Arbitrated Quantum Signature with an Untrusted Arbitrator

Very recently, an arbitrated quantum signature (AQS) scheme of classical message with an untrusted arbitrator was presented (Yang et al. in Eur. Phys. J., D, At. Mol. Opt. Plasma Phys. 61(3):773–778, 2011). In this paper, the security of the AQS scheme with an untrusted arbitrator is analyzed. An AQS scheme with an untrusted arbitrator should satisfy the unforgeable property and undeniable property. In particular, the malicious verifier can not modify a message and its signature to produce a new message with a valid signature, and the dishonest signer who really has sent the message to the verifier which the verifier accepted as an authentic one cannot later deny having sent this message. However, we show that, in the AQS scheme with an untrusted arbitrator, the dishonest signer can successfully disavow his/her signature and the malicious verifier can counterfeit a valued signature for any message by known message attack when he has received a message-signature pair. Then, we suggest an improved AQS scheme of classical message with an untrusted arbitrator which can solve effectively the two problems raised above. Furthermore, we prove the security of the improved scheme.

A new proxy signature scheme with a semi-trusted third party based on elliptic curve discrete logarithm problem

The design of new elliptic curve cryptosystem is still an interest to community of cryptography. In this paper, a proxy signature scheme with a semi-trusted third party based on Elliptic Curve Discrete Logarithm Problem ECDLP has been proposed. Authorisation mechanism is introduced to prevent the online original signer in this scheme. The semi-trusted third party's secret value in the proxy signature makes the scheme more secure. The scheme needs shorter time to generate proxy signature since it is based on ECDLP. We show that our proxy signature scheme with a semi-trusted third party satisfies the unforgeability, undeniability and misuse properties. Compared with the Liu et al. 's scheme, our scheme has the advantages of high security strength and short key length. To the best of my knowledge, it is the shortest proxy signature scheme with a semi-trusted third party.

A New Proxy-Protected Signature Scheme Based on DLP

During electronic communication, proxy signature helps the signer to sign message on behalf of the original signer. This type of signature scheme is used when the signatory is not available to sign this document. In this paper, we propose a new protected proxy signature scheme. In the proposed scheme, the proxy signer can sign message on behalf of the original signer with the different type of public key. The proposed scheme satis es unforgeability, undeniability, non-transferability and distinguishability properties which are the most important security requirements for a proxy signature. DOI: http://dx.doi.org/10.11591/ij-ict.v1i2.1479

The Mobile ID based Digital Signature Scheme Suitable for Mobile Contents Distribution

The wide use of mobile devices such as smart phones makes the mobile commerce industry be growing-up rapidly. In mobile commerce security, how to secure a copyright of mobile contents and how to distribute it are of major concerns. The user can carry the smart phone regardless of the places. Thus the utilization of it is very high than that of personal computers. The USIM(Universal Subscriber Information Module) inserted in the smart phone binds the user with the device. This means that the smart phone can be used to represent the owner's identity. In this paper, we develop the mobile ID based digital signature scheme. We create the mobile ID by combining USIM with the user's random secret value. In addition, undeniable property of our signature scheme can make ID based applications such as mobile voting and mobile content distribution be possible with the smart phone.

Modeling and monitoring of E-commerce workflows

Electronic commerce (E-commerce) is an important Internet application that is significantly changing the way of commercial transaction. Due to the complexity of E-commerce systems and lack of well-designed formal models, providing a suitable method for their modeling and monitoring turns out to be a challenging job. This paper introduces labeled workflow nets (LWN) and their semantics on the basis of labeled Petri nets. Then an inter-organizational labeled workflow net (ILWN) - which can graphically model the dynamic behavior of the systems - is presented. Furthermore, the nonblocking property of ILWNs is defined to achieve a common goal of E-commerce participants. This nonblocking property helps to analyze the soundness of ILWNs and the undeniable property of interactive actions. The proposed framework for E-commerce workflows (ECW) can record a history of interactive events and monitor the execution of interactive activities to achieve a common goal. Therefore, it can elegantly model the execution of interorganizational workflows and analyze the accountability of cooperative activities. The main contribution of the paper is to present a new formal mechanism - ILWN. It can efficiently support the modeling and monitoring of ECWs. Finally, this paper illustrates how to use the proposed method by modeling and analyzing a Customer-Producer-Supplier example.

Autoradiographic study of 14C-sulpiride in monkey.

Substituted benzamides have been the object of numerous metabolic studies including many by whole body autoradiography of rats and mice. The present study reports autoradiographic data concerning 14C-labelled Sulpiride in monkey. The Study was limited to the brain in order to elucidate the controversial question as to whether the drug can cross the blood-brain barrier. The results showed that in monkey, as in rat and mouse, there is no localization in the brain as can be clearly seen on the autoradiograms. In view of these results and of the undeniable neuroleptic properties of Sulpiride, an indirect mode of action through the release of endogenous mediators is proposed.