Proxy Signature Research Articles

An optimal secure and reliable certificateless proxy signature for industrial internet of things

An optimal secure and reliable certificateless proxy signature for industrial internet of things

A multi-party verifiable quantum proxy signature scheme based on quantum teleportation

With the development of science and technology and the appearance of various special conditions that cause signers to be unable to sign, proxy signature is gradually becoming a hot spot in cryptography research. This paper combines proxy signature, quantum teleportation, and multi-party verification and proposes a multi-party verifiable quantum proxy signature scheme based on quantum teleportation. This scheme has the following characteristics: The authentication method based on the Hash function can effectively solve the problem of identity identification among members; in order for the proxy signer to be able to verify the correctness of the proxy authorization, a form of proxy signature authorization that concatenates the identity information of the original signer is used. The security analysis shows that our scheme is unforgeable and undeniable and can resist intercept-resend attacks and cheating attacks.

A structure-preserving linearly homomorphic signature scheme with designated combiner.

Linearly homomorphic signature (LHS) allows the acquisition of a new legal signature using the homomorphic operation of the original signatures. However, the public composability of LHS also prevents it from being used in some scenarios where the combiner needs to be designated. The LZZ22 scheme designates a combiner and preserves the signature structure by having the signer and the designated combiner share a secret. However, LZZ22 is not secure enough because the secret is constant. Here, we first prove that there is a polynomial time adversary that can crack the secret in LZZ22 through multiple signature queries. Then, we propose a new scheme, which realizes all the functions of LZZ22 and fixes the security problem by changing the secret with the message. The proposed scheme is shown to be secure against existential forgery on adaptively chosen subspace attacks under the random oracle model. Finally, we detail how to apply our scheme to the proxy signature and perform it on a personal computer, and the results show that our scheme is efficient.

Quantum Circuit-Based Proxy Blind Signatures: A Novel Approach and Experimental Evaluation on the IBM Quantum Cloud Platform

Abstract This paper presents a novel approach to proxy blind signatures in the realm of quantum circuits, aiming to enhance security while safeguarding sensitive information. The main objective of this research is to introduce a Quantum Proxy Blind Signature (QPBS) protocol that utilizes quantum logical gates and quantum measurement techniques. The QPBS protocol is constructed by initial phase, proximal blinding message phase, remote authorization and signature phase, remote validation and de-blinding phase. This innovative design ensures a secure mechanism for signing documents without revealing the content to the proxy signer, providing practical security authentication in a quantum environment under the assumption that the CNOT gates are securely implemented. Unlike existing approaches, our proposed QPBS protocol eliminates the need for quantum entanglement preparation, thus simplifying the implementation process. To assess the effectiveness and robustness of the QPBS protocol, we conduct comprehensive simulation studies in both ideal and noisy quantum environments on the IBM quantum cloud platform. The results demonstrate the superior performance of the QPBS algorithm, highlighting its resilience against repudiation and forgeability, key security concerns in the realm of proxy blind signatures. Furthermore, we have established authentic security thresholds (82.102%) in the presence of real noise, thereby emphasizing the practicality of our proposed solution.

Efficient and secure certificateless key-insulated proxy signature scheme

Efficient and secure certificateless key-insulated proxy signature scheme

Attribute-based proxy signature scheme with dynamic strong forward security

Attribute-based proxy signature scheme with dynamic strong forward security

Attribute-based proxy signature scheme with dynamic strong forward security

Attribute-based proxy signature scheme with dynamic strong forward security

An Electronic and Web-Based Authentication, Identification, and Logging Management System

The need for participants’ performance assessments in academia and industry has been a growing concern. It has attendance, among other metrics, is a key factor in engendering a holistic approach to decision-making. For institutions or organizations where managing people is an important yet challenging task, attendance tracking and management could be employed to improve this seemingly time-consuming process while keeping an accurate attendance record. The manual/quasi-analog approach of taking attendance in some institutions could be unreliable and inefficient, leading to inaccurate computation of attendance rates and data loss. This work, therefore, proposes a system that employs embedded technology and a biometric/ web-based application to enhance attendance management. The hardware encompasses the integration of an ESP8266 NodeMCU and the biometric AS608 fingerprint sensor interfaced with the database for which the front-end and back-end integration was through the React framework. The system uses a web application that displays the attendance results and scheduled course data from its database, provides feedback to lecturers on which student missed classes and calculates a student’s average attendance for the semester. By implementing this system, the accuracy of student attendance is expected to experience an appreciable improvement, eliminate proxy signing, provide a more secure alternative for attendance recording, curtail tardiness to classes, and ultimately improve student productivity on execution.

Attribute-Based Proxy Signature Scheme Supporting Flexible Threshold Predicate for UAV Networks

Unmanned aerial vehicle (UAV) is an attractive application because of its flexibility and economy. It may use a digital signature scheme to protect commands sent to UAVs. Moreover, the digital signature scheme should guarantee the real-time performance of UAVs executing commands and protect the signer’s privacy. Therefore, we proposed an attribute-based proxy signature (ABPS) scheme supporting flexible threshold predicate for UAV networks and proved its security. It has existential unforgeability under selective-predicate and chosen message attacks (EUF-sP-CMA) and can protect the signer’s privacy. We analyzed its computation costs based on experimental data and communication costs. The analysis results indicate that our ABPS scheme has less computation costs than other ABPS schemes and is at the same level as other ABPS schemes on communication costs.

