Valid Signature Research Articles

Identification and Validation of Immune-Related Gene Prognostic Signature for Hepatocellular Carcinoma.

Immune-related genes (IRGs) have been identified as critical drivers of the initiation and progression of hepatocellular carcinoma (HCC). This study is aimed at constructing an IRG signature for HCC and validating its prognostic value in clinical application. The prognostic signature was developed by integrating multiple IRG expression data sets from TCGA and GEO databases. The IRGs were then combined with clinical features to validate the robustness of the prognostic signature through bioinformatics tools. A total of 1039 IRGs were identified in the 657 HCC samples. Subsequently, the IRGs were subjected to univariate Cox regression and LASSO Cox regression analyses in the training set to construct an IRG signature comprising nine immune-related gene pairs (IRGPs). Functional analyses revealed that the nine IRGPs were associated with tumor immune mechanisms, including cell proliferation, cell-mediated immunity, and tumorigenesis signal pathway. Concerning the overall survival rate, the IRGPs distinctly grouped the HCC samples into the high- and low-risk groups. Also, we found that the risk score based on nine IRGPs was related to clinical and pathologic factors and remained a valid independent prognostic signature after adjusting for tumor TNM, grade, and grade in multivariate Cox regression analyses. The prognostic value of the nine IRGPs was further validated by forest and nomogram plots, which revealed that it was superior to the tumor TNM, grade, and stage. Our findings suggest that the nine-IRGP signature can be effective in determining the disease outcomes of HCC patients.

Group Signatures with Time-Bound Keys Revisited: A New Model, an Efficient Construction, and its Implementation

Chu et al. (ASIACCS 2012) proposed group signature with time-bound keys (GS-TBK), where each signing key is associated with expiry time $\tau$ τ . In addition, to prove membership of the group, a signer needs to prove that the expiry time has not passed, i.e., $t t τ , where $t$ t is the current time. A signer whose expiry time has passed is automatically revoked, and this revocation is called natural revocation. Signers can be revoked simultaneously before their expiry times if the credential is compromised. This revocation is called premature revocation. A nice property in the Chu et al. proposal is that the size of revocation lists can be reduced compared to those of Verifier-Local Revocation (VLR) group signature schemes by assuming that natural revocation accounts for most of the signer revocations in practice, and prematurely revoked signers are only a small fraction. In this paper, we point out that the definition of traceability of Chu et al. did not capture the unforgeability of expiry time for signing keys, which guarantees that no adversary who has a signing key associated with expiry time $\tau$ τ can compute a valid signature after $\tau$ τ has passed. This situation significantly reduces the dependability of the system since legitimate signing keys may be used for providing a forged signature. We introduce a security model that captures unforgeability, and propose a secure GS-TBK scheme in the new model. Our scheme also provides constant signing costs, whereas those of the previous schemes depended on the bit-length of the time representation. Finally, we provide the implementation results. We employ Barreto-Lynn-Scott (BLS) curves with 455-bit prime order and the RELIC library, and demonstrate that our scheme is feasible in practical settings.

Comments on “Provably Secure Generalized Signcryption Scheme With Public Verifiability for Secure Data Transmission Between Resource-Constrained IoT Devices”

Very recently, Karati et al. presented a new generalized CLSC (gCLSC) to provide the functions of digital signature and encryption to fulfill the authenticity and confidentiality for the resource-constrained Internet-of-Things (IoT) devices. Karati et al. claimed that the newly proposed gCLSC supports the property of public verifiability and security of an ideal signcryption under the strong Diffie–Hellman and bilinear Diffie–Hellman inversion problems without the random oracle model. Unfortunately, their scheme is insecure with respect to unforgeability. It is demonstrated that any receiver or nonprivileged user can generate a valid signature or signcrypted ciphertext on any message. Finally, this article also points out the flaw in their unforgeability proof and gives some suggestions on the construction of a concrete scheme.

Legal Satisfaction of Electronic Authentic Diction Made Notary in Facing Industrial Revolution 4.0

