Signature Generation Research Articles

An Efficient Full Hardware Implementation of Extended Merkle Signature Scheme

This paper presents a full hardware implementation of the eXtended Merkle Signature Scheme (XMSS), a NIST approved and IETF RFC specified post-quantum cryptography (PQC) algorithm. An optimized node traversal is proposed to enable efficient memory utilization without compromising the computational latency of the L-tree and Merkle tree construction, which are two key components used for the compression of the Winternitz One-Time Signature (WOTS) public key in XMSS. The computation of the authentication path during signature generation has also been significantly sped up by our proposed hardware implementation of the Buchmann, Dahmen, and Schneider (BDS) algorithm. Our implementation has completely avoided the use of block random-access memory, which is known to be vulnerable to side-channel attacks. The memory requirement has been highly optimized for implementation with small flip-flop chains and register counters as pointers for fast data access. To the best of our knowledge, this is the first full hardware implementation of all three <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">key generation</i> , <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">signing</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">verification</i> operations of XMSS. The design has been prototyped and evaluated on a 28 nm FPGA platform to demonstrate its performance improvements over the most efficient software and hardware/software co-design methods reported to date. Specifically, it increases the computational efficiency of the best reported XMSS implementation for <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">key generation</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">signature generation</i> by about 20% and 50%, respectively. It can also run at 10% higher clock speed than the fastest hardware implementation of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">signature verification</i> in FPGA with 8% lower hardware resource utilization.

Cyber Security Frameworks

Abstract: In this paper we attempt to explain and establish certain frameworks that can be assessed for implementing security systems against cyber-threats and cyber-criminals. We give a brief overview of electronic signature generation procedures which include its validation and efficiency for promoting cyber security for confidential documents and information stored in the cloud. We strictly avoid the mathematical modelling of the electronic signature generation process as it is beyond the scope of this paper, instead we take a theoretical approach to explain the procedures. We also model the threats posed by a malicious hacker seeking to induce disturbances in the functioning of a power transmission grid via the means of cyber-physical networks and systems. We use the strategy of a load redistribution attack, while clearly acknowledging that the hacker would form its decision policy on inadequate information. Our research indicate that inaccurate admittance values often cause moderately invasive cyber-attacks that still compromise the grid security, while inadequate capacity values result in comparatively less efficient attacks. In the end we propose a security framework for the security systems utilised by companies and corporations at global scale to conduct cyber-security related operations. Keywords: Electronic signature, Key pair, sequence modelling, hacker, power transmission grid, Threat response, framework.

Metrics based on information entropy applied to evaluate complexity of landscape patterns.

Landscape is an ecological category represented by a complex system formed by interactions between society and nature. Spatial patterns of different land uses present in a landscape reveal past and present processes responsible for its dynamics and organisation. Measuring the complexity of these patterns (in the sense of their spatial heterogeneity) allows us to evaluate the integrity and resilience of these complex environmental systems. Here, we show how landscape metrics based on information entropy can be applied to evaluate the complexity (in the sense of spatial heterogeneity) of patches patterns, as well as their transition zones, present in a Cerrado conservation area and its surroundings, located in south-eastern Brazil. The analysis in this study aimed to elucidate how changes in land use and the consequent fragmentation affect the complexity of the landscape. The scripts CompPlex HeROI and CompPlex Janus were created to allow calculation of information entropy (He), variability (He/Hmax), and López-Ruiz, Mancini, and Calbet (LMC) and Shiner, Davison, and Landsberg (SDL) measures. CompPlex HeROI enabled the calculation of these measures for different regions of interest (ROIs) selected in a satellite image of the study area, followed by comparison of the complexity of their patterns, in addition to enabling the generation of complexity signatures for each ROI. CompPlex Janus made it possible to spatialise the results for these four measures in landscape complexity maps. As expected, both for the complexity patterns evaluated by CompPlex HeROI and the complexity maps generated by CompPlex Janus, the areas with vegetation located in a region of intermediate spatial heterogeneity had lower values for the He and He/Hmax measures and higher values for the LMC and SDL measurements. So, these landscape metrics were able to capture the behaviour of the patterns of different types of land use present in the study area, bringing together uses linked to vegetation with increased canopy coverage and differentiating them from urban areas and transition areas that mix different uses. Thus, the algorithms implemented in these scripts were demonstrated to be robust and capable of measuring the variability in information levels from the landscape, not only in terms of spatial datasets but also spectrally. The automation of measurement calculations, owing to informational entropy provided by these scripts, allows a quick assessment of the complexity of patterns present in a landscape, and thus, generates indicators of landscape integrity and resilience.

Proteomic cellular signatures of kinase inhibitor-induced cardiotoxicity

Drug Toxicity Signature Generation Center (DToxS) at the Icahn School of Medicine at Mount Sinai is one of the centers for the NIH Library of Integrated Network-Based Cellular Signatures (LINCS) program. Its key aim is to generate proteomic and transcriptomic signatures that can predict cardiotoxic adverse effects of kinase inhibitors approved by the Food and Drug Administration. Towards this goal, high throughput shotgun proteomics experiments (308 cell line/drug combinations +64 control lysates) have been conducted. Using computational network analyses, these proteomic data can be integrated with transcriptomic signatures, generated in tandem, to identify cellular signatures of cardiotoxicity that may predict kinase inhibitor-induced toxicity and enable possible mitigation. Both raw and processed proteomics data have passed several quality control steps and been made publicly available on the PRIDE database. This broad protein kinase inhibitor-stimulated human cardiomyocyte proteomic data and signature set is valuable for prediction of drug toxicities.

Discriminating malignant from benign testicular masses using machine-learning based radiomics signature of appearance diffusion coefficient maps: Comparing with conventional mean and minimum ADC values

PurposeTo develop a machine-learning-based radiomics signature of ADC for discriminating between benign and malignant testicular masses and compare its classification performance with that of minimum and mean ADC. MethodsA total of ninety-seven patients with 101 histopathologically confirmed testicular masses (70 malignancies, 31 benignities) were evaluated in this retrospective study. Eight hundred fifty-one radiomics features were extracted from the preoperative ADC map of each lesion. The mean and minimum ADC values are part of the radiomics features. Thirty lesions were randomly selected to estimate the reliability of the features. The redundant features were eliminated using univariate analysis (independent t test and Mann–Whitney U test, where appropriate) and Spearman’s rank correlation. The least absolute shrinkage and selection operator (LASSO) algorithm was employed for feature selection and radiomics signature generation. The classification performance of the radiomics signature and minimum and mean ADC values were evaluated by receiver operating characteristic (ROC) curve analysis and compared by DeLong’s test. ResultsThe whole lesion-based mean ADC showed no difference between benign and malignant testicular masses (P = 0.070, training cohort; P = 0.418, validation cohort). Compared with the minimum ADC, the ADC-based radiomics signature yielded a higher area under the curve (AUC) in both the training (AUC: 0.904, 95% confidence interval [CI]: 0.832–0.975) and validation cohorts (AUC: 0.868, 95% CI: 0.728–1.00). ConclusionsConventional mean ADC values are not always helpful in discriminating between testicular benignities and malignancies. The minimum ADC and radiomics signature might be better alternatives, with the radiomics signature performing better than the minimum ADC.

Design and Evaluation of Countermeasures Against Fault Injection Attacks and Power Side-Channel Leakage Exploration for AES Block Cipher

Differential Fault Analysis (DFA) and Power Analysis (PA) attacks, have become the main methods for exploiting the vulnerabilities of physical implementations of block ciphers, currently used in a multitude of applications, such as the Advanced Encryption Standard (AES). In order to minimize these types of vulnerabilities, several mechanisms have been proposed to detect fault attacks. However, these mechanisms can have a significant cost, not fully covering the implementations against fault attacks or not taking into account the leakage of the information exploitable by the power analysis attacks. In this paper, four different approaches are proposed with the aim of protecting the AES block cipher against DFA. The proposed solutions are based on Hamming code and parity bits as signature generators for the internal state of the AES cipher. These allow to detect DFA exploitable faults, from bit to byte level. The proposed solutions have been applied to a T-box based AES block cipher implemented on Field Programmable Gate Array (FPGA). Experimental results suggest a fault coverage of 98.5% and 99.99% with an area penalty of 9% and 36% respectively, for the parity bit signature generators and a fault coverage of 100% with an area penalty of 18% and 42% respectively when Hamming code signature generator is used. In addition, none of the proposed countermeasures impose a frequency degradation, in respect to the unprotected cipher. The proposed work goes further in the evaluation of the proposed DFA countermeasures by evaluating the impact of these structures in terms of power side-channel. The obtained results suggest that no extra information leakage is produced that can be exploited by PA. Overall, the proposed DFA countermeasures provide a high fault coverage protection with a low cost in terms of area and power consumption and no PA security degradation.

Lamport Certificateless Signcryption Deep Neural Networks for Data Aggregation Security in WSN

Confidentiality and data integrity are essential paradigms in data aggregation owing to the various cyberattacks in wireless sensor networks (WSNs). This study proposes a novel technique named Lamport certificateless signcryption-based shift-invariant connectionist artificial deep neural networks (LCS-SICADNN) by using artificial deep neural networks to develop the data aggregation security model. This model utilises the input layer with several sensor nodes, four hidden layers to overcome different attacks (data injection, compromised node, Sybil and black hole attacks) and the output layer to analyse the given input. The Lamport one-time certificateless signcryption technique involving three different processes (key generation, signcryption and unsigncryption) is adopted to achieve secure data transmission between the sender and receiver. Firstly, a one-way function is executed to generate the public and private keys for each sensor node in the WSN. Secondly, digital signature generation and encryption are both performed. The sender node, which handles the signature generation and data encryption, forwards the data to the aggregator node. Then, the receiver verifies the data by using the sender’s public key during data decryption. Thus, data aggregation security can be guaranteed. Finally, the authorised node aggregates the data with much higher data confidentiality and privacy. Performance analysis is conducted by simulating the proposed LCS-SICADNN and conventional models. Results of comparison indicate that the LCS-SICADNN can improve data aggregation security with higher throughput and lesser delay, packet drop and overhead compared with the conventional methods.

Identity-based secure data aggregation in big data wireless sensor networks

Secure data aggregation (SDA) is an inherent paradigm in big data wireless sensor networks (WSNs) to reduce data transmissions, maximise the network lifetime and provide security. However, SDA protocols that use elliptic curve suffer from mapping and reverse mapping functions. Currently, there is no known mapping function which is both homomorphic and effective in reverse mapping. In addition, SDA protocols that use public key infrastructure incurs high computation and communication cost. To overcome these challenges, this paper proposes a novel identity-based secure data aggregation (ISDA) protocol for big data wireless sensor networks. This protocol is based on bilinear pairing and combines identity-based homomorphic encryption scheme with identity-based signature to achieve end-to-end security. In WSNs, this is the first SDA protocol that employs both identity-based encryption and identity-based signature scheme. ISDA shares the same public/private keys during encryption and signature generation, which significantly reduces the complexity of the protocol. Security analysis reveals that ISDA is secure against various internal and external attacks and proves the correctness of the proposed protocol. Performance evaluation shows that ISDA incurs less overhead than state-of-the-art bilinear pairing-based SDA schemes, thereby it minimises the energy consumption and increases the lifetime of wireless sensor networks.

Constructing New Representative Collective Signature Using the GOST R34.10-2012

A representative collective signature is a signature created by a collective of multiple signing groups. The basic requirement for this signature is that it must include information about all participants involved in the signing process of a given document. The U component in the 3-component collective signature (including U, E, S) is used to satisfy this requirement. In this paper, we propose a new form of representative collective signature consisting of only two components (e, s), then, the information of all signers is contained in the pseudo-random parameter R. The purpose of this is both to reduce the size of the signature, as well as ensure that the manager of the signing group has enough information to identify the signer and to prevent "disclaimer" during a dispute. In the proposed collective signature scheme, we use the GOST R34.10-2012 digital signature standard to develop a consensus group signature scheme based on the discrete logarithm problem on the Elliptic curve. This scheme allows the generation of a representative collective signature: i) Only 512 bits in length, but still achieves security level 2512 and ii) Significantly reduced computational performance (in comparison to the representative collective signature that represents the three components).

Particle swarm optimization artificial intelligence technique for gene signature discovery in transcriptomic cohorts

The development of gene signatures is key for delivering personalized medicine, despite only a few signatures being available for use in the clinic for cancer patients. Gene signature discovery tends to revolve around identifying a single signature. However, it has been shown that various highly predictive signatures can be produced from the same dataset. This study assumes that the presentation of top ranked signatures will allow greater efforts in the selection of gene signatures for validation on external datasets and for their clinical translation. Particle swarm optimization (PSO) is an evolutionary algorithm often used as a search strategy and largely represented as binary PSO (BPSO) in this domain. BPSO, however, fails to produce succinct feature sets for complex optimization problems, thus affecting its overall runtime and optimization performance. Enhanced BPSO (EBPSO) was developed to overcome these shortcomings. Thus, this study will validate unique candidate gene signatures for different underlying biology from EBPSO on transcriptomics cohorts. EBPSO was consistently seen to be as accurate as BPSO with substantially smaller feature signatures and significantly faster runtimes. 100% accuracy was achieved in all but two of the selected data sets. Using clinical transcriptomics cohorts, EBPSO has demonstrated the ability to identify accurate, succinct, and significantly prognostic signatures that are unique from one another. This has been proposed as a promising alternative to overcome the issues regarding traditional single gene signature generation. Interpretation of key genes within the signatures provided biological insights into the associated functions that were well correlated to their cancer type.

Рандомизированный аналог неоспоримой подписи Чаума - ван-Антверпена

We suggest an elliptic curve modification of the undeniable signature introduced by D. Chaum and H. van-Antwerpen. The signature generation algorithm is supplemented with a preliminary stage of randomization. For signature verification and disavowal protocols, two options are offered. Theorems showing that these protocols meet their purpose have been proven. A method for converting an undeniable signature into a regular digital signature is described, illustrated by the Schnorr electronic signature scheme as an example.

Blockchain-Based Dashcam Video Management Method for Data Sharing and Integrity in V2V Network

A dashboard camera (Dashcam) is attached to the front or rear of a vehicle to record images and video. As it is effective in crime prevention and accident management and it can also be used as learning data for Traffic Accident Detection technology for Autonomous Vehicles the use of Dashcam is increasing. However, the video data is stored on a memory card or a cloud server, so there is a high possibility of data loss and forgery. Although it is possible to prevent forgery and falsification using distributed storage based on blockchain technology, the authenticity and privacy of the image data stored in the blockchain cannot be guaranteed. In this study, to solve this problem, we propose a multi-signature-based access control method by grouping and storing video data of multiple vehicles based on GPS (Global Positioning System) data. To ensure the privacy of the video data stored in the blockchain, only users uploading video belonging to the relevant GPS can access nearby Dashcam videos. Through these experimental results, it show that Experimental results proposed method can maintain low latency in large-scale request environment to the privacy and reach data management efficiently in a distributed file system. According to our experiments, the dashcam video data distributed storage latency was fast enough, with an average of 25 ms for uploads and less than 15 ms for downloads. The signature generation time is 10ms, and the verification time required for access control is also less than 100 ms, which is the same even if the number of nodes increases, so scalability is not affected. The blockchain transaction processing took about 2 seconds, but it does not affect the V2V network. Also, client registration time does not affect performance.

Enhanced Side-Channel Analysis on ECDSA Employing Fixed-Base Comb Method

Table-based scalar multiplication provides practical security for ECDSA signature generation. However, a novel key recovery attack against this form of ECDSA signature generation that exploits the collisions between entries was recently proposed at CHES 2021. This attack is possible even if table entries are unknown, such as with random permutated entry ordering. In this paper, we enhance the efficiency of the key recovery attack against secure ECDSA signature generation based on fixed-base comb scalar multiplication. We significantly reduce the required number of traces by compressing collision information using the mathematical relationship between table entry collisions. We verify this is a practical threat by performing an experiment on fixed-base comb method with window width <inline-formula><tex-math notation="LaTeX">$w=4$</tex-math></inline-formula>. Using our method, up to 27 traces are needed, much fewer than 1,019 traces required in the CHES publication. We cluster real traces measured using 32-bit STM32F4 microcontroller. In the experiment, we provide a selection method of points of interest using variance traces and unsupervised clustering-based leakage detection. With the selection method, we succeed in clustering leakages into 16 classes with a 100&#x0025; success rate with 32-bit MCU. This represents the first experiment to cluster the more leakage classes with a 32-bit MCU than in literature.

НОВАЯ КОНЦЕПЦИЯ РАЗРАБОТКИ ПОСТКВАНТОВЫХ АЛГОРИТМОВ ЦИФРОВОЙ ПОДПИСИ НА НЕКОММУТАТИВНЫХ АЛГЕБРАХ

Purpose of work is the development of a new approach to designing post-quantum digital signature algorithms that are free from the shortcomings of known analogs – large sizes of the signature and public key. Research method is the use of power vector equations with multiple occurrences of the signature S as a signature verification equation. The computational difficulty of solving equations of the said type relatively the unknown value of S ensures the resistance of the signature scheme to attacks using S as a fitting parameter. The possibility of calculating the value of S by the secret key is provided by using the public key in the form of a set of secret elements of the hidden group, masked by performing left and right multiplications by matched invertible vectors. Results of the study include a new proposed concept for the development of post-quantum digital signature algorithms on non-commutative algebras, which use a hidden commutative group. One of its main differences is the use of a secret key in the form of a set of vectors, the knowledge of which makes it possible to calculate the correct signature value for the random powers present in the verification equation. The form of the latter defines a system of quadratic vector equations connecting the public key with the secret, which is reduced to a system of many quadratic equations with many unknowns, given over a finite field. The computational difficulty of finding a solution to the latter system determines the security of the algorithms developed within the framework of the proposed concept. A quantum computer is ineffective for solving this problem, therefore, the said algorithms are post-quantum. As analogs in construction, digital signature algorithms based on the computational difficulty of the hidden discrete logarithm problem are considered, however, the use of a hidden group and exponentiation operations represent only a general technique for ensuring the correctness of the signature schemes developed within the framework of the concept, and not for specifying a basic computationally difficult problem. To improve the performance of the signature generation and verifications procedures, the four-dimensional algebras defined by sparse basis vector multiplication tables are used as an algebraic support. The proposed concept is confirmed by the development of a specific post-quantum algorithm that provides a significant reduction in the size of the public key and signature in comparison with the finalists of the NIST global competition in the nomination of post-quantum digital signature algorithms. Practical relevance: The developed new concept for constructing post-quantum digital signature algorithms expands the areas of their application in conditions of limited computing resources

Internet of Medical Things-Based Secure and Energy-Efficient Framework for Health Care.

The Internet of Medical Things (IoMT) is a collection of medical equipment and software that can help patients get better care. The purpose of this study is to improve the security of data collected through remote health monitoring of patients utilizing Constrained Application Protocol (CoAP). Asymmetric cryptography techniques may be used to assure the security of such sensor networks. For communication between different IoMT devices and a remote server, the safe CoAP is compatible with the Datagram Transport Layer Security (DTLS) protocol for creating a secure session using existing algorithms such as Lightweight Establishment of Secure Session. The DTLS layer of CoAP, in contrast, has shortcomings in key control, session establishment, and multicast message exchange. As a consequence, for IoMT communication, the creation of an efficient protocol for safe CoAP session establishment is needed. Thus, to solve the existing problems related to key management and multicast security in CoAP, we have proposed an efficient and secure communication technique to establish a secure session key between IoMT devices and distant servers using lightweight Energy-Efficient and Secure CoAP Elliptic Curve Cryptography (E2SCEC2). The advantage of using E2SCEC2 over other identification methods such as Rivest-Shamir-Adleman (RSA) is its compact key size, which allows it to use a smaller key size. This article also compares these algorithms on parameters such as time spent generating keys, signature generation, and verification of E2SCEC2 and RSA algorithms, as well as energy consumption and radio duty cycle, to see if they are compatible in constrained environments.

Constructing efficient and secure batch signature schemes

In ordinary signature schemes, such as RSA, DSA, ECDSA, the signing process is performed only for a single message. Due to performance issues, in some contexts, the above solutions will become unsuitable if a party needs to sign multiple messages simultaneously. For example, in the authenticated key exchange protocols based on signatures between client and server, the server is expected to handle multiple key exchange requests from different clients simultaneously. Batch signing is a solution that generates signatures for multi-messages simultaneously with a single (ordinary) signature generation. In this article, we will consider some of the existing batch signing solutions and point out a few of their weakness. To deal with these problems, the paper also proposes two secure types of batch signature schemes, but still ensures the same efficiency as the existing batch signing solution.

A Compact and High-Performance Hardware Architecture for CRYSTALS-Dilithium

The lattice-based CRYSTALS-Dilithium scheme is one of the three thirdround digital signature finalists in the National Institute of Standards and Technology Post-Quantum Cryptography Standardization Process. Due to the complex calculations and highly individualized functions in Dilithium, its hardware implementations face the problems of large area requirements and low efficiency. This paper proposes several optimization methods to achieve a compact and high-performance hardware architecture for round 3 Dilithium. Specifically, a segmented pipelined processing method is proposed to reduce both the storage requirements and the processing time. Moreover, several optimized modules are designed to improve the efficiency of the proposed architecture, including a pipelined number theoretic transform module, a SampleInBall module, a Decompose module, and three modular reduction modules. Compared with state-of-the-art designs for Dilithium on similar platforms, our implementation requires 1.4×/1.4×/3.0×/4.5× fewer LUTs/FFs/BRAMs/DSPs, respectively, and 4.4×/1.7×/1.4× less time for key generation, signature generation, and signature verification, respectively, for NIST security level 5.

Modular signature of long non-coding RNA association networks as a prognostic biomarker in lung cancer

BackgroundIncreasing amount of long non-coding RNAs (lncRNAs) have been found involving in many biological processes and played salient roles in cancers. However, up until recently, functions of most lncRNAs in lung cancer have not been fully discovered, particularly in the co-regulated lncRNAs. Thus, this study aims to investigate roles of lncRNA modules and uncover a module-based biomarker in lung adenocarcinoma (LUAD).ResultsWe used gene expression profiles from The Cancer Genome Atlas (TCGA) to construct the lncRNA association networks, from which the highly-associated lncRNAs are connected as modules. It was found that the expression of some modules is significantly associated with patient’s survival, including module N1 (HR = 0.62, 95% CI = 0.46–0.84, p = 0.00189); N2 (HR = 0.68, CI = 0.50–0.93, p = 0.00159); N4 (HR = 0.70, CI = 0.52–0.95, p = 0.0205) and P3 (HR = 0.68, CI = 0.50–0.92, p = 0.0123). The lncRNA signature consisting of these four prognosis-related modules, a 4-modular lncRNA signature, is associated with favourable prognosis in TCGA-LUAD (HR = 0.51, CI = 0.37–0.69, p value = 2.00e−05). Afterwards, to assess the performance of the generic modular signature as a prognostic biomarker, we computed the time-dependent area under the receiver operating characteristics (AUC) of this 4-modular lncRNA signature, which showed AUC equals 68.44% on 336th day. In terms of biological functions, these modules are correlated with several cancer hallmarks and pathways, including Myc targets, E2F targets, cell cycle, inflammation/immunity-related pathways, androgen/oestrogen response, KRAS signalling, DNA repair and epithelial-mesenchymal transition (EMT).ConclusionTaken together, we identified four novel LUAD prognosis-related lncRNA modules, and assessed the performance of the 4-modular lncRNA signature being a prognostic biomarker. Functionally speaking, these modules involve in oncogenic hallmarks as well as pathways. The results unveiled the co-regulated lncRNAs in LUAD and may provide a framework for further lncRNA studies in lung cancer.

ECDSA: The Virtual Signature Set of Rules of a Higher Internet

Computerized Currency is an electronic kind of cash. These days, everything is developing into digitization measure. This contains all properties like actual cash and furthermore permits prompt trades which will be reliably executed across the world while partner with upheld contraptions and organizations. In this paper we presented the SHA3-512 bit hashing algorithm and ECDSA algorithm for generation of digital signature. The Elliptic curve cryptography (ECC) is one of the greater promising technology on this area. ECC-enabled TLS is quicker and greater scalable on our servers and presents the equal or higher protection than the default cryptography in use at the web. one of the elliptic curve algorithm, the elliptic curve virtual signature algorithm (ECDSA), may be used to enhance overall performance at the Internet. CloudFlare now helps custom ECDSA certificate for our clients and that’s true for all people the use of the Internet.

Practical dynamic group signature with efficient concurrent joins and batch verifications

Dynamic group signatures (DGS) enable a user to generate a signature on behalf of a group of users, allowing a prospective user to join via an appropriate join protocol. A natural security requirement in the dynamic setting is to permit an adversary to concurrently perform join protocol executions. To date, most of DGS schemes do not provide the efficient concurrent join protocols in their security analysis, because of the need to use knowledge extractors. Also, DGS schemes have to provide efficient batch verifications for practical applications such as Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communication, where a large number of group signatures should be verified in a very short time. In this paper, we propose a new practical DGS scheme that supports not only efficient concurrent joins but also batch verifications. The concurrent security is proven by showing that our join protocols are simulated without any knowledge extractor in security analysis. To do this, we introduce a modified Pointcheval–Sanders (PS) problem that can guarantee efficiently checking equality of discrete logarithms. In terms of efficiency, when considering a type-3 pairing, our DGS scheme has the advantages that the signature generation and verification are faster and especially our batch verification is at least 7 times faster in case of verifying 100 signatures, compared to other comparable pairing-based DGS schemes in the literature.