Multilevel Subgranting by Power of Attorney and OAuth Authorization Server in Cyber–Physical Systems

Many Cyber-Physical Systems are today semiautonomous and powerful enough to perform advanced tasks on their own. This means they can also act as representatives of people or devices that have given them an order. However, traditional access control policies and delegation models do not meet industrial requirements such as support for letting autonomous CPS devices act on their own with certified credentials under the sub authorization by subcontractors, without the need for a separate account per device. In this paper, we analyze and compare power of attorney, proxy signature by warrant, and OAuth to identify the strengths and challenges of each. Based on the comparison, we propose an OAuth grant type based on the power of attorney and inspired by the concept of proxy signature by warrant. Power of Attorney is a generic and self-contained document that a principal signs and directs to an agent, thereby providing it the power to execute actions on behalf of the principal for a predefined time, even if it is offline. One key advantage of the power of attorney is that it can support effective sub-granting on several levels to support industrial scenarios where resource owners bring in authorized contractors that can in their turn authorize and bring in several devices without incurring management overhead to the resource owner. A proof-of-concept and performance evaluation of the proposed model is presented using an industrial use-case scenario with multi-level authorization.

Blockchain-Backed Searchable Proxy Signcryption for Cloud Personal Health Records

Patient-centered data management and sharing of personal health records (PHRs) are difficult to be realized as data is controlled by doctors/hospitals. In addition, security and privacy, oppressive costs, search and tracing unreliability, and complicated access authorization caused by traditional encryption severely hinder the widespread adoption of PHRs. To overcome these challenges, we propose a blockchain-backed data sharing framework for PHRs, where the blockchain achieves reliable search and tracing. Furthermore, we design a hybrid <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b</b> lock <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</b> hain-backed <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</b> earchable <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</b> roxy <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</b> ign <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</b> ryption scheme, named <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">BC-SPSC</b> . Specifically, an identity-based proxy signature (IBPS) is utilized to perform the authorization from patients to doctors to achieve authentic patient-centricity, therefore the blockchain can relate data with associated patients and doctors during data tracing. Moreover, BC-SPSC supports two search modes. The first mode adopts attribute-based encryption with keyword-based search (SABE), where all legitimate users can implement searches, but only users whose attributes satisfy the access structure can successfully decrypt. By contrast, the second mode utilizes attribute-based searchable encryption (ABSE) to accomplish fine-grained authorization in both search and data access/decryption, that is, who can search is also constrained by data owners. Adequate performance comparisons and simulation experiments indicate significant advantages of the BC-SPSC scheme in storage and computation overheads.

Retracted: Identity-Based Designated-Verifier Proxy Signature Scheme with Information Recovery in Telemedicine System

Retracted: Identity-Based Designated-Verifier Proxy Signature Scheme with Information Recovery in Telemedicine System

Security weakness of a certificate-based proxy signature scheme for IIoT environments

Recently, Zhu et al. analyzed a certificate-based proxy signature scheme proposed by Verma et al. and provided a revised scheme [9]. In this paper, we revisit Zhu et al.'s attack and show that the fundamental problem of the Verma et al.'s scheme is that it uses a weak ordinary signature scheme as a building block. In addition, based on the fact that the revised scheme shares many of the components which use the weak signature in the Verma et al.'s scheme, we show that the attack against the Verma et al.'s scheme can be similarly applied to the revised scheme.

Anonymous Proxy signature scheme based on multivariate polynomials over finite field

Proxy signature schemes can be used in all the scenarios where a signer is not able to sign an important message. In some cases which involve a group of proxy signers, the anonymity of the proxy signer is required. We propose the first multivariate anonymous proxy signature scheme over finite field, and discuss all its security properties such as anonymity, unforgeability, verifiability, distinguishability, and undeniability. Additionally, we give a toy example to demonstrate the mathematical functioning of the proposed scheme. We compare our scheme with the existing post-quantum anonymous proxy signature scheme.

Proxy Archives Based on Marine Calcifying Organisms and the Role of Process-Based Biomineralization Concepts

Proxy archives based on marine calcifying organisms and their element and isotope signatures represent valuable tools in the reconstruction of past climates. Despite the fact that the underlying biomineralization processes behind the measured signatures are poorly understood, these tools work remarkably well. However, even though they work well many researchers felt the need to decipher the “black box” and understand the processes leading to the measured signatures. In this paper we assess how far we have come in understanding the biomineralization processes underpinning proxy signatures derived from marine calcifying organisms and how this understanding improved the way we use these proxy archives today. Biomineralization in the context of proxy research is an interdisciplinary field and cross-discipline communication can be challenging due to a lack of background in foreign disciplines. This often leads to misunderstanding and over- (or under-) estimation of certain concepts/methods/data. We, therefore, present a concise introduction to the topic, clarifying key concepts and their applicability to proxy interpretation.

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.