Notary has the authority to make an Authentic Deed based on article 1867 of the Civil Code. Proof of evidence in writing is done by authentic writing or writing under the hand. Along with advances in technology, each transaction using electronic information technology makes it easy for parties to make agreements through online. However in reality the Authentic Deed made by a Notary Public must be adjusted to Law Number 30 of 2004 amending the Law Number 2 of 2014 about the position of Notary Public. The formulation of the problem in this research is How Positive Law about the Certainty of Authentic Deed Law conducted by a Notary by using Electronics and how the obstacles to the agreement by using the Electronic Deed conducted by a Notary. The writing method in this paper uses notative juridical and the nature of the research is perspective. Research results in writing are the legal certainty of an authentic deed made by a notary that there is no positive law relating to an authentic deed done online and authentic deeds made online are that the parties must face directly, good faith and the validity of electronic signatures whose authenticity is uncertain. Recomendation that policies on authentic deeds need to be made electronically.

Quantum (t, n) threshold group signature based on Bell state

Quantum group signature is an important branch of quantum signature. Most of the existing quantum group signature schemes require that all the signatories must be present to generate a valid signature, and this property may limit their application in practice. In this paper, we will propose a quantum (t, n) threshold group signature scheme. In our scheme, n signatories compose a group, and any t out of these n signatories can generate a valid signature on behalf of the group. The t signatories use the quantum-controlled-not operations to expand the quantum message into t-particle entangled states, and then use the entanglement swapping to transmit the quantum message to the receiver. The receiver performs the single-particle measurements and unitary operations to recover the initial quantum message, and then verifies the signature with the help of the arbitrator. Compared to the existing quantum group signature schemes, our (t, n) threshold scheme will be more flexible in practice.

Zero-pole cancellation for identity-based aggregators: a constant-size designated verifier-set signature

In this paper we present a designated verifier-set signature (DVSS), in which the signer allows to designate many verifiers rather than one verifier, and each designated verifier can verify the validity of signature by himself. Our research starts from identity-based aggregator (IBA) that compresses a designated set of verifier’s identities to a constant-size random string in cryptographic space. The IBA is constructed by mapping the hash of verifier’s identity into zero or pole of a target curve, and extracting one curve’s point as the result of aggregation according to a specific secret. Considering the different types of target curves, these two IBAs are called as zeros-based aggregator and poles-based aggregator, respectively. Based on them, we propose a practical DVSS scheme constructed from the zero-pole cancellation method which can eliminate the same elements between zeros-based aggregator and poles-based aggregator. Due to this design, our DVSS scheme has some distinct advantages: (1) the signature supporting arbitrary dynamic verifiers extracted from a large number of users; and (2) the signature with short and constant length. We rigorously prove that our DVSS scheme satisfies the security properties: correctness, consistency, unforgeability and exclusivity.

A New Constant-Size Group Signature Scheme From Lattices

A lattice-based group signature scheme (LGSS) is an active cryptographic primitive, where each group member can sign messages anonymously in the name of the entire group and each valid signature should be traced to some group member on the lattice. In each LGSS, the size of the group signature usually depends on the number of group members and the security parameter. Thus, designing a constant-size LGSS is an interesting problem. At PKC 2018, Ling, Nguyen, Wang and Xu presented the first constant-size group signature scheme under lattice assumptions. Its design is based on a zero-knowledge argument of the knowledge of a valid message-signature pair for the Ducas-Micciancio signature scheme, which follows the sign-then-encrypt-then-prove protocol. In contrast to this work, we construct a new constant-size LGSS. The scheme adopts the sign-hybrid-encrypt approach and makes use of the Lyubashevsky signature scheme. Our work is efficient in the signing algorithm, more precise on the open algorithm and shorter in public key, secret key and signature size than previous studies. Furthermore, we prove that the scheme has full anonymity and full traceability under the Ring Learning With Errors and Ring Short Integer Solution assumptions in the random oracle model.

Arrhythmic Gut Microbiome Signatures for Risk Profiling of Type-2 Diabetes

Lifestyle, obesity and the gut microbiome are among the most important risk factors for the development of metabolic disorders. We demonstrate in 1,976 subjects of a prospective population cohort (KORA) that specific gut microbiota members show 24-hour oscillations in their relative abundance and identified 13 taxa with disrupted rhythmicity in T2D. Cross-validated prediction models based on this signature classified T2D with an AUC of 73%. BMI as independent factor improved classification of T2D. The validity of this arrhythmic signature was confirmed in 699 KORA subjects five years after initial sampling, being most effective in combination with BMI and microbiota (AUC=78%). Shotgun metagenomic analysis functionally linked 26 metabolic pathways to the diurnal oscillation of gut bacteria. In summary, we determined a cohort-specific risk pattern of arrhythmic taxa which significantly contributes to the classification and prediction of T2D, suggesting a functional link between circadian rhythmicity and the gut microbiome in metabolic diseases.

Privacy-Protected Deletable Blockchain

A deletable blockchain has been proposed recently to change the immutability of the traditional blockchain. However, the users' identities and transaction contents are all public in the scheme, and the public data may reveal the users' privacy. In order to protect the privacy of the users, we propose a privacy-protected deletable blockchain based on the proof-of-space consensus mechanism, which does not rely on complex cryptographic tools or any trusted party. In order to satisfy full transparency and accountability in an anonymous environment, we use a traceable ring signature or a Pedersen commitment scheme to disclose the users' real identities or the real transaction contents respectively according to different deletion reasons. During the deletion process, we propose a linkable multi-signature scheme, which allows multiple users to generate a valid signature by using their one-time addresses as pseudonyms to protect their identity privacy. Moreover, the proposed multi-signature scheme can link two sub-signatures if they are generated by the same malicious user. Finally, we simulate the generation and deletion process of a block under the proof-of-space consensus mechanism and give the time of generating and deleting a block. The experimental results prove the efficiency and feasibility of our proposed scheme.

A Group Signature and Authentication Scheme for Blockchain-Based Mobile-Edge Computing

Blockchain-based mobile-edge computing (BMEC) is an innovative architecture, which is essential in the future fifth-generation (5G) network era. BMEC solves the problem of limited computing resources of devices in the mobile blockchain environment while ensuring the distributed deployment of computing resources and the traceable of transaction data. However, the blockchain technology has many security vulnerabilities, among which attacks against consensus algorithms are particularly serious, i.e., double-spend attacks, long-range attacks, and selfish mining. All of these attacks can break the integrity of BMEC, allowing the correct block record to be overwritten with a false one. In this article, we propose a group signature scheme designed for validating blocks of blockchain to address such issues. Each new block will be regarded as a valid block if it obtains a valid group aggregate signature of the group which the block creator belongs to. We describe in detail the process of authentication and key changes when mobile devices join and leave BMEC. We also provide a more efficient authentication scheme of authenticating mobile devices compared to traditional schemes in BMEC. Last, the security analysis is presented to prove that our proposed group signature scheme is effective.

A provable-secure and practical two-party distributed signing protocol for SM2 signature algorithm

Mobile devices are widely used for data access, communications and storage. However, storing a private key for signature and other cryptographic usage on a single mobile device can be challenging, due to its computational limitations. Thus, a number of (t, n) threshold secret sharing schemes designed to minimize private key from leakage have been proposed in the literature. However, existing schemes generally suffer from key reconstruction attack. In this paper, we propose an efficient and secure two-party distributed signing protocol for the SM2 signature algorithm. The latter has been mandated by the Chinese government for all electronic commerce applications. The proposed protocol separates the private key to storage on two devices and can generate a valid signature without the need to reconstruct the entire private key. We prove that our protocol is secure under nonstandard assumption. Then, we implement our protocol using MIRACL Cryptographic SDK to demonstrate that the protocol can be deployed in practice to prevent key disclosure.

Case translation: Italy

Tribunale sez. V, Milano, 18/10/2016, n. 11402, Court of Milan, V Civil, 18 October 2016
 Italy; evidence of contract; e-mails; validity of electronic signature; payment of invoices; Code of the Digital Administration decree 82/2005; Regulation (EU) No 910/2014 of the European Parliament and of the Council of 23 July 2014 on electronic identification and trust services for electronic transactions in the internal market and repealing Directive 1999/93/EC OJ L 257, 28.8.2014, p. 73–114

Long-term verification of signatures based on a blockchain

Digitally signed documents must remain stored for many years. In this paper, a scheme that would allow maintaining signature validity without the necessity to use timestamps from trusted third parties is proposed. According to the scheme, after inserting data into a blockchain, a user can store a signed document in his storage without the need to perform any maintenance actions in the future. The Round-based Blockchain Time-stamping Scheme is proposed that is scalable, i.e., it requires embedding a constant number of bytes into a blockchain independent from a number of input documents. The scheme allows to prove that a document existed not only before a certain date, but after a certain date as well. Moreover, the purpose of the scheme is to meet non-repudiation requirements for digitally signed documents. The scheme allows verifying signature validity using a chain model and under some conditions using a modified shell model.

Security Analysis of Particular Quantum Proxy Blind Signature Against the Forgery Attack

As an important topic of quantum cryptography, quantum proxy blind signature has attracted more and more attentions in recent years. However, with our analysis, it can be seen that there exists a common security loophole in two particular quantum proxy blind signature schemes, i.e., the receiver can forge a valid signature without being caught by others. In order to show that, the detailed attack strategy and the potential improved ideas are proposed in this paper.

Analysis of NGS-based blood immune cell RNA signatures for colorectal cancer detection

Abstract Background Colorectal Cancer (CRC) is the second leading cause of cancer mortality worldwide. Effective and non-invasive biomarkers are needed to improve early diagnosis and disease management. Immune cells play a key role in tumor progression. Circulating immune cell count is a potential cancer biomarker, as indicated by the association of high blood neutrophil-to-lymphocyte ratio with poor prognosis in patients with cancer. The study goal was to determine the correlation between circulating immune cell counts and immune cell-specific RNA signatures and to evaluate the signature potential for CRC detection. Methods The transcriptome profiles of peripheral blood mononuclear cells from 561 Asian and Caucasian subjects (189 CRC, 115 advanced adenomas, 39 other cancers, 218 controls without colorectal lesions (CON)) were generated by RNA-seq on the Illumina platform. Neutrophils, lymphocytes and monocytes counts were obtained by standard hematology testing. Specific RNA signatures for neutrophils, monocyte/macrophages, T cells, CD4, CD8, B cells, NK cells were compiled from literature. The mean expression level of all genes in each Immune cell signature was calculated and used for statistical analyses. Results The main immune cell type RNA signatures showed correlation with the relative cell counts (r: 0.4-0.6), indicating the validity of the RNA signatures. Myeloid cell (monocyte/macrophage and neutrophil) RNA signatures were the most significantly upregulated in CRC compared to CON (p Conclusion This study shows that measuring specific immune cell type by RNA signatures correlate with traditional cell counting methods, enabling the extraction of valuable clinical information from blood transcriptomic data. This data suggests that both blood myeloid and T cells RNA signatures are promising biomarkers for CRC detection. Further biomarker development would require the optimization of the RNA signatures to validate and increase their diagnostic power. Legal entity responsible for the study Novigenix. Funding Novigenix. Disclosure S. Morgenthaler: Advisory / Consultancy: Novigenix. L. Ciarloni: Shareholder / Stockholder / Stock options, Full / Part-time employment: Novigenix. G. Dorta: Advisory / Consultancy: Novigenix. S. Hosseinian Ehrensberger: Shareholder / Stockholder / Stock options, Full / Part-time employment: Novigenix. All other authors have declared no conflicts of interest.

Certificateless aggregate signature scheme secure against fully chosen-key attacks

Certificateless aggregate signature (CLAS) schemes enjoy the benefits of both certificateless cryptography and aggregate signature features. Specifically, it not only simplifies the certificate management without introducing the key escrow problem but also transforms many signatures into one aggregate signature to save communication and computation cost.CLAS is a powerful cryptographic tool, yet its security should be thoroughly analyzed before being implemented. In this paper, we give a new insight into the security of CLAS schemes. We introduce a potential and realistic attack called fully chosen-key attacks that has not been considered in the traditional security models and define the security model against fully chosen-key attacks. In contrast to the traditional models, the adversary is allowed to hold all the signers’ private keys and its goal is not to forge an aggregate signature but to output invalid single signatures that can be aggregated into a valid aggregate signature. We find there is no CLAS scheme secure in traditional security models that is secure against fully chosen-key attacks and then demonstrate how to reinforce the security of an existing scheme to withstand such an attack.

THE USE OF ELECTRONIC SIGNATURES WHEN RECEIVING GOVERNMENT SERVICES OF THE PENSION FUND OF THE RUSSIAN FEDERATION

The provision of state services in electronic form today is one of the innovative directions of development of mechanisms for implementing the functions of state bodies. This was made possible by the improvement of information technology and the use of electronic signatures to give legal significance to documents in electronic form. The article raises the legal and technical issues of using electronic signatures in the practice of providing public services to the Pension Fund of the Russian Federation in electronic form.In the first part of the article, based on an analysis of federal regulatory legal acts in the field of public services and the use of electronic signatures, it is concluded about the types of electronic signatures used in the provision of public services in electronic form, as well as by what means the applicant can check the availability and validity of the electronic signature on received documents as a result of the provision of services.The second part analyzes the use of electronic signatures in the provision of two selective government services of the Pension Fund of the Russian Federation (informing insured persons about the status of their individual personal accounts in the compulsory pension insurance system and informing citizens about the category of citizens of pre-retirement age) through the Unified portal of public services and the personal account of the insured Pension Fund of the Russian Federation website. The author verifies the validity of electronic signatures on documents obtained as a result of an experiment using the services of the Unified Portal of State Services and a commercial accredited Certification Authority.

Identity-Based Redactable Lamport Signature Scheme

The Redactable Signature Scheme (RSS) is one of the hottest topics in cryptography in these years. We find that even if the revision of the source document is limited to a very small range, the revision still has a high practical value. Therefore, it is necessary to find a solution that allows the trusted user to make the above restricted modifications to the source document. What’s more, anyone who needs to verify the security of the modifications can do this. In order to solve this practical problem, we tried to introduce identities in the Lamport signature scheme to establish associations between keys and people, so that let Alice who was the owner of a document and has signed document then can authorize Bob to modify the document and generate new valid signatures. After discussion, we proved that if the identity system we use is secure, then our redactable signature scheme is also secure.

RadiationGeneSigDB: a database of oxic and hypoxic radiation response gene signatures and their utility in pre-clinical research.

Radiation therapy is among the most effective and widely used modalities of cancer therapy in current clinical practice. In this era of personalized radiation medicine, high-throughput data now provide the means to investigate novel biomarkers of radiation response. Large-scale efforts have identified several radiation response signatures, which poses two challenges, namely, their analytical validity and redundancy of gene signatures. To address these fundamental radiogenomics questions, we curated a database of gene expression signatures predictive of radiation response under oxic and hypoxic conditions. RadiationGeneSigDB has a collection of 11 oxic and 24 hypoxic signatures with the standardized gene list as a gene symbol, Entrez gene ID, and its function. We present the utility of this database by gaining an understanding of hypoxia-associated miRNA by applying a penalized multivariate model; by comparing breast cancer oxic signatures in cell line data vs patient data; and by comparing the similarity of head and neck cancer hypoxia signatures at the pathway level in clinical tumour data. We obtained a set of miRNA highly associated both positively and negatively to the hypoxia gene signatures, across pan-cancer. In addition, we identified moderate correlations between breast cancer oxic signatures in patient data, and significant differences across molecular subtypes. Moreover, we also found that different set of pathways to be enriched using the head and neck hypoxia signatures, although, they are found to be concordant when applied on the patient data. This valuable, curated repertoire of published gene expression signatures provides motivating case studies for how to search for similarities in radiation response for tumours arising from different tissues across model systems under oxic and hypoxic conditions, and how a well-curated set of gene signatures can be used to generate novel biological hypotheses about the functions of non-coding RNA. We envision that RadiationSigDB database will help accelerate preclinical radiotherapeutic discovery pipelines in terms of analytical validity of novel biomarkers of radiation response and the need for ensemble approaches to clinical genomic biomarkers.

Quantum signature scheme based on Hadamard and Hπ/4 operators.

Based on the Hadamard and Hπ/4 operators, a new quantum signature scheme is proposed. In our scheme, the signer's private key is generated by a trusted private key generator (PKG), while the identity information of the signer is used as the corresponding public key. Both of the private key and public key of the signer are classical bit strings, which can be easily stored and reused. Given a quantum signature, anyone can verify the validity of the quantum signature with the signer's identity. Therefore, our scheme is a public-key quantum signature without a digital certificate, which has the merits of an identity-based cryptosystem and can simplify the key management of the quantum signature system. On the other hand, our scheme need not use any quantum swap test during the signature verification phase. Furthermore, by the signature proof, our scheme can arbitrate the potential disputation of losing quantum signature, which cannot be arbitrated in most of the quantum signature schemes. So our scheme has the property of strong non-repudiation. It also has the security properties of information-theoretic security, unforgeability, etc. Our scheme can achieve a high efficiency of 70%. Therefore, our quantum signature scheme is more secure, practicable, and efficient than the similar schemes.