A digital currency payment system, method, electronic device, and storage medium

Abstract

The disclosed embodiments disclose a digital currency payment system, method, electronic device, and storage medium. The digital currency payment system includes: a data acquisition module for acquiring a global ring signature transaction data set; a feature extraction module for generating a global bipartite transaction graph including member and transaction family vertices based on the global ring signature transaction data set, and extracting the global transaction graph features of the global bipartite transaction graph; a blocking mechanism module for adjusting the ring sampler parameters according to the global transaction graph features; and a currency payment module for selecting ring signature members from a member list using the ring sampler, and generating digital currency ring signature transaction data based on the ring signature members. The system can resist de-anonymization attacks based on graph analysis, and enhances the global anonymity defense capability of digital currency transactions.

Description

Technical Field

[0001] The present disclosure relates to the field of ring signature technology, and in particular to a digital currency payment system, method, electronic device, and storage medium. Background Art

[0002] With the widespread use of digital currencies around the world, users have put forward higher requirements for their anonymity and security. Traditional anonymous cryptocurrency systems often use ring signature technology to hide the true identity of transaction participants. Although such ring signature technology protects the privacy of users to a certain extent, due to its static and transparent ring logic, it is possible to analyze the transaction graph through graph analysis technology, and to some extent, it is still possible to implement deanonymization operations on transaction participants. The main problem facing current anonymous cryptocurrencies is that the relationship between ring members can be analyzed, and the setting of the ring size may not be able to effectively resist graph-based deanonymization attacks. Even the partitioned ring sampler, although it is close to optimal in terms of local anonymity, is still not effective in global anonymity defense. Summary of the invention

[0003] In view of this, the embodiments of the present disclosure provide a digital currency payment system, method, electronic device, and storage medium.

[0004] In a first aspect, an embodiment of the present disclosure provides a digital currency payment system, including:

[0005] Data collection module, used to obtain the global ring signature transaction data set;

[0006] A feature extraction module, used to generate a global bipartite transaction graph including member and transaction family vertices according to the global ring signature transaction data set, and extract global transaction graph features of the global bipartite transaction graph;

[0007] A blocking mechanism module, used for adjusting ring sampler parameters according to the global transaction graph characteristics;

[0008] The currency payment module is used to select a ring signature member from a member list using the ring sampler, and generate digital currency ring signature transaction data according to the ring signature member.

[0009] In a possible implementation, the system further includes:

[0010] A policy optimization module is used to select a ring signature member from a member list using the ring sampler, generate ring signature transaction data test data according to the ring signature member, obtain a ring signature transaction data test set through the multiple ring signature transaction data test data, generate a test binary transaction graph according to the ring signature transaction data test set, extract a test transaction graph feature of the test binary transaction graph, and adjust the ring sampler parameters according to the test transaction graph feature.

[0011] In a possible implementation, the transaction graph features specifically include member vertex degrees, subgraph structures, and focusing coefficients.

[0012] In a possible implementation, the blocking mechanism module is further used to generate digital currency noise transaction data based on the global transaction graph features and the ring sampler, and upload the digital currency noise transaction data to the digital currency transaction network.

[0013] In a possible implementation, the system further includes:

[0014] A functional testing module, used to run the digital currency payment system, generate a work log, compare the work log with a standard log, and output a functional testing result;

[0015] The performance testing module is used to run the digital currency payment system, calculate the transaction speed and system response time of the digital currency payment system, compare the transaction speed and the system response time with the standard speed and the standard time respectively, and output the performance test results.

[0016] In a possible implementation, the system further includes:

[0017] The simulated attack module is used to simulate an attack on the digital currency payment system, output an error log, cluster the error information in the error log, and output test error information.

[0018] In a possible implementation, the system further includes:

[0019] The monitoring and verification module is used to obtain the digital currency transaction data and update the ring sampler parameters according to the digital currency transaction data.

[0020] In a second aspect, the disclosed embodiment further provides a digital currency payment method, including:

[0021] Get the global ring signature transaction dataset;

[0022] Generate a global bipartite transaction graph including member and transaction family vertices according to the global ring signature transaction data set, and extract global transaction graph features of the global bipartite transaction graph;

[0023] Adjusting ring sampler parameters according to the global transaction graph characteristics;

[0024] The ring sampler is used to select ring signature members from a member list, and digital currency ring signature transaction data is generated according to the ring signature members.

[0025] In a third aspect, the present disclosure also provides an electronic device, which adopts the following technical solution:

[0026] The electronic device comprises:

[0027] at least one processor; and,

[0028] a memory communicatively connected to the at least one processor; wherein,

[0029] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute any of the digital currency payment methods described above.

[0030] In a fourth aspect, an embodiment of the present disclosure further provides a computer-readable storage medium, which stores computer instructions, and the computer instructions are used to enable a computer to execute any of the digital currency payment methods described above.

[0031] The technical solution provided by the embodiment of the present disclosure has the following beneficial effects: a global binary transaction graph including member and transaction family vertices is generated through a global ring signature transaction data set, global transaction graph features of the global binary transaction graph are extracted, and ring sampler parameters are adjusted based on the global transaction graph features, and the ring sampler with adjusted parameters is applied to the digital currency ring signature transaction system, thereby effectively designing a digital currency ring signature transaction system with strong resistance to de-anonymization attacks. Since the ring sampler in the digital currency ring signature transaction system is adjusted based on global anonymity, it can resist attacks based on graph analysis while taking into account the efficiency of the system and the privacy protection needs of users.

[0032] The above description is only an overview of the technical solution of the present invention. In order to more clearly understand the technical means of the present invention, it can be implemented in accordance with the contents of the specification. In order to make the above and other purposes, features and advantages of the present invention more obvious and easy to understand, the following preferred embodiments are specifically cited and described in detail with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present disclosure. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0034] Figure 1 A schematic diagram of the structure of a digital currency payment system provided for an exemplary embodiment of the present disclosure;

[0035] Figure 2A flowchart of a digital currency payment method provided for an exemplary embodiment of the present disclosure;

[0036] Figure 3 A schematic diagram of the structure of an electronic device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0037] The embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.

[0038] It should be clear that the following embodiments of the present disclosure are described by specific specific examples, and those skilled in the art can easily understand other advantages and effects of the present disclosure from the contents disclosed in this specification. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, rather than all of the embodiments. The present disclosure can also be implemented or applied through other different specific embodiments, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present disclosure. It should be noted that the following embodiments and features in the embodiments can be combined with each other in the absence of conflict. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present disclosure.

[0039] It should be noted that various aspects of the embodiments within the scope of the appended claims are described below. It should be apparent that the aspects described herein may be embodied in a wide variety of forms, and any specific structure and / or function described herein is merely illustrative. Based on the present disclosure, it should be understood by those skilled in the art that an aspect described herein may be implemented independently of any other aspect, and two or more of these aspects may be combined in various ways. For example, any number of aspects described herein may be used to implement the device and / or practice the method. In addition, other structures and / or functionalities other than one or more of the aspects described herein may be used to implement this device and / or practice this method.

[0040] It should also be noted that the illustrations provided in the following embodiments are only schematic illustrations of the basic concept of the present disclosure. The illustrations only show components related to the present disclosure rather than being drawn according to the number, shape and size of components in actual implementation. In actual implementation, the form, quantity and proportion of each component may be changed arbitrarily, and the component layout may also be more complicated.

[0041] Additionally, in the following description, specific details are provided to facilitate a thorough understanding of the examples. However, it will be understood by those skilled in the art that the aspects described may be practiced without these specific details.

[0042] With the rapid development of the international financial market and the popularization of digital currency use, anonymity has become a particularly important feature of the digital currency system. Although the traditional digital currency system provides transaction anonymity to a certain extent through its blockchain technology, the publicity of its transaction records limits the thorough protection of user privacy. Therefore, in order to improve the anonymity of user transactions, ring signature technology was introduced into digital currency. Ring signature technology allows a user to anonymously execute a signature in a group of "potential signers", which makes it impossible for a third party to determine which user signed, because the signature looks like it was made by any user in the group. The introduction of this technology effectively improves the privacy of transactions and is therefore used in many anonymous cryptocurrencies.

[0043] There is an anonymity problem in the current ring signature anonymous cryptocurrency transaction system. In a typical ring signature anonymous cryptocurrency system, the signer of the transaction is hidden in a set of potential signers called a "ring", the size of which is much smaller than the number of all users. The current ring signature anonymous cryptocurrency is specified by the ring membership of the transaction set, which in turn leads to the formation of a bipartite transaction graph, the distribution of which is caused by the ring sampler under the cryptocurrency. It is known that efficient graph analysis can act on the transaction graph to potentially deanonymize the signer, so it is crucial to understand the resistance of a ring sampler and its guided transaction graph to graph analysis. In particular, the partitioned ring sampler class, although previous studies have shown that they provide almost optimal local anonymity, their resistance to global attacks, such as graph-based attacks, is still unclear.

[0044] The current ring signature technology has the following technical difficulties:

[0045] Limitations of ring signature technology: Although ring signature technology provides anonymity at the transaction level, at the global level, that is, for the entire network, ring members and their relationships may still be analyzed, thereby exposing user privacy.

[0046] Analysis of transaction graph: The transaction graph formed on the basis of ring signature can analyze the potential association relationship between users through mathematical and graphical analysis methods, which provides the possibility for deanonymization and threatens the anonymity of the entire system.

[0047] Balance between ring size and attack resistance: Correct ring size setting is crucial to ensure anonymity and system efficiency. Too small a ring will lead to a decrease in anonymity, while too large a ring will reduce system efficiency.

[0048] This leads to the following technical defects:

[0049] Shortcomings of ring samplers: Current ring samplers may not fully consider global anonymity during the sampling process and are vulnerable to deanonymization attacks based on graph analysis.

[0050] Lack of comprehensive protection: Even logarithmic ring sizes do not completely prevent deanonymization, as complex graph algorithms may discover local patterns, gradually reducing anonymity.

[0051] Therefore, a new technical solution is needed to provide a more powerful anonymous transaction defense mechanism in the digital RMB payment system to resist attacks based on graph analysis, while taking into account the efficiency of the system and the privacy protection needs of users. Based on this, the present invention ensures the anonymity of digital currency transactions by providing a digital RMB payment technology solution based on graph analysis to block anonymous transactions.

[0052] Embodiment 1

[0053] Figure 1 A digital currency payment system 100 provided as an exemplary embodiment of the present disclosure includes:

[0054] Data collection module 101, used to obtain a global ring signature transaction data set;

[0055] It should be noted that the global ring signature transaction data set is a collection of ring signature data in an anonymous cryptocurrency transaction system collected from the entire network. Ring Signature is a digital signature technology that allows the signer to include multiple possible signers (i.e., members in the "ring") in one signature without revealing which specific member signed. This feature makes ring signatures very useful in protecting transaction privacy. In terms of data acquisition, since the data set is collected from the entire network, this ensures the breadth and representativeness of the data. After collecting anonymous transaction data, the collected data can also be analyzed to analyze its transaction frequency, the characteristics of the potential signer set, etc. Analyze the frequency of ring signature transactions in the data set to understand the use and trend of this technology in the network; by analyzing the potential signer set included in the ring signature, you can understand the size, composition, and distribution of these sets in the network. Based on data analysis, you can identify the privacy content that needs to be protected, such as transaction amount, transaction type, etc. Analyze information points that may leak privacy, such as the frequency of occurrence of certain specific members in the ring signature, transaction patterns, etc., and take corresponding protection measures.

[0056] A feature extraction module 102 is used to generate a global bipartite transaction graph including member and transaction family vertices according to the global ring signature transaction data set, and extract global transaction graph features of the global bipartite transaction graph;

[0057] In this embodiment, in order to extract key information from the collected ring signature transaction data and construct a bipartite transaction graph that can reflect the ring signature member relationship, it is necessary to first construct a bipartite graph model. In the graph model, there are two types of vertices, one is the user vertex (representing possible signers) and the other is the transaction vertex (representing the ring signature transaction that occurred). If the user is one of the potential signers of a transaction (that is, the user may be a member of the ring signature), an edge is established between the user vertex and the corresponding transaction vertex. Using the collected anonymous transaction data, the potential signer set in each transaction is identified, a user vertex is created for each potential signer in the graph, and a transaction vertex is created for each transaction. According to the potential signature relationship, an edge is established between the user vertex and the transaction vertex.

[0058] After establishing a complete bipartite transaction graph, we can calculate the degree of each user vertex and transaction vertex; analyze the subgraph structure in the graph, such as connected components, dense subgraphs, etc.; calculate the clustering coefficient of user vertices or transaction vertices, etc. Through calculation, we can obtain the global transaction graph characteristics of the global bipartite transaction graph.

[0059] A blocking mechanism module 103, configured to adjust ring sampler parameters according to the global transaction graph characteristics;

[0060] In the present disclosure, the configuration parameters of the ring sampler include the size of the ring (i.e., the number of members in the ring), the degree of randomness of member selection, whether to consider certain relationships between members (such as community structure, transaction frequency, etc.), etc. The size of the ring is generally set to the logarithm of the number of users. The ring sampler is a tool for generating ring signatures. It selects members in the ring according to a certain strategy. According to the graph characteristics, a more effective ring sampler can be designed. Since the degree of each node in the bipartite graph may be different, the ring sampler algorithm can be adjusted according to the degree of the member. For example, members with lower degrees can be preferentially selected to increase the diversity and anonymity of the ring signature. When designing the ring sampler algorithm, the subgraph structure of the bipartite graph, such as matching, covering or independent sets, can be considered to select a suitable member combination to form a ring signature. For example, a group of members can be selected by finding the maximum match so that there is no edge between them, thereby improving anonymity. The focusing coefficient is an indicator of the degree of node clustering, which can be used to optimize the ring sampler algorithm. For example, members associated with nodes with higher focusing coefficients can be selected to form a ring signature, thereby increasing the anonymity of the ring signature.

[0061] The currency payment module 104 is used to select a ring signature member from a member list using the ring sampler, and generate digital currency ring signature transaction data according to the ring signature member.

[0062] In this embodiment, during the ring signature transaction of digital currency, it is first necessary to use the configured ring sampler to randomly select a certain number of members from the member list to construct a ring and generate a ring signature. The transaction initiator uses the ring signature algorithm and the selected ring members to generate a ring signature. The ring signature algorithm will use transaction information (such as transaction amount, recipient address, etc.) and the public key of the ring member to generate a signature. This signature will verify that the transaction is signed by a member in the ring, but it is impossible to determine which member it is. The generated ring signature is added to the digital currency transaction data, and the transaction data should also include other necessary information, such as the public key of the transaction initiator (for verifying the signature), the address of the recipient, the transaction amount, etc. The constructed digital currency transaction data is broadcast to the digital currency network, and other nodes in the network will verify the legitimacy of the transaction and the validity of the ring signature. If the transaction is verified to be valid, it will be added to the blockchain of the digital currency. The anonymity of the ring signature allows the initiator of the transaction to remain anonymous while ensuring the security and immutability of the transaction.

[0063] In some embodiments, the system further comprises:

[0064] A policy optimization module is used to select a ring signature member from a member list using the ring sampler, generate ring signature transaction data test data according to the ring signature member, obtain a ring signature transaction data test set through the multiple ring signature transaction data test data, generate a test binary transaction graph according to the ring signature transaction data test set, extract a test transaction graph feature of the test binary transaction graph, and adjust the ring sampler parameters according to the test transaction graph feature.

[0065] In the present disclosure, the parameter modification of the ring sampler based on the global ring signature transaction data set is only for the global ring signature data, but its security and reliability in local and actual operation have not been verified. Therefore, it is necessary to build a local or actual operating environment to verify and optimize its security and reliability. The ring sampler performance can be effectively optimized through the ring signature transaction data test set. According to the characteristics of the anonymous transaction network to be simulated, such as network scale, transaction frequency, user activity, etc., write simulation code, generate user, transaction, signature and other data, and build the corresponding transaction graph. By adjusting the parameters of the simulation environment, simulate anonymous transaction networks of different scales. For example, networks containing hundreds, thousands or tens of thousands of users can be simulated to test the performance of strategies at different scales. In each simulated network, corresponding transaction data is generated and a transaction graph is constructed. The transaction graph can intuitively show the transaction relationship and potential signature relationship between users. Implement new defense strategies in the simulation environment and observe their impact on the anonymous transaction network. This can include evaluating the anonymity protection ability of the strategy, the difficulty of deanonymization, etc. Different attack scenarios and test data sets can be used to evaluate the effectiveness of the strategy. For example, we can use known attack patterns to try to deanonymize users in the network and observe whether the strategy can successfully prevent these attacks. Similarly, we can apply new strategies to real data and compare their performance with other strategies. Based on the results of simulation experiments and empirical data analysis, we can find out the shortcomings in the strategy and make adjustments and optimizations to keep the parameters of the ring sampler reasonable.

[0066] In some embodiments, the transaction graph features specifically include member vertex degrees, subgraph structures, and focusing coefficients.

[0067] In the present disclosure, the degree of each user vertex and transaction vertex (i.e., the number of edges connected to them) can be calculated. The degree of the user vertex can reflect the frequency of its participation in transactions, while the degree of the transaction vertex can reflect the number of potential signers involved in the transaction. The subgraph structure in the analysis graph, such as connected components, dense subgraphs, etc., may reveal the transaction pattern between users or the existence of specific transaction groups. The clustering coefficient of the user vertex or transaction vertex is calculated to measure the degree of connection between its neighboring vertices. A higher clustering coefficient may indicate that the community to which the vertex belongs is closely connected, that is, there may be a strong correlation between users or transactions. Based on the extracted graph features, the anonymity of the ring signature can be evaluated. For example, by analyzing the degree distribution and clustering coefficient of the user vertex, the activity level and community structure of the potential signer can be understood, thereby evaluating its anonymity level.

[0068] Exemplarily, when the ring sampler is selecting ring members, it can give priority to members whose vertex degrees are close to the user to be signed, thereby preventing the attack target from analyzing the binary transaction graph through the vertex degrees of the members; when the ring sampler is selecting ring members, it can give priority to using maximum matching to find and select a group of members so that there are no edges between them, thereby improving anonymity; when the ring sampler is selecting ring members, it can also select members associated with nodes with higher focusing coefficients to form ring signatures, thereby reducing the possibility of itself being focused and identified.

[0069] In some embodiments, the blocking mechanism module is also used to generate digital currency noise transaction data based on the global transaction graph features and the ring sampler, and upload the digital currency noise transaction data to the digital currency transaction network.

[0070] In the present disclosure, in order to improve the anonymity of digital currency transactions, noise data, i.e., false transaction data, can be added to the global digital currency transaction network. By confusing the pattern and path of real transactions, the attack target cannot obtain valid information through the generated binary transaction graph.

[0071] In some embodiments, the system further comprises:

[0072] A functional testing module, used to run the digital currency payment system, generate a work log, compare the work log with a standard log, and output a functional testing result;

[0073] The performance testing module is used to run the digital currency payment system, calculate the transaction speed and system response time of the digital currency payment system, compare the transaction speed and the system response time with the standard speed and the standard time respectively, and output the performance test results.

[0074] In this disclosure, the digital currency payment system will also be tested for functionality and performance, using data such as work logs, transaction speeds, and system response time. The work log is used to output where errors exist in the basic functional modules. By traversing the basic modules and outputting the differences between the work logs and the standard work logs, engineers can be assisted in quickly locating functional defects. The transaction speed and system response time are performance parameters. When they are not within the preset range, you can try to increase the running rate by adjusting the ring size of the ring sampler.

[0075] For example, through a series of customized test cases, the integrity and reliability of the payment system functions are verified to ensure that all newly integrated features meet the predetermined working standards. Comprehensive evaluation of the system's performance, including transaction speed, system response time and the ability to handle large-scale transactions, to ensure that the performance meets the actual application requirements. Comprehensive security assessment, including resistance to various types of network attacks, system vulnerability scanning and data protection assessment, to ensure the security of the system and the safety of user funds.

[0076] In some embodiments, the system further comprises:

[0077] The simulated attack module is used to simulate an attack on the digital currency payment system, output an error log, cluster the error information in the error log, and output test error information.

[0078] In this embodiment, in order to test the stability of the digital currency payment system after embedding the graphic analysis blocking mechanism, it is necessary to test and optimize the digital currency payment system, through external simulated attacks, while monitoring the error log of the digital currency payment system, clustering the error information in the error log, thereby assisting engineers to quickly locate system anomalies.

[0079] For example, based on a comprehensive test plan, a series of system tests including functionality, performance and security are performed. These tests should simulate various transaction and attack scenarios to verify the stability and defense capabilities of the payment system. During the test process, carefully record and analyze all problems and anomalies that occur, classify the problems, and quickly locate the causes of the problems and develop corresponding solutions. Adjust the system design and optimize performance parameters based on test feedback to improve system reliability and user experience. In the process of integrating feedback, ensure that updates to the system do not introduce new problems.

[0080] In some embodiments, the system further comprises:

[0081] The monitoring and verification module is used to obtain the digital currency transaction data and update the ring sampler parameters according to the digital currency transaction data.

[0082] In the present disclosure, the digital currency payment system will also be continuously monitored and optimized during operation, so that the ring sampler can adaptively adjust its own performance parameters according to the current data situation in the digital currency transaction network.

[0083] For example, a series of rigorous security testing procedures are designed and implemented to verify whether the payment system can resist advanced persistent threats and the best known attack methods. By applying advanced data analysis technology and graphic analysis methods, the anonymity in the payment system is evaluated to ensure that the user's identity security is not leaked by de-anonymization attacks. After the payment system is put into operation, it will continue to be monitored to detect and respond to new threats in a timely manner, and adjust and optimize the system based on the monitoring results to maintain the long-term security and efficiency of the system.

[0084] In some embodiments, a model verification module is also included. The model verification module verifies the established bipartite graph model to check whether it can effectively reflect the actual ring signature transaction process and make necessary adjustments and optimizations.

[0085] In this disclosure, the model verification module mainly performs structural verification, logical verification, and statistical verification. Check whether the structure of the bipartite graph model is reasonable, and ensure that the edges between the user vertex and the transaction vertex can correctly reflect the actual potential signature relationship; verify whether the logic in the model is correct, whether the degree of the user vertex is consistent with the number of transactions it actually participates in, whether the degree of the transaction vertex is consistent with the number of potential signers involved, etc.; calculate the matching rate between the potential signers predicted by the model and the actual signers, or analyze the correlation between the transaction frequency predicted by the model and the actual transaction frequency. According to the verification results, modify the model structure, adjust the parameter settings, introduce new features or methods, etc.

[0086] Embodiment 2

[0087] Figure 2 A flowchart of a digital currency payment method provided in an embodiment of the present disclosure, wherein the digital currency payment method comprises steps S101 to S104.

[0088] S101. Obtain a global ring signature transaction data set;

[0089] S102: Generate a global bipartite transaction graph including member and transaction family vertices according to the global ring signature transaction data set, and extract global transaction graph features of the global bipartite transaction graph;

[0090] S103, adjusting ring sampler parameters according to the global transaction graph characteristics;

[0091] S104. Select a ring signature member from a member list using the ring sampler, and generate digital currency ring signature transaction data according to the ring signature member.

[0092] In some embodiments, the digital currency payment method further includes:

[0093] The ring sampler is used to select a ring signature member from a member list, generate ring signature transaction data test data according to the ring signature member, obtain a ring signature transaction data test set through the multiple ring signature transaction data test data, generate a test binary transaction graph according to the ring signature transaction data test set, extract a test transaction graph feature of the test binary transaction graph, and adjust the ring sampler parameters according to the test transaction graph feature.

[0094] In some embodiments, the transaction graph features specifically include member vertex degrees, subgraph structures, and focusing coefficients.

[0095] In some embodiments, the digital currency payment method further includes:

[0096] Based on the global transaction graph features and the ring sampler, digital currency noise transaction data is generated, and the digital currency noise transaction data is uploaded to the digital currency transaction network.

[0097] In some embodiments, the digital currency payment method further includes:

[0098] Run the digital currency payment system and generate a work log, compare the work log with the standard log, and output the function test result;

[0099] Run the digital currency payment system, calculate the transaction speed and system response time of the digital currency payment system, compare the transaction speed and the system response time with the standard speed and the standard time respectively, and output the performance test results.

[0100] In some embodiments, the digital currency payment method further includes:

[0101] A simulated attack is performed on the digital currency payment system, an error log is output, error information in the error log is clustered, and test error information is output.

[0102] In some embodiments, the digital currency payment method further includes:

[0103] The digital currency transaction data is obtained, and the ring sampler parameters are updated according to the digital currency transaction data.

[0104] The method of the embodiments of the present disclosure is executed on the digital currency payment system, and its implementation principle is similar. The steps in the methods of the embodiments of the present disclosure correspond to the actions performed by the modules in the systems of the embodiments. For the detailed functional description of the steps in the methods, please refer to the description in the corresponding system shown in the previous text, which will not be repeated here.

[0105] Embodiment 3

[0106] The electronic device according to an embodiment of the present disclosure includes a memory and a processor. The memory is used to store non-temporary computer-readable instructions. Specifically, the memory may include one or more computer program products, and the computer program product may include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. The volatile memory may, for example, include a random access memory (RAM) and / or a cache memory (cache), etc. The non-volatile memory may, for example, include a read-only memory (ROM), a hard disk, a flash memory, etc.

[0107] The processor may be a central processing unit (CPU) or other forms of processing units with data processing capabilities and / or instruction execution capabilities, and may control other components in the electronic device to perform desired functions. In one embodiment of the present disclosure, the processor is used to run the computer-readable instructions stored in the memory, so that the electronic device executes all or part of the steps of the digital currency payment method of each embodiment of the present disclosure.

[0108] Those skilled in the art should be able to understand that in order to solve the technical problem of how to obtain a good user experience, the present embodiment may also include well-known structures such as a communication bus and an interface, and these well-known structures should also be included in the protection scope of the present disclosure.

[0109] like Figure 3 The present invention provides a schematic diagram of the structure of an electronic device according to an embodiment of the present invention, which is suitable for implementing the electronic device in the embodiment of the present invention. Figure 3 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0110] like Figure 3 As shown, the electronic device may include a processor (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) or a program loaded from a storage device into a random access memory (RAM). In the RAM, various programs and data required for the operation of the electronic device are also stored. The processor, ROM, and RAM are connected to each other via a bus. An input / output (I / O) interface is also connected to the bus.

[0111] Typically, the following devices can be connected to the I / O interface: input devices such as sensors or visual information acquisition devices; output devices such as display screens; storage devices such as magnetic tapes and hard disks; and communication devices. The communication device can allow the electronic device to communicate with other devices (such as edge computing devices) wirelessly or by wire to exchange data. Figure 3An electronic device having various devices is shown, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead.

[0112] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a non-transient computer-readable medium, and the computer program contains a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device, or installed from a ROM. When the computer program is executed by a processor, all or part of the steps of the digital currency payment method of the embodiment of the present disclosure are executed.

[0113] For detailed description of this embodiment, reference may be made to the corresponding descriptions in the aforementioned embodiments, which will not be repeated here.

[0114] According to the computer-readable storage medium of the embodiment of the present disclosure, non-transitory computer-readable instructions are stored thereon. When the non-transitory computer-readable instructions are executed by the processor, all or part of the steps of the digital currency payment method of each embodiment of the present disclosure are executed.

[0115] The above-mentioned computer-readable storage media include, but are not limited to: optical storage media (e.g., CD-ROM and DVD), magneto-optical storage media (e.g., MO), magnetic storage media (e.g., magnetic tape or mobile hard disk), media with built-in rewritable non-volatile memory (e.g., memory card) and media with built-in ROM (e.g., ROM box).

[0116] For detailed description of this embodiment, reference may be made to the corresponding descriptions in the aforementioned embodiments, which will not be repeated here.

[0117] The basic principles of the present disclosure are described above in conjunction with specific embodiments. However, it should be noted that the advantages, strengths, effects, etc. mentioned in the present disclosure are only examples and not limitations, and it cannot be considered that these advantages, strengths, effects, etc. must be possessed by each embodiment of the present disclosure. In addition, the specific details disclosed above are only for the purpose of illustration and ease of understanding, and are not limiting. The above details do not limit the present disclosure to be implemented by adopting the above specific details.

[0118] In the present disclosure, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply that there is any such actual relationship or order between these entities or operations. The block diagrams of the devices, devices, equipment, and systems involved in the present disclosure are only illustrative examples and are not intended to require or imply that they must be connected, arranged, and configured in the manner shown in the block diagram. As will be appreciated by those skilled in the art, these devices, devices, equipment, and systems can be connected, arranged, and configured in any manner. Words such as "including", "comprising", "having", etc. are open words, referring to "including but not limited to", and can be used interchangeably with them. The words "or" and "and" used here refer to the words "and / or" and can be used interchangeably with them, unless the context clearly indicates otherwise. The word "such as" used here refers to the phrase "such as but not limited to", and can be used interchangeably with it.

[0119] Additionally, as used herein, "or" used in a list of items beginning with "at least one" indicates a separate list, so that, for example, a list of "at least one of A, B, or C" means A or B or C, or AB or AC or BC, or ABC (i.e., A and B and C). Furthermore, the word "exemplary" does not mean that the example described is preferred or better than other examples.

[0120] It should also be noted that in the system and method of the present disclosure, each component or each step can be decomposed and / or recombined. Such decomposition and / or recombination should be regarded as equivalent solutions of the present disclosure.

[0121] Various changes, substitutions, and modifications of the techniques described herein may be made without departing from the teachings defined by the appended claims. Furthermore, the scope of the claims of the present disclosure is not limited to the specific aspects of the processes, machines, manufactures, compositions of events, means, methods, and actions described above. Currently existing or later to be developed processes, machines, manufactures, compositions of events, means, methods, or actions that perform substantially the same functions or achieve substantially the same results as the corresponding aspects described herein may be utilized. Thus, the appended claims include such processes, machines, manufactures, compositions of events, means, methods, or actions within their scope.

[0122] The above description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects without departing from the scope of the present disclosure. Therefore, the present disclosure is not intended to be limited to the aspects shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.

[0123] The above description has been given for the purpose of illustration and description. In addition, this description is not intended to limit the embodiments of the present disclosure to the forms disclosed herein. Although multiple example aspects and embodiments have been discussed above, those skilled in the art will recognize certain variations, modifications, changes, additions and sub-combinations thereof.

Claims

1. A digital currency payment system, characterized in that: include: Data collection module, used to obtain the global ring signature transaction data set; A feature extraction module is used to generate a global bipartite transaction graph including two family vertices, member and transaction, according to the global ring signature transaction data set, and extract global transaction graph features of the global bipartite transaction graph, wherein the global transaction graph features specifically include member vertex degree, subgraph structure and clustering coefficient, and the member vertex degree is the degree of each user vertex and transaction vertex; A blocking mechanism module, used for adjusting ring sampler parameters according to the global transaction graph characteristics; The currency payment module is used to select a ring signature member from a member list using the ring sampler, and generate digital currency ring signature transaction data according to the ring signature member.

2. The digital currency payment system according to claim 1, characterized in that: The system further comprises: A strategy optimization module is used to select a ring signature member from a member list using the ring sampler, generate ring signature transaction data test data according to the ring signature member, obtain a ring signature transaction data test set through a plurality of the ring signature transaction data test data, generate a test binary transaction graph according to the ring signature transaction data test set, extract a test transaction graph feature of the test binary transaction graph, and adjust the ring sampler parameters according to the test transaction graph feature.

3. The digital currency payment system according to claim 1, characterized in that: The blocking mechanism module is also used to generate digital currency noise transaction data based on the global transaction graph features and the ring sampler, and upload the digital currency noise transaction data to the digital currency transaction network.

4. The digital currency payment system according to claim 1, characterized in that: The system further comprises: A functional testing module, used to run the digital currency payment system, generate a work log, compare the work log with a standard log, and output a functional testing result; The performance testing module is used to run the digital currency payment system, calculate the transaction speed and system response time of the digital currency payment system, compare the transaction speed and the system response time with the standard speed and the standard time respectively, and output the performance test results.

5. The digital currency payment system according to claim 1, characterized in that: The system further comprises: The simulated attack module is used to simulate an attack on the digital currency payment system, output an error log, cluster the error information in the error log, and output test error information.

6. The digital currency payment system according to claim 1, characterized in that: The system further comprises: The monitoring and verification module is used to obtain digital currency transaction data and update the ring sampler parameters according to the digital currency transaction data.

7. A digital currency payment method, characterized in that: include: Get the global ring signature transaction dataset; Generate a global bipartite transaction graph including two family vertices, member and transaction, according to the global ring signature transaction data set, and extract global transaction graph features of the global bipartite transaction graph, wherein the global transaction graph features specifically include member vertex degree, subgraph structure, and clustering coefficient, and the member vertex degree is the degree of each user vertex and transaction vertex; Adjusting ring sampler parameters according to the global transaction graph characteristics; The ring sampler is used to select ring signature members from a member list, and digital currency ring signature transaction data is generated according to the ring signature members.

8. An electronic device, characterized in that: The electronic device comprises: at least one processor; and, a memory communicatively connected to the at least one processor; wherein, The memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the digital currency payment method described in claim 7.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, which are used to enable a computer to execute the digital currency payment method described in claim 7.

Images