Identity-Based Proxy Signature with Message Recovery over NTRU Lattice

Proxy signature is one of the important primitives of public-key cryptography and plays an essential role in delivering security services in modern communications. However, existing post quantum proxy signature schemes with larger signature sizes might not be fully practical for some resource-constrained devices (e.g., Internet of Things devices). A signature scheme with message recovery has the characteristic that part or all of the message is embedded in the signature, which can reduce the size of the signature. In this paper, we present a new identity-based proxy signature scheme over an NTRU lattice with message recovery (IB-PSSMR), which is more efficient than the other existing identity-based proxy signature schemes in terms of the size of the signature and the cost of energy. We prove that our scheme is secure under a Short Integer Solution (SIS) assumption that is as hard as approximating several worst-case lattice problems in the random oracle model. We also discussed some application scenarios of IB-PSSMR in blockchain and Internet of Things (IOT). This paper provides a new idea for the design of lattice signature schemes in low resource constrained environments.

A pilot study of upper Yangtze shallow-water carbonates of the Paibian global marine euxinia: Implications for the late Cambrian SPICE event

The SPICE (Steptoean Positive Carbon Isotope Excursion) is a significant event in the Late Cambrian, recording global carbon cycle perturbations. Its driving mechanism is still controversial, but mainly believed to be related to an increase of organic carbon burial caused by ocean anoxia. The shallow-water platform carbonates of the Upper Cambrian Loushanguan Formation of Yankong outcrop (Upper Yangtze) spans the event interval. Their primary geochemical proxy signatures (trace elements, carbon and strontium isotopes), have been utilized to better understand the driving mechanism of the SPICE event. The variations of paleoenvironmental proxies in the upper Loushanguan Formation exhibit a rapid transformation of redox conditions similar to those of deep-water regions, thus reflecting an expansion of anoxic seawater to shallow-water column. The increase of 87Sr/86Sr, Al, and ∑REE during the SPICE suggests an enhancement in nutrient inputs from continental weathering that might have promoted primary productivity, which preferentially consumed light 12CO2 of surface waters, resulting in 13C-enriched DIC. The occurrence of PGMEE (Paibian global marine euxinia event), immediately before the enhancement of continental weathering, suggests that it was the onset-driving mechanism of the SPICE event and the increase in continental weathering might have promoted primary productivity to further intensify carbon burial and play a superimposed effect on that of the SPICE event.

Delegating signing rights in a multivariate proxy signature scheme

In the context of digital signatures, the proxy signature holds a significant role of enabling an original signer to delegate its signing ability to another party (i.e., proxy signer). It has significant practical applications. Particularly it is useful in distributed systems, where delegation of authentication rights is quite common. For example, key sharing protocol, grid computing, and mobile communications. Currently, a large portion of existing proxy signature schemes are based on the hardness of problems like integer factoring, discrete logarithms, and/or elliptic curve discrete logarithms. However, with the rising of quantum computers, the problem of prime factorization and discrete logarithm will be solvable in polynomial-time, due to Shor's algorithm, which dilutes the security features of existing ElGamal, RSA, ECC, and the proxy signature schemes based on these problems. As a consequence, construction of secure and efficient post-quantum proxy signature becomes necessary. In this work, we develop a post-quantum proxy signature scheme Mult-proxy, relying on multivariate public key cryptography (MPKC), which is one of the most promising candidates of post-quantum cryptography. We employ a 5-pass identification protocol to design our proxy signature scheme. Our work attains the usual proxy criterion and a one-more-unforgeability criterion under the hardness of the Multivariate Quadratic polynomial (MQ) problem. It produces optimal size proxy signatures and optimal size proxy shares in the field of MPKC.

A Linear Homomorphic Proxy Signature Scheme Based on Blockchain for Internet of Things

The mushroom growth of IoT has been accompanied by the generation of massive amounts of data. Subject to the limited storage and computing capabilities of most IoT devices, a growing number of institutions and organizations outsource their data computing tasks to cloud servers to obtain efficient and accurate computation while avoiding the cost of local data computing. One of the most important challenges facing outsourcing computing is how to ensure the correctness of computation results. Linearly homomorphic proxy signature (LHPS) is a desirable solution to ensure the reliability of outsourcing computing in the case of authorized signing right. Blockchain has the characteristics of tamper-proof and traceability, and is a new technology to solve data security. However, as far as we know, constructions of LHPS have been few and far between. In addition, the existing LHPS scheme does not focus on homomorphic unforgeability and does not use blockchain technology. Herein, we improve the security model of the LHPS scheme, and the usual existential forgery and homomorphic existential forgery of two types of adversaries are considered. Under the new model, we present a blockchain-based LHPS scheme. The security analysis shows that under the adaptive chosen message attack, the unforgeability of the proposed scheme can be reduced to the CDH hard assumption, while achieving the usual and homomorphic existential unforgeability. Moreover, compared with the previous LHPS scheme, the performance analysis shows that our scheme has the same key size and comparable computational overhead, but has higher security.