Signature Algorithm Research Articles

CoinFA: an efficient coin mixing scheme with flexible amounts

Abstract Coin mixing is an efficient anonymization technology of cryptocurrency used to eliminate the linkability of transaction parties by hiding their addresses in an anonymous set. However, a common weakness with most existing coin mixing schemes is that the amount of mixed coins must be the same for all requests within a mixing cycle, otherwise it is easy for an attacker to restore the linkability of transaction parties. In this paper, we design a stage-payable puzzle solution mechanism, named CoinFA, which reverses the control of the requesting amounts to the users for flexible mixing amounts. In our design, the payee (with an output address) first requests a puzzle from the mixers and the latter are the only ones who know the solution of the puzzle. If the payee solves the puzzle successfully, he can be rewarded with the corresponding Bitcoins. The payer (allowed to have multiple input addresses) then requests the solution by paying in installments. We achieve better security by weakening the rights of the involved third parties, while the hierarchical structure allows our solution to have better efficiency and robustness. We perform a security analysis on CoinFA based on the standard Rivest-Shamir-Adleman (RSA) assumption and Elliptic Curve Digital Signature Algorithm unforgeability. We also analyze the performance of CoinFA by comparing it with two related schemes, and the results show that our CoinFA scheme has a greater advantage when the mixing amount is relatively small.

Secure data communication in WSHN using EXP-MD5 and DHSK-ECC.

In the Healthcare (HC) sector, the usage of Wireless Sensor Healthcare Networks (WSHN) is attaining specific importance. The sensor device is implanted into the patient's body, and the sensed health information of patients is transformed via data aggregating devices like mobile devices, cameras, and so on, to the doctors. Thus, the early signs of diseases are identified, and remote monitoring of the patient's health is carried out by the physician on time. This aids in improving the health condition of the people and reduces the severity of disorders. But, the security gap in HC remains unresolved, despite various advantages. This work proposes secured data communication in WSHN using Exponential Message Digest5 (EXP-MD5) and Diffie Hellman Secret Key-based Elliptic Curve Cryptography (DHSK-ECC) techniques. Primarily, the patient registers their details in the Hospital Cloud Server (HCS). With hospital ID and patient ID, public and private keys are generated during registration. Afterward, by utilizing the Navie Shuffling (NS) technique, nCr combinations are created and shuffled. After shuffling, any of the randomly selected combinations are encoded utilizing the American Standard Code for Information Interchange (ASCII) code. For patient authentication, the ASCII code is further converted into a Quick Response(QR) code. Upon successful registration, the patient logs in to HCS. The patient can book for doctor's appointment if the login details are verified with those of the registered details. On consulting the doctor at the pre-informed time, the digital signature is created utilizing the Universal Unique Salt-based Digital Signature Algorithm (UUS-DSA) for authenticating the patient details. Further, for providing accessibility to all the authorized patients, the registered patients on HCS are considered as nodes. Then, an authorized path is created using the EXP-MD5 technique to protect each individual patient's details. The patient's IoT data is sensed, followed by authorized path creation. The data is encrypted via the DHSK-ECC algorithm for secure data transmission. Lastly, all the information is stored in HCS, so that the patient's health condition is regularly monitored by the doctor and the needy advice is suggested to the patients in the future. Also, hash matching is carried out when the doctor needs to access data. The proposed technique's efficacy is validated by the performance analysis in comparison with other conventional techniques. In this proposed research, the authentication is performed in multiple scenarios to enhance data security and user privacy. The patient details are authenticated during registration and verification to access the online consultation only by the authorized person. Further, the patient health information is encrypted in the proposed work after consultation so that the intrusion of medical records by malicious users and data tampering is prevented. Also, the sensed data gathered from patients are transferred to the HCS by creating the authorized path, which further enhances the security of patient data. Thus, the data communication of the WSHN is well-secured in this work through multi-level authentication and improved cryptography techniques.

Secure and Reliable Intrusion Detection Scheme for Software-Defined Networking Using LFTS-Rnn and PC-JTFOA

In recent times, Software Defined Networking (SDN) has gained immense popularity among communication networks due to its high network connectivity and security. But, owing to the lack of sufficient security schemes and dynamic access control, conventional techniques could be more efficient. Hence, this paper proposes a secure intrusion detection scheme for SDN utilizing LogishFTS-based Recurrent Neural Networks (LFTS-RNN) and Poisson Clumping Japanese Tree Frog Optimization Algorithm (PC-JTFOA). Initially, by using a username, password, and Signed Access Control (SAC), the registered users log in to the network. The Entropy Makwa-based Digital Signature Algorithm (EMDSA) is utilized to identify the attackers during the login process. Then, the Intrusion Detection System (IDS) is trained using the historical dataset. The critical features are extracted in IDS; subsequently, by using the PC-JTFOA, the optimal features are selected. Likewise, the selected features are inputted into the LFTS-RNN to recognize the intruders in the application plane. Moreover, the process of data security and load balancing is undergone by the data. Afterward, the balanced data is subjected to IDS to detect the attackers in the control plane. According to experimental outcomes, the proposed technique obtained a higher prominence with an accuracy of 98.35%.

Diagnostic Accuracy of Clinical Sign Algorithms to Identify Sepsis in Young Infants Aged 0 to 59 Days: A Systematic Review and Meta-analysis.

Accurate identification of possible sepsis in young infants is needed to effectively manage and reduce sepsis-related morbidity and mortality. Synthesize evidence on the diagnostic accuracy of clinical sign algorithms to identify young infants (aged 0-59 days) with suspected sepsis. MEDLINE, Embase, CINAHL, Global Index Medicus, and Cochrane CENTRAL Registry of Trials. Studies reporting diagnostic accuracy measures of algorithms including infant clinical signs to identify young infants with suspected sepsis. We used Cochrane methods for study screening, data extraction, risk of bias assessment, and determining certainty of evidence using Grading of Recommendations Assessment Development and Evaluation. We included 19 studies (12 Integrated Management of Childhood Illness [IMCI] and 7 non-IMCI studies). The current World Health Organization (WHO) 7-sign IMCI algorithm had a sensitivity of 79% (95% CI 77%-82%) and specificity of 77% (95% CI 76%-78%) for identifying sick infants aged 0-59 days requiring hospitalization/antibiotics (1 study, N = 8889). Any IMCI algorithm had a pooled sensitivity of 84% (95% CI 75%-90%) and specificity of 80% (95% CI 64%-90%) for identifying suspected sepsis (11 studies, N = 15523). When restricting the reference standard to laboratory-supported sepsis, any IMCI algorithm had a pooled sensitivity of 86% (95% CI 82%-90%) and lower specificity of 61% (95% CI 49%-72%) (6 studies, N = 14278). Heterogeneity of algorithms and reference standards limited the evidence. IMCI algorithms had acceptable sensitivity for identifying young infants with suspected sepsis. Specificity was lower using a reference standard of laboratory-supported sepsis diagnosis.

Predictive Accuracy of Infant Clinical Sign Algorithms for Mortality in Young Infants Aged 0 to 59 Days: A Systematic Review.

Clinical sign algorithms are a key strategy to identify young infants at risk of mortality. Synthesize the evidence on the accuracy of clinical sign algorithms to predict all-cause mortality in young infants 0-59 days. MEDLINE, Embase, CINAHL, Global Index Medicus, and Cochrane CENTRAL Registry of Trials. Studies evaluating the accuracy of infant clinical sign algorithms to predict mortality. We used Cochrane methods for study screening, data extraction, and risk of bias assessment. We determined certainty of evidence using Grading of Recommendations Assessment Development and Evaluation. We included 11 studies examining 26 algorithms. Three studies from non-hospital/community settings examined sign-based checklists (n = 13). Eight hospital-based studies validated regression models (n = 13), which were administered as weighted scores (n = 8), regression formulas (n = 4), and a nomogram (n = 1). One checklist from India had a sensitivity of 98% (95% CI: 88%-100%) and specificity of 94% (93%-95%) for predicting sepsis-related deaths. However, external validation in Bangladesh showed very low sensitivity of 3% (0%-10%) with specificity of 99% (99%-99%) for all-cause mortality (ages 0-9 days). For hospital-based prediction models, area under the curve (AUC) ranged from 0.76-0.93 (n = 13). The Score for Essential Neonatal Symptoms and Signs had an AUC of 0.89 (0.84-0.93) in the derivation cohort for mortality, and external validation showed an AUC of 0.83 (0.83-0.84). Heterogeneity of algorithms and lack of external validation limited the evidence. Clinical sign algorithms may help identify at-risk young infants, particularly in hospital settings; however, overall certainty of evidence is low with limited external validation.

Tightly-Secure Two-Tier Signatures on Code-Based Digital Signatures with Chameleon Hash Functions

In the current landscape where quantum algorithms pose a significant threat to conventional digital signature algorithms, code-based digital signature algorithms have emerged as the primary focus of ongoing research in post-quantum cryptography. Digital signatures play a pivotal role in ensuring non-repudiation and authentication, making them an indispensable cryptographic technique. The vulnerability of most digital signature algorithms to quantum attacks have prompted a significant surge in research on code-based digital signature algorithms, which have emerged as a prominent field within post-quantum cryptography. There are generally three distinct approaches to constructing code-based digital signature algorithms: (1) Developing an algorithm that follows the inverse process of the code-based public-key encryption algorithm; (2) Utilizing zero-knowledge identification algorithms in conjunction with the Fiat–Shamir paradigm to formulate a signature algorithm; (3) Constructing a specialized subset of the syndrome space as the foundation for the digital signature algorithm. Chameleon Signature is a non-interactive signature that operates on the hash and signature paradigm, exhibiting comparable efficiency to conventional schemes. Its distinct advantage lies in the fact that the owner of the public key does not necessarily require access to the corresponding secret key within the Chameleon hash algorithm. Notably, Chameleon signatures possess an inherent characteristic of non-transferability, with their validity ascertainable solely by designated recipients. This paper introduces the first Chameleon hash function based on both KKS and HFE schemes, showcasing its superiority over traditional schemes through rank metrics and big fields for enhanced security. The deployment of Chameleon hash functions within hash-and-sign signature schemes introduces a nuanced layer of security and verification flexibility. This study elucidates the implications of integrating Chameleon hash functions into the recipient’s public key infrastructure, highlighting the dual capability it affords authorized parties for secure and adaptable verification processes, alongside mechanisms for the detection of unauthorized alterations.

Deniable ring signature scheme based on the ISRSAC digital signature algorithm

This article introduces a deniable ring signature scheme within the framework of a ring signature protocol, which allows a member of the ring to assert or deny their role as the signature’s originator without the involvement of a trusted third party. Deniable ring signatures find applications in various scenarios where balancing privacy protection with supervised oversight is crucial. In this work, we present a novel deniable ring signature scheme based on the ISRSAC digital signature, tailored for environments with regulatory requirements, empowering regulators to hold malicious signers accountable. We formally validate the scheme’s correctness, unforgeability, anonymity, traceability, and non-frameability through rigorous proofs. Additionally, we conduct a comparative analysis of the communication and computational overheads associated with our proposed scheme, demonstrating its superiority in practical scenarios such as electronic auctions and anonymous reporting mechanisms.

Modified affine projection sign algorithm for power quality enhancement and metaheuristic-based MPPT in grid-interactive solar PV system: an experimental analysis

Modified affine projection sign algorithm for power quality enhancement and metaheuristic-based MPPT in grid-interactive solar PV system: an experimental analysis

A proposed secure framework for protecting cloud-based educational systems from hacking

Educational institutions and users involved in the whole learning process frequently have concerns about the storage and processing of sensitive data and essential apps in the cloud. Security and privacy issues have emerged as a major challenge, limiting cloud computing’s implementation in educational environments. Several users have yet to meet this security challenge, which is linked to the system’s multi-tenancy nature and the outsourcing of resources and data. This study proposes a secure framework for protecting cloud-based educational systems from hacking using a unique encryption technique, as well as a deep learning-based classification for cloud attack detection. Initially, we preprocess the data and extract features using a gray-level covariance matrix (GLCM). Next, we propose a classification based on multiple convolutional neural networks (M−CNN) to detect attacks in the cloud environment. Finally, we propose a modified digital signature algorithm (MDSA) for data encryption and decryption. The proposed technique achieved high security rates, with an accuracy of 97.7%, sensitivity of 96%, specificity of 94.3%, precision of 99.6%, and recall of 97%. Comparative evaluations showed that the proposed mechanism outperformed other encryption techniques. This novel model enhances the security of cloud-based educational systems and promotes users’ confidence in such platforms.

TOPCOAT: towards practical two-party Crystals-Dilithium

The development of threshold protocols based on lattice-signature schemes has been of increasing interest in the past several years. The main research focus has been towards protocols constructed for various variants of Crystals-Dilithium, future NIST digital signature standard known as ML-DSA. In this work, we propose TOPCOAT, a two-party lattice-based signature algorithm that embodies Dilithium’s compression techniques. The aforesaid result is achieved by introducing a new hinting mechanism that allows parties to collaboratively calculate HighBits\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf {HighBits}$$\\end{document}. Our hinting mechanism allows public key compression similar to Dilithium. Additionally, we suggest an optimization technique to minimize number of restarts both parties need to produce a valid signature. Our approach allows to produce ≈10\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\approx 10$$\\end{document} KB signatures within 3 rounds of communication. We prove security of our scheme under MLWE and MSIS assumptions in ROM, and provide implementation of our proposed scheme. As additional contribution, we present vulnerabilities and inconsistencies found in Liu et al. work (Future Generation Computer Systems 2023) which aimed to construct distributed lattice-based signature protocol.

Quantum-Resistance Meets White-Box Cryptography: How to Implement Hash-Based Signatures against White-Box Attackers?

The adversary model of white-box cryptography includes an extreme case where the adversary, sitting at the endpoint, has full access to a cryptographic scheme. Motivating by the fact that most existing white-box implementations focus on symmetric encryption, we present implementations for hash-based signatures so that the security against white-box attackers (who have read-only access to data with a size bounded by a space-hardness parameter M) depends on the availability of a white-box secure cipher (in addition to a general one-way function). We also introduce parameters and key-generation complexity results for white-box secure instantiation of stateless hash-based signature scheme SPHINCS+, one of the NIST selections for quantum-resistant digital signature algorithms, and its older version SPHINCS. We also present a hash tree-based solution for one-time passwords secure in a white-box attacker context. We implement the proposed solutions and share our performance results.

An NTRU-like Message Recoverable Signature Algorithm

An important feature of Nyberg-Rueppel type digital signature algorithms is message recovery, this signature algorithm can recover the original information from the signature directly by the verifier in the verification phase after signing the message. However, this algorithm is currently vulnerable to quantum attacks and its security cannot be guaranteed. Number Theory Research Unit (NTRU) is an efficient public-key cryptosystem and is considered to be one of the best quantum-resistant encryption schemes. This paper proposes an NTRU-like message recoverable signature algorithm to meet the key agreement requirements in the post-quantum world. This algorithm, designed for the Internet of Things (IoT), constructs a secure system using the Group-Based Message Recoverable Signature Algorithm (NR-GTRU), by integrating a Group-Based NTRU-Like Public-Key Cryptosystem (GTRU) with an efficient Nyberg-Rueppel type of NTRU digital signature algorithm (NR-NTRU). This signature algorithm, resistant to quantum algorithm attacks, offers higher security at the cost of a slight efficiency reduction compared to traditional NTRU signature algorithms, and features Nyberg-Rueppel message recovery, making it well-suited for IoT applications.

The impact of Block chain-Based System on Goods Tracking and management in Industrial Environment

In the domain of Industrial Internet of Things (IIoT), the demand for robust and secure methods for goods tracking and management has become growingly critical. Conventional methods face significant challenges, including authentication, computational overhead, cyber security, and data integrity. To address these issues, this paper proposes a block-chain based system for goods management and tracking with enhanced authentication mechanism by leveraging the decentralized nature of block-chain technology and integrating Elliptic Curve Digital Signature Algorithm (ECDSA) with Elliptic Curve Cryptography-Zero Knowledge Proof (ECC-ZKP). The proposed solution aims to ensure the authenticity and the integrity for all the transaction while providing high level privacy-preserving verification without revealing information. The research in this paper demonstrates that the proposed block-chain-based system significantly enhances security performance, key management and operational efficiency, addressing the existing challenges in IIoT goods tracking and management, providing a resilient framework for more secure industrial operations in managing goods.

Hierarchical signature scheme based on elliptic curve digital signature algorithm

Hierarchical signature scheme based on elliptic curve digital signature algorithm

Syrga2: Post-Quantum Hash-Based Signature Scheme

This paper proposes a new post-quantum signature scheme, Syrga2, based on hash functions. As known, existing post-quantum algorithms are classified based on their structures. The proposed Syrga2 scheme belongs to the class of multi-use signatures with state retention. A distinctive feature of state-retaining signatures is achieving a compromise between performance and signature size. This scheme enables the creation of a secure signature for r messages using a single pair of secret and public keys. The strength of signature algorithms based on hash functions depends on the properties of the hash function used in their structure. Additionally, for such algorithms, it is possible to specify the security level precisely. In the proposed scheme, the HBC-256 algorithm developed at the Institute of Information and Computational Technologies (IICT) is used as the hash function. The security of the HBC-256 algorithm has been thoroughly studied in other works by the authors. In contrast to the Syrga1 scheme presented in previous works by the authors, the Syrga2 scheme provides for the definition of different security levels determined by the parameter τ. This paper experimentally demonstrates the impossibility of breaking the proposed scheme using a chosen-plaintext attack. Additionally, the scheme’s performance is evaluated for signature creation, signing, and message verification.

Evaluation and comparison of lattice-based digital signature of the "Digital Signature Schemes" PQC NIST competition

Over the past decade, post-quantum cryptography has reached a tipping point; institutional bodies and stakeholders have initiated standardization and deployment, and various projects have achieved a reasonably high level of progress and even deployment and implementation. In July 2022, at the end of Round 3 of the NIST's PQC competition, 3 candidates were proposed for the NIST standardization for post-quantum digital signatures scheme: one signature scheme based on MLWE (Crystals-Dilithium), one signature based on NTRU (Falcon), and one signature based on hash (Sphincs+). Although the performance profiles and “black-box” security of these schemes are well understood, resistance to side-channel attacks remains a weak point for all of them. After that, the NIST announced that the PQC standardization process is continuing with a fourth round, with the following KEMs still under consideration: BIKE, Classic McEliece, HQC, and SIKE. However, there are no candidates of digital signature schemes left for consideration. As such, the NIST has issued a call for additional digital signature proposals to be considered in the PQC standardization process. Acceptance of documents ended on June 1, 2023. As a result, 40 candidates were selected for the role of DS standard, namely: 6 DS algorithms based on codes, one DS algorithm based on isogenies, 7 DS algorithms based on lattice operations, 7 candidates for the role of DS algorithm based on the MPC method -in-the-Head and 10 algorithms based on multivariate transformations, 4 DS schemes were selected based on symmetric cryptographic transformations, and 5 more candidates based on other types of cryptographic transformations. The NIST is primarily interested in additional general purpose signature schemes that are not based on structured lattices. For certain applications, such as certificate transparency, the NIST may also be interested in signature schemes that have short signatures and fast verification. The NIST is open to receiving additional materials based on structured lattices, but intends to diversify post-quantum signature standards. Therefore, any structured array-based signature proposal would need to significantly outperform CRYSTALS-Dilithium and FALCON in relevant applications and/or provide significant additional security properties to be considered for standardization. Thus, the purpose of this paper is to analyze, evaluate, and compare digital signature algorithms based on lattice cryptography, an additional PQC NIST competition, and compare them with already standardized lattice-based DS mechanisms, such as CRYSTALS-Dilithium and FALCON.

Atomic cross-chain swap based on private key exchange

Atomic Cross-Chain Swap (ACCS) is one important topic in cryptocurrency, where users can securely and trustlessly exchange assets between two different blockchains. However, most known ACCS schemes assume specific scripting functionalities of the underlying blockchains, such as Hash Time Locked Contracts (HTLC). In addition, these schemes are typically only applicable to certain digital signature schemes, like Schnorr or Elliptic Curve Digital Signature Algorithm (ECDSA) signatures. In this paper, we propose a generic ACCS scheme, independent from the underlying blockchains. To the best of our knowledge, this is the first solution of this kind. Our results are as follows. First, we define a formal system model of ACCS. Next, we present a generic ACCS scheme meets our model. This scheme admits atomicity in cross-chain swaps without the need for a Trusted Third Party (TTP) and protects users’ privacy. Finally, by using the Non-Interactive Zero-Knowledge (NIZK) proof protocol as a tool, we instantiate our generic scheme for Elliptic Curve Discrete Logarithm Problem-based (ECDLP-based) signatures. In addition, we implement our scheme, and the experimental results show that our protocol outperforms the existing ACCS schemes, such as the HTLC-based schemes.

Normalized frequency‐domain block sign algorithm using ℓ1$\ell _{1}$‐norm minimization

AbstractIn this letter, a normalized frequency‐domain block sign‐error algorithm (NFBSA) is proposed by minimizing the ‐norm of the posteriori error vector for filter weight. The NFBSA updates the filter weight vector by employing the sign value of the priori error vector, which can mitigate the impact of impulsive noise. Furthermore, a variable step‐size algorithm (VSS) suitable for application in the NFBSA is proposed, which minimizes the ‐norm of the posteriori error vector with respect to the step‐size. The system identification simulations are conducted using a first‐order autoregressive signal as an input, assuming that impulsive noise occurs. The simulation results demonstrate that the NFBSA exhibits superior misalignment performance compared to the conventional time‐domain sign algorithm, and the NFBSA with the proposed VSS outperformed other VSS‐based sign algorithms.

Ductal carcinoma in situ: Molecular and cellular basis of malignancy.

e12582 Background: The goal of our study is to improve the diagnosis and treatment of DCIS through the identification of the factors driving its invasion and metastasis. Methods: We utilized the Mouse INtraDuctal (MIND) model to investigate the mechanism(s) by which some DCIS become invasive while others remain indolent. This model closely replicates the human condition by injecting non-invasive epithelial cells from patients into mouse mammary ducts to form in situ lesions. In some cases, these cells will display invasive behavior by overcoming the natural barriers of myoepithelium. To compare these two processes, we performed single-cell (sc) RNA-sequencing analysis of 60,000 cells from the pre-transplant time-point representing 17 DCIS (11 became invasive, 6 remained non-invasive). We also performed scATAC/RNA sequencing of a DCIS with associated IDC. Results: Our analysis revealed that the proportion of endothelial cells was higher in cases that became invasive, while the proportion of plasma and T cells was higher in those that remained non-invasive (t-test; P<0.05). This finding suggested that invasive cells reprogrammed the immune microenvironment to exclude immune cells as a means of evading immune surveillance. Additionally, we performed cell-cell interaction (CCI) analysis by CellPhoneDB. This analysis revealed highly ranked CCIs in invasive cases, including luminal cell interactions with pericytes via Wnt5A-SFRP1. On the other hand, highly ranked CCIs in non-invasive cases included HR-positive luminal cell interactions with T cells via CD226-Nectin-2 and CD96-Nectin1. Notably, CD226 and CD96 are T cell receptors that enhance CD8+ T cell activity. These results support the potential role of T-cell interactions with DCIS luminal cells in preventing their invasive transition. We conducted additional analysis of sc-RNA-sequencing data using a stem cell-based gene signature algorithm called CytoTRACE. Our analysis revealed that invasive cells were enriched in cell clusters with significantly higher stem cell scores than non-invasive cells. In another analysis of a patient DCIS with associated IDC using sc-ATAC and RNA sequencing, we discovered that the open chromatin regions in the stem cell cluster were enriched for FOXA1 binding motifs. This cluster also had the highest expression of two pioneer factors (FOXA1 and GRHL2), NEAT1 (paraspeckle protein), ERBB2, 3,4, and ANKRD30A (cell surface protein). Our findings suggest that the pioneer factors FOXA1 and GRHL2 play a crucial role as transcriptional drivers of stemness. Additionally, the ANKRD30A could be used to isolate stem cell clusters to validate their self-renewal potential. Conclusions: DCIS progression is facilitated by interactions between stromal, immune, and epithelial cells, which lead to epigenetic and transcriptional changes. This results in the formation of stem-like cells that are characterized by their plasticity and invasive capacity.

Adaptor signature based on randomized EdDSA in blockchain

Adaptor signature, a new primitive that alleviates the scalability issue of blockchain to some extent, has been widely adopted in the off-chain payment channel and atomic swap. As an extension of standard digital signature, adaptor signature can bind the release of a complete digital signature with the exchange of a secret value. Existing constructions of adaptor signatures are mainly based on Schnorr or ECDSA signature algorithms, which suffer low signing efficiency and long signature length. In this paper, to address these issues, we propose a new construction of adaptor signature using randomized EdDSA, which has Schnorr-like structure with higher signing efficiency and shorter signature length. We prove the required security properties, including unforgeability, witness extractability and pre-signature adaptability, of the new adaptor signature scheme in the random oracle model. We conduct a comparative analysis with an ECDSA-based adaptor signature scheme to demonstrate the effectiveness and feasibility of our new proposal.