CN112132562B - Block chain-based expense payment method and expense payment platform - Google Patents
Block chain-based expense payment method and expense payment platform Download PDFInfo
- Publication number
- CN112132562B CN112132562B CN202011067013.2A CN202011067013A CN112132562B CN 112132562 B CN112132562 B CN 112132562B CN 202011067013 A CN202011067013 A CN 202011067013A CN 112132562 B CN112132562 B CN 112132562B
- Authority
- CN
- China
- Prior art keywords
- target
- dimensional code
- identification information
- code identification
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/04—Payment circuits
- G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
- G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/30—Payment architectures, schemes or protocols characterised by the use of specific devices or networks
- G06Q20/32—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using wireless devices
- G06Q20/327—Short range or proximity payments by means of M-devices
- G06Q20/3274—Short range or proximity payments by means of M-devices using a pictured code, e.g. barcode or QR-code, being displayed on the M-device
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Abstract
The application provides a block chain-based expense payment method and an expense payment platform, and relates to the technical field of block chains. In the application, first request information is sent to a target block chain system; secondly, acquiring target two-dimensional code identification information sent by a target block chain system based on first request information, and converting target account information of the expense payment platform on a target financial platform based on the target two-dimensional code identification information to generate a corresponding target two-dimensional code image; then, performing first identification processing on a target two-dimensional code image based on preset two-dimensional code identification information to obtain target two-dimensional code identification information of the target two-dimensional code image; and sending the identification information of the target two-dimensional code to a target block chain system; and finally, displaying the target two-dimensional code image on a fee collection platform. By the method, the problem of low safety in the existing expense payment technology can be solved.
Description
Technical Field
The application relates to the technical field of block chains, in particular to a block chain-based expense payment method and an expense payment platform.
Background
With the continuous development of internet technology, the application range of the internet technology is continuously expanded. For example, in order to improve convenience of payment, online payment may be performed in the form of a two-dimensional code instead of cash payment. However, the inventor researches and discovers that the online payment method based on the two-dimensional code in the prior art has the problem of low security of payment.
Disclosure of Invention
In view of the above, an object of the present invention is to provide a block chain-based fee payment method and a fee payment platform, so as to solve the problem of low security in the existing fee payment technology.
In order to achieve the above purpose, the embodiment of the present application adopts the following technical solutions:
a block chain based expense payment method is applied to an expense payment platform, the expense payment platform is in communication connection with a target block chain system, and the method comprises the following steps:
sending first request information to the target block chain system, wherein the target block chain system is used for determining one piece of two-dimensional code identification information from a plurality of pieces of stored two-dimensional code identification information based on the first request information to serve as target two-dimensional code identification information;
acquiring the target two-dimensional code identification information sent by the target block chain system based on the first request information, and converting the target account information of the expense payment platform on a target financial platform based on the target two-dimensional code identification information to generate a corresponding target two-dimensional code image;
performing first identification processing on the target two-dimensional code image based on preset two-dimensional code identification information to obtain target two-dimensional code identification information of the target two-dimensional code image, wherein the preset two-dimensional code identification information is different from the target two-dimensional code identification information;
sending the target two-dimensional code identification information to the target block chain system, wherein the target block chain system is used for associating the target two-dimensional code identification information with the target two-dimensional code identification information and storing the generated association relation;
and displaying the target two-dimensional code image to a fee collection platform, wherein the fee collection platform is used for carrying out second identification processing on the target two-dimensional code image based on the preset two-dimensional code identification information to obtain target two-dimensional code identification information, obtaining the target two-dimensional code identification information through the incidence relation in the target block chain system based on the target two-dimensional code identification information, carrying out third identification processing on the target two-dimensional code image according to the target two-dimensional code identification information to obtain target account information, and requesting the target financial platform to carry out fee payment processing based on the target account information.
On the basis, the embodiment of the present application further provides an expense processing financial platform, including:
a memory for storing a computer program;
a processor coupled to the memory for executing the computer program stored in the memory to implement the above block chain based fare payment method.
The utility model provides a block chain-based expense payment method and platform, through sending first request information to the target block chain system to obtain the target two-dimensional code identification information, so that the target two-dimensional code image can be generated based on the target two-dimensional code identification information, then, the target two-dimensional code image is identified based on the preset two-dimensional code identification information to obtain the target two-dimensional code identification information and sent to the target block system, so as to manage the target two-dimensional code identification information, thereby the expense collection platform can obtain the associated target two-dimensional code identification information from the target block chain system based on the target two-dimensional code identification information after identifying the target two-dimensional code image based on the preset two-dimensional code identification information to obtain the target two-dimensional code identification information, and then identify the target two-dimensional code image based on the target two-dimensional code identification information, and obtaining the target account information, and requesting the target financial platform to carry out fee payment processing based on the target account information so as to realize fee payment and collection. Therefore, the complexity of generating and identifying the two-dimensional code can be improved, the safety of the generating process and the identifying process is higher, the problem of lower safety in the existing expense payment technology is solved, and the method has higher practical value.
In order to make the aforementioned objects, features and advantages of the present application more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
Fig. 1 is a system block diagram of an expense processing system according to an embodiment of the present application.
Fig. 2 is a flowchart illustrating steps included in a block chain-based fee charging method according to an embodiment of the present invention.
Fig. 3 is a schematic diagram of obtaining a target track based on a to-be-processed track according to an embodiment of the present application.
Fig. 4 is a schematic diagram of a segmentation process performed on a target track according to an embodiment of the present application.
Icon: 100-a fee payment platform; 200-a fee collection platform; 300-target blockchain system.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all the embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations.
Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
As shown in fig. 1, the present application provides an expense processing system. The fee processing system includes, among other things, a fee payment platform 100, a fee collection platform 200, and a target blockchain system 300.
In detail, the fee payment platform 100 and the fee collection platform 200 may be communicatively connected to the target blockchain system 300, respectively. Also, the fee collection platform 200 may be communicatively coupled to a target financial platform.
Alternatively, the fee payment platform 100 and the fee collection platform 200 may include, but are not limited to, a mobile phone, a computer, a tablet computer, and other terminal devices with data processing capabilities. The target blockchain system 300 may include a plurality of blockchain link point devices.
The embodiment of the present application further provides a fee payment platform 100, which can be applied to the fee processing system. Wherein the payment platform 100 may include a memory and a processor.
In detail, the memory and the processor are electrically connected directly or indirectly to realize data transmission or interaction. For example, they may be electrically connected to each other via one or more communication buses or signal lines. The memory may have stored therein at least one software function, which may be in the form of software or firmware. The processor may be configured to execute executable computer programs stored in the memory, such as the software functional modules, so as to implement the block chain-based fee payment method provided by the embodiment of the present application (described later).
Alternatively, the Memory may be, but is not limited to, a Random Access Memory (RAM), a Read Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Read-Only Memory (EPROM), an electrically Erasable Read-Only Memory (EEPROM), and the like.
The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), a System on Chip (SoC), and the like; but may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components.
With reference to fig. 2, an embodiment of the present application further provides a block chain-based fee payment method, which can be applied to the fee payment platform 100. Wherein the method steps defined by the procedures associated with the blockchain-based fare payment method may be implemented by the fare payment platform 100.
The specific process shown in FIG. 2 will be described in detail below.
In step S110, first request information is sent to the target blockchain system 300.
In this embodiment, when payment is required based on the two-dimensional code, the fee payment platform 100 may send the first request message to the target blockchain system 300 (which may be a blockchain node device for management in the target blockchain system 300) connected in communication.
The target block chain system 300 may be configured to determine one two-dimension code identification information from the stored two-dimension code identification information based on the first request information, as the target two-dimension code identification information.
Step S120, acquiring the target two-dimensional code identification information sent by the target block chain system 300 based on the first request information, and performing conversion processing on the target account information of the expense payment platform 100 on the target financial platform based on the target two-dimensional code identification information to generate a corresponding target two-dimensional code image.
In this embodiment, after the first request message is sent based on step S110, the fee payment platform 100 may obtain the target two-dimensional code identification information sent by the target blockchain system 300 based on the first request message, and then, may perform conversion processing on the target account information (pre-registered and generated) of the target user of the fee payment platform 100 on the target financial platform based on the target two-dimensional code identification information, so that a corresponding target two-dimensional code image may be generated.
That is, the target account information may be obtained by identifying the target two-dimensional code image based on the target two-dimensional code identification information.
Step S130, performing a first identification process on the target two-dimensional code image based on preset two-dimensional code identification information, to obtain target two-dimensional code identification information of the target two-dimensional code image.
In this embodiment, after the target two-dimensional code image is generated based on step S120, the payment platform 100 may perform a first identification process on the target two-dimensional code image based on preset two-dimensional code identification information, so that the target two-dimensional code identification information of the target two-dimensional code image may be obtained.
The preset two-dimensional code identification information is different from the target two-dimensional code identification information, so that the target two-dimensional code image is identified based on the preset two-dimensional code identification information and the target two-dimensional code identification information respectively, and different target two-dimensional code identification information and different target account information can be obtained respectively.
Step S140, sending the target two-dimensional code identification information to the target block chain system 300.
In this embodiment, after obtaining the target two-dimensional code identification information based on step S130, the payment platform 100 may send the target two-dimensional code identification information to the target block chain system 300 for identifying the target two-dimensional code identification information.
The target block chain system 300 is configured to associate the target two-dimensional code identification information with the target two-dimensional code identification information, and store the generated association relationship.
Step S150, displaying the target two-dimensional code image to the fee collection platform 200.
In this embodiment, after transmitting the target two-dimensional code identification information based on step S140, the fee payment platform 100 may display the target two-dimensional code image to the fee collection platform 200.
The fee collection platform 200 is configured to perform a second recognition process on the target two-dimensional code image based on the preset two-dimensional code identification information to obtain target two-dimensional code identification information, obtain target two-dimensional code identification information in the target block chain system 300 through the association relationship based on the target two-dimensional code identification information, perform a third recognition process on the target two-dimensional code image according to the target two-dimensional code identification information to obtain target account information, and request the target financial platform to perform fee payment processing based on the target account information.
Based on the method, the complexity of generating and identifying the two-dimensional code can be improved, so that the safety of the generating process and the identifying process is higher, for example, the fee collection platform 200 needs to identify twice based on different identification information to obtain different information for different processing, and the target two-dimensional code identification information is dynamically acquired from the target block chain system 300, so that the difficulty of interception is increased, and the problem of lower safety in the existing fee payment technology can be effectively improved.
In the first aspect, it should be noted that, in step S110, a specific manner of sending the first request information to the target blockchain system 300 is not limited, and may be selected according to an actual application requirement.
In a first example, step S110 may include sub-steps 11-19.
The substep 11 of obtaining a plurality of first time information, where the first time information includes current time information of a current time (for example, a time when a target user operates the fee payment platform 100 when needing to pay by a two-dimensional code) and historical time information of a time when historical first request information is sent to the target block chain system 300 (may be time information of a time when the historical first request information is sent, or may be a time when the target user operates the fee payment platform 100 when needing to pay by a two-dimensional code), and the historical time information is a plurality of.
And a substep 12, calculating a time association degree between every two adjacent first time information in the plurality of first time information, wherein the time association degree is an inverse number of a ratio between a time interval between two adjacent first time information and an ordering value of a next first time information in the plurality of first time information (the end point of the current time information, namely the ordering value of the current time information is the largest, and the ordering value of a historical time information adjacent to the current time information is the second largest).
In step 13, with the current time information as a starting point, sequentially determining whether the time association degree between two adjacent first time information is smaller than a preset association degree.
And a substep 14, determining, when it is determined that the time association degree is smaller than the preset association degree for the first time, the next first time information in the two adjacent first time information corresponding to the time association degree and each first time information after the first time information (i.e. all first time information from the next first time information to the current time information) as the target first time information.
And a substep 15 of calculating a time interval between every two adjacent target first time information among the plurality of target first time information, and determining two target first time information having the smallest time interval.
And a substep 16, combining the two pieces of target first time information and the current time information in chronological order to obtain target combination information (for example, the two pieces of target first time information are 20 minutes and 40 seconds at 12 at 09 month and 10 days at 2020, 20 minutes and 20 seconds at 12 at 10 days at 09 month and 10 days at 2020, 40 minutes and 20 seconds at 18 days at 09 month and 10 days at 2020, the current time information is 22 minutes and 10 seconds at 11 days at 09 month and 11 days at 2020, and the target combination information may be 202009101220402020091018402020200911112210).
And a sub-step 17 of performing binary conversion processing on the target combination information to obtain a corresponding binary data set (for example, in the above example, the first information is 2, the corresponding binary data may be 10, the second information is 0, and the corresponding binary data may be 0).
A substep 18 of generating a first request information comprising said binary data set.
Substep 19, sending the first request information to a target block chain system 300, wherein the target block chain system 300 is configured to generate new two-dimensional code identification information based on the binary data set in the first request information, and use the two-dimensional code identification information generated based on the binary data set in the historical first request information obtained last time as target two-dimensional code identification information, and a data bit of 1 in the binary data set indicates that a corresponding two-dimensional code symbol is valid and a two-dimensional code symbol corresponding to a data bit of 0 is invalid (that is, a two-dimensional code symbol of the target two-dimensional code image can be identified according to a preset path, a first bit of data in the binary data set is 1, indicates that a first two-dimensional code symbol (for example, one two-dimensional code symbol at the lower right corner) on the preset path is valid, and a second bit of data in the binary data set is 0, and the second two-dimensional code element on the preset path is invalid, and the like, so that the safety of the two-dimensional code can be improved on the one hand, and the multi-bit data included in the binary data group can be fully utilized on the other hand by setting the invalid bit of the two-dimensional code element).
In a second example, step S110 may comprise sub-steps 21-29.
The substep 21 of obtaining a plurality of first time information, where the first time information includes current time information at a current time and historical time information at a time when historical first request information is sent to the target blockchain system 300 historically, and the plurality of historical time information are obtained.
And a substep 22, calculating a time association degree between every two adjacent first time information in the plurality of first time information, wherein the time association degree is an inverse number of a ratio between a time interval between two adjacent first time information and an ordering value of the latter first time information in the plurality of first time information.
And a substep 23, taking the current time information as a starting point, and sequentially judging whether the time association degree between two adjacent first time information is smaller than a preset association degree.
And a substep 24, determining the last one of the two adjacent first time information corresponding to the time association degree and each of the first time information after the first time information as the target first time information when the time association degree is judged to be smaller than the preset association degree for the first time.
And a substep 25 of calculating a time interval between every two adjacent pieces of the target first time information among the plurality of pieces of target first time information, and determining two pieces of target first time information having a minimum time interval.
And a substep 26, combining the latter one of the two pieces of target first time information with the current time information according to a chronological order to obtain target combination information (for example, the two pieces of target first time information are 20 minutes and 40 seconds at 12 at 09 month 10 and 2020, 40 minutes and 20 seconds at 18 at 09 month 10 and 2020, the current time information is 22 minutes and 10 seconds at 11 at 09 month 11 and 2020, and the target combination information may be 2020091018402020200911112210).
And a sub-step 17 of performing binary conversion processing on the target combination information to obtain a corresponding binary data set (for example, in the above example, the first information is 2, the corresponding binary data may be 10, the second information is 0, and the corresponding binary data may be 0).
And a substep 27 of performing binary conversion processing on the target combination information to obtain a corresponding binary data group.
A substep 28 of generating a first request information comprising said binary data set.
Substep 29, sending the first request information to a target block chain system 300, wherein the target block chain system 300 is configured to generate new two-dimensional code identification information based on the binary data set in the first request information, and use the two-dimensional code identification information generated based on the binary data set in the historical first request information obtained last time as the target two-dimensional code identification information, and a data bit of 1 in the binary data set indicates that the corresponding two-dimensional code symbol is black, is mapped to 1, and is mapped to white, and a data bit of 1 in the binary data set indicates that the corresponding two-dimensional code symbol is black, is mapped to 0, and is mapped to white, is mapped to 1 (that is, the two-dimensional code symbol of the target two-dimensional code image can be identified according to a preset path, the first bit data in the binary data set is 1, and if the first two-dimensional code element is black, the first two-dimensional code element can be identified as 1, and if the first two-dimensional code element is white, the first two-dimensional code element can be identified as 0, and if the first two-dimensional code element is black, the second two-dimensional code element can be identified as 0, and if the second two-dimensional code element is white, the second two-dimensional code element can be identified as 1, and so on, on the preset path, so that on one hand, the security of the two-dimensional code can be improved through the setting of different mapping rules, and on the other hand, the multi-bit data included in the binary data group can be effectively utilized).
In a third example, step S110 may include substeps 30-39.
And a substep 30 of generating a trajectory to be processed based on a sliding operation of the target user on the display screen of the payment platform 100, wherein the trajectory length of the trajectory to be processed is greater than a preset length.
And a substep 31, performing curve segment searching and identification processing on the trajectory to be processed, and determining whether at least one curve segment exists in the trajectory to be processed.
And a substep 32, if at least one curve segment exists in the trajectory to be processed, determining two end point positions of the curve segment of each segment.
And a substep 33, performing straight-line segment connection processing on each curve segment based on two end point positions of the curve segment to obtain a straight-line segment corresponding to the curve segment.
A substep 34, performing replacement processing on each curve segment in the trajectory to be processed through a corresponding straight-line segment, to obtain a target trajectory including at least one straight-line segment (as shown in fig. 3).
And a substep 35 of performing segmentation processing on the target trajectory based on a preset segment segmentation method to obtain at least one segment of target segment, wherein the segment segmentation method includes a preset segmentation length (as shown in fig. 4, the length of each segment of target segment (e.g., target segments 1-5) may be the preset segmentation length, but the length of the last segment of target segment may not be the preset segmentation length, and if the length of the target segment 6 is smaller than the preset segmentation length).
A substep 36, for each of the target line segments, determining identification information of the target line segment based on whether the target line segment belongs to a target straight line segment (e.g. target line segments 1, 3, 5 and 6 in fig. 4) or a target broken line segment (e.g. target line segments 2 and 4 in fig. 4).
And a substep 37, sequentially mapping each target line segment according to the position relationship of each target line segment in the target track and according to the identification information of each target line segment, to obtain a binary data set, where if the target line segment is a target straight line segment, the corresponding binary data is 1, and if the target line segment is a target broken line segment, the corresponding binary data is 0 (thus, based on the foregoing example, the obtained binary data set may be 101011).
A substep 38 of generating a first request information comprising said binary data set.
And a substep 39 of sending the first request information to a target block chain system 300, wherein the target block chain system 300 is configured to generate new two-dimensional code identification information based on the binary data set in the first request information, and use the two-dimensional code identification information generated based on the binary data set in the historical first request information obtained last time as the target two-dimensional code identification information, and a data bit of 1 in the binary data set indicates that the corresponding two-dimensional code symbol is mapped to 1 when black and is mapped to 0 when white, and a data bit of 0 in the binary data set indicates that the corresponding two-dimensional code symbol is mapped to 0 when black and is mapped to 1 when white.
In a fourth example, step S110 may include sub-steps 40-49.
And a substep 40 of generating a sliding operation prompt message and displaying the sliding operation prompt message through a display screen of the fee payment platform 100, wherein the sliding operation prompt message is used for prompting the target user that a corresponding track does not include a curve segment (for example, prompting the target user not to slide out of a curve track) when the target user performs a sliding operation.
And a substep 41, generating a track to be processed in response to the sliding operation of the target user on the display screen based on the sliding operation prompt information.
And a substep 42 of determining whether the track length of the track to be processed is greater than a preset length.
And a substep 43, if the trajectory length of the trajectory to be processed is less than or equal to the preset length, generating and displaying a re-operation prompt message (for example, "please slide again") to prompt the target user to perform a sliding operation on the display screen again until the trajectory length of the generated new trajectory to be processed is greater than the preset length.
And a substep 44, determining the trajectory to be processed as a target trajectory if the trajectory length of the trajectory to be processed is greater than the preset length.
And a substep 45, performing segmentation processing on the target track based on a preset segment segmentation method to obtain at least one segment of target segment, wherein the segment segmentation method comprises a preset segmentation length.
And a substep 46 of, for each of the target line segments, determining identification information of the target line segment based on whether the target line segment belongs to the target curve segment.
And a substep 47, sequentially mapping each target line segment according to the position relationship of the target line segment in the target track and the identification information of each target line segment to obtain a binary data set, wherein if the target line segment is not the target curve segment, the corresponding binary data is 1, and if the target line segment is the target curve segment, the corresponding binary data is 0.
Substep 48, generating a first request message comprising said binary data set.
Sub-step 49 of sending said first request message to the target blockchain system 300, wherein, the target blockchain system 300 is configured to generate new two-dimension code identification information based on the binary data set in the first request message, and two-dimensional code identification information generated based on the binary data group in the history first request information acquired last time is taken as target two-dimensional code identification information, and the data bit of 1 in the binary data group indicates that the corresponding two-dimensional code element is valid, and the two-dimensional code element corresponding to the data bit of 0 is invalid (because the user has been prompted not to slide out of the curve track, the number of curve segments in the target track will be smaller, so that a smaller number of target curve segments can be mapped to 0 to represent that the two-dimensional code element at the corresponding position is invalid, thereby avoiding that too many two-dimensional code elements are wasted due to invalidation).
In the above example, considering that it is necessary to determine whether the target line segment belongs to the target curve segment when performing sub-step 46, the block chain based fee payment method further includes the following steps:
firstly, aiming at each section of the target line segment, comparing the target line segment with a preset target curve segment to obtain a comparison result; and a second step of determining whether the target line segment belongs to the target curve segment based on the comparison result.
Optionally, in the above example, the specific manner of performing the comparison processing based on the first step is not limited, and may be selected according to the actual application requirement.
For example, in an alternative example, the comparison process may be based on:
firstly, determining whether each target line segment belongs to a straight line segment or a broken line segment (because the straight line segment and the broken line segment can be identified more simply, whether the target line segment belongs to straightness or the broken line segment can be determined firstly);
secondly, if the target line segment does not belong to a straight line segment and does not belong to a broken line segment, calculating first curvature information of the target line segment;
and then, determining the magnitude relation between the first curvature information and second curvature information of a preset target curve segment (namely, obtaining the comparison result), wherein if the magnitude relation is that the first curvature information is larger than the second curvature information, the target curve segment belongs to the target curve segment, and if the magnitude relation is that the first curvature information is smaller than or equal to the second curvature information, the target curve segment does not belong to the target curve segment.
For another example, in an alternative example, the comparison process may be performed based on:
firstly, for each section of the target line segment, performing feature point sampling processing on the target line segment to obtain a plurality of first feature points (which may be starting points which are end points and then performing equidistant sampling) corresponding to the target line segment, and forming a first feature point set;
secondly, performing characteristic point sampling processing on a preset target curve segment to obtain a plurality of second characteristic points (which can be starting points with end points and then performing equidistant sampling) corresponding to the target curve segment to form a second characteristic point set;
then, for each first feature point set, calculating a first distance between each first feature point in the first feature point set and a corresponding second feature point in the second feature point set (in this example, the target line segment has the same length as the target curve segment, and the sampled first feature point and second feature point have the same manner, so that the midpoint of the target line segment and the midpoint of the target curve segment may be overlapped to form a tangent relationship, and the bending directions are the same, or the outward convex directions are the same, or the inward concave directions are the same, and then, the first feature point and the second feature point may have a corresponding relationship, for example, the first feature point obtained by the first sampling and the second feature point obtained by the first sampling have a corresponding relationship, so as to calculate a corresponding first distance);
then, for each first feature point set, determining a preset number of first feature points with the maximum first distance in the first feature point set to obtain target first feature points corresponding to the first feature point set;
calculating a distance mean value of a first distance between each target first feature point corresponding to each first feature point set and a corresponding second feature point in the second feature point set aiming at each first feature point set;
and finally, determining a magnitude relation between a distance mean value corresponding to each first feature point set and a preset distance mean value (namely, the comparison result is obtained), wherein if the magnitude relation is that the distance mean value is greater than the preset distance mean value, it indicates that the target line segment belongs to the target curve segment, and if the magnitude relation is that the distance mean value is less than or equal to the preset distance mean value, it indicates that the target line segment does not belong to the target curve segment.
Optionally, in the first two examples, a specific manner of obtaining the plurality of first time information is not limited, and may be selected according to an actual application requirement.
For example, in one alternative example, the plurality of first time information may be acquired based on the following sub-steps:
the method comprises the steps of firstly, obtaining current time information of a current moment to obtain first time information;
secondly, taking the current time information as a starting point, sequentially acquiring historical time information of a moment of historically sending historical first request information to the target block chain system 300 to obtain new first time information;
thirdly, judging whether the current quantity of the obtained first time information is greater than a preset value or not;
fourthly, if the current quantity is larger than the preset value, stopping obtaining the historical time information;
fifthly, if the current quantity is smaller than the preset value and the historical time information cannot be acquired (for example, there is no more historical time information, that is, there is no more historical first request information), randomly generating at least one piece of historical time information, wherein each piece of historical time information in the at least one piece of historical time information is smaller than each piece of historical time information corresponding to the current quantity;
and sixthly, taking the at least one piece of historical time information as new first time information, so that the number of the obtained first time information is larger than the preset value (namely, information supplement is realized, and the obtained information can meet the actual requirement).
Optionally, in the first two examples, a specific manner of generating the first request information including the binary data group is not limited, and may be selected according to actual application requirements.
For example, in one alternative example, the first request information including the binary data set may be generated based on the following sub-steps:
first, obtaining device identification information (such as a mobile phone ID) of the payment platform 100;
and a second step of generating first request information including the binary data group and the device identification information, wherein the target block chain system 300 is configured to perform authority verification on the fee payment platform 100 based on the device identification information (e.g., verify whether the fee payment platform 100 is registered in the target block chain system 300 in advance to obtain authorization), to send the determined target two-dimensional code identification information to the fee payment platform 100 after the authority verification is passed, and to generate new two-dimensional code identification information based on the first request information.
In summary, the block chain based fee payment method and the fee payment platform 100 provided by the present application acquire the target two-dimensional code identification information by sending the first request information to the target block chain system 300, so that the target two-dimensional code image can be generated based on the target two-dimensional code identification information, then identify the target two-dimensional code image based on the preset two-dimensional code identification information to obtain the target two-dimensional code identification information and send the target two-dimensional code identification information to the target block chain system, so as to manage and process the target two-dimensional code identification information, so that the fee collection platform 200 can acquire the associated target two-dimensional code identification information from the target block chain system 300 based on the target two-dimensional code identification information after identifying the target two-dimensional code image based on the preset two-dimensional code identification information to obtain the target two-dimensional code identification information, and further identify the target two-dimensional code image based on the target two-dimensional code identification information, and obtaining the target account information, and requesting the target financial platform to carry out fee payment processing based on the target account information so as to realize fee payment and collection. Therefore, the complexity of generating and identifying the two-dimensional code can be improved, the safety of the generating process and the identifying process is higher, the problem of lower safety in the existing expense payment technology is solved, and the method has higher practical value.
The above description is only a preferred embodiment of the present application and is not intended to limit the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (3)
1. A block chain based expense payment method is applied to an expense payment platform, the expense payment platform is in communication connection with a target block chain system, and the method comprises the following steps:
sending first request information to the target block chain system, wherein the target block chain system is used for determining one piece of two-dimensional code identification information from a plurality of pieces of stored two-dimensional code identification information based on the first request information to serve as target two-dimensional code identification information;
acquiring the target two-dimensional code identification information sent by the target block chain system based on the first request information, and converting the target account information of the expense payment platform on a target financial platform based on the target two-dimensional code identification information to generate a corresponding target two-dimensional code image;
performing first identification processing on the target two-dimensional code image based on preset two-dimensional code identification information to obtain target two-dimensional code identification information of the target two-dimensional code image, wherein the preset two-dimensional code identification information is different from the target two-dimensional code identification information;
sending the target two-dimensional code identification information to the target block chain system, wherein the target block chain system is used for associating the target two-dimensional code identification information with the target two-dimensional code identification information and storing the generated association relation;
displaying the target two-dimensional code image to a fee collection platform, wherein the fee collection platform is used for carrying out second identification processing on the target two-dimensional code image based on the preset two-dimensional code identification information to obtain target two-dimensional code identification information, obtaining the target two-dimensional code identification information in the target block chain system through the incidence relation based on the target two-dimensional code identification information, carrying out third identification processing on the target two-dimensional code image according to the target two-dimensional code identification information to obtain target account information, and requesting the target financial platform to carry out fee payment processing based on the target account information;
wherein the step of sending the first request message to the target blockchain system comprises:
generating a track to be processed based on the sliding operation of the target user on the display screen of the expense payment platform, wherein the track length of the track to be processed is greater than the preset length;
carrying out curve segment searching and identifying processing on the track to be processed, and determining whether at least one section of curve segment exists in the track to be processed;
if at least one section of curve section exists in the track to be processed, determining two end point positions of each section of the curve section;
for each curve segment, performing straight-line segment connection processing based on two end point positions of the curve segment to obtain a straight-line segment corresponding to the curve segment;
performing replacement processing on each curve segment in the to-be-processed track through a corresponding straight line segment to obtain a target track comprising at least one straight line segment;
segmenting the target track based on a preset segment segmentation method to obtain at least one segment of target segment, wherein the segment segmentation method comprises the step of presetting segmentation length;
for each target line segment, determining the identification information of the target line segment based on whether the target line segment belongs to a target straight line segment or a target broken line segment;
according to the position relation of each target line segment in the target track, sequentially mapping each target line segment according to the identification information of each target line segment to obtain a binary data set, wherein if the target line segment is a target straight line segment, the corresponding binary data is 1, and if the target line segment is a target broken line segment, the corresponding binary data is 0;
generating first request information including the binary data group;
and sending the first request information to a target block chain system, wherein the target block chain system is used for generating new two-dimensional code identification information based on the binary data group in the first request information, and using the two-dimensional code identification information generated based on the binary data group in the historical first request information acquired last time as target two-dimensional code identification information, and a data bit of 1 in the binary data group represents that a corresponding two-dimensional code symbol is mapped to 1 when being black and is mapped to 0 when being white, and a data bit of 0 in the binary data group represents that a corresponding two-dimensional code symbol is mapped to 0 when being black and is mapped to 1 when being white.
2. The blockchain-based fee payment method of claim 1, wherein the step of generating the first request information including the binary data group includes:
obtaining device identification information of the payment platform;
and generating first request information comprising the binary data group and the device identification information, wherein the target block chain system is used for performing authority verification on the expense payment platform based on the device identification information, so that after the authority verification is passed, the determined target two-dimensional code identification information is sent to the expense payment platform, and new two-dimensional code identification information is generated based on the first request information.
3. A fare processing financial platform comprising:
a memory for storing a computer program;
a processor coupled to the memory for executing a computer program stored by the memory to implement the blockchain based fare payment method of any one of claims 1-2.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011067013.2A CN112132562B (en) | 2020-10-04 | 2020-10-04 | Block chain-based expense payment method and expense payment platform |
| CN202110256864.XA CN112990894A (en) | 2020-10-04 | 2020-10-04 | Two-dimensional code information determination method based on block chain and user operation |
| CN202110256272.8A CN112990893A (en) | 2020-10-04 | 2020-10-04 | Two-dimensional code identification information generation method based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011067013.2A CN112132562B (en) | 2020-10-04 | 2020-10-04 | Block chain-based expense payment method and expense payment platform |
Related Child Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110256272.8A Division CN112990893A (en) | 2020-10-04 | 2020-10-04 | Two-dimensional code identification information generation method based on block chain |
| CN202110256864.XA Division CN112990894A (en) | 2020-10-04 | 2020-10-04 | Two-dimensional code information determination method based on block chain and user operation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112132562A CN112132562A (en) | 2020-12-25 |
| CN112132562B true CN112132562B (en) | 2021-08-10 |
Family
ID=73843748
Family Applications (3)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110256272.8A Withdrawn CN112990893A (en) | 2020-10-04 | 2020-10-04 | Two-dimensional code identification information generation method based on block chain |
| CN202110256864.XA Withdrawn CN112990894A (en) | 2020-10-04 | 2020-10-04 | Two-dimensional code information determination method based on block chain and user operation |
| CN202011067013.2A Active CN112132562B (en) | 2020-10-04 | 2020-10-04 | Block chain-based expense payment method and expense payment platform |
Family Applications Before (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110256272.8A Withdrawn CN112990893A (en) | 2020-10-04 | 2020-10-04 | Two-dimensional code identification information generation method based on block chain |
| CN202110256864.XA Withdrawn CN112990894A (en) | 2020-10-04 | 2020-10-04 | Two-dimensional code information determination method based on block chain and user operation |
Country Status (1)
| Country | Link |
|---|---|
| CN (3) | CN112990893A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109359994A (en) * | 2018-10-31 | 2019-02-19 | 巴马平方米区块链有限公司 | Method for processing business, apparatus and system based on block chain |
| CN111105228A (en) * | 2019-11-19 | 2020-05-05 | 上海链颉科技有限公司 | Block chain network service fee payment method, system and storage medium |
| CN111242622A (en) * | 2020-01-20 | 2020-06-05 | 江苏荣泽信息科技股份有限公司 | Safe payment system based on block chain |
| CN111615836A (en) * | 2018-02-19 | 2020-09-01 | 联想（新加坡）私人有限公司 | Provisioning remote units over a blockchain network |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9818092B2 (en) * | 2014-06-04 | 2017-11-14 | Antti Pennanen | System and method for executing financial transactions |
| EP3855677A1 (en) * | 2016-02-23 | 2021-07-28 | Nchain Holdings Limited | Blockchain-implemented method for control and distribution of digital content |
| US10509932B2 (en) * | 2016-03-07 | 2019-12-17 | ShoCard, Inc. | Large data transfer using visual codes with feedback confirmation |
| CN107767134A (en) * | 2017-01-22 | 2018-03-06 | 平安医疗健康管理股份有限公司 | Medical care cost method and system based on block chain |
| US10498541B2 (en) * | 2017-02-06 | 2019-12-03 | ShocCard, Inc. | Electronic identification verification methods and systems |
| CN109447604A (en) * | 2018-10-19 | 2019-03-08 | 华侨大学 | A kind of block chain payment system that security performance is high |
| CN109919613B (en) * | 2019-02-27 | 2019-12-10 | 福建瑞达精工股份有限公司 | Payment method based on block chain technology and watch |
| KR20200096400A (en) * | 2019-07-10 | 2020-08-12 | 주식회사 올아이티탑 | System and method for dealing a digital currency with block chain matching QR(or BAR) code |
| CN111553450B (en) * | 2020-04-27 | 2023-04-18 | 中国银行股份有限公司 | Two-dimensional code generation and verification method and device |
| CN111612483B (en) * | 2020-05-25 | 2021-04-02 | 安徽农业大学 | Tea leaf credible tracing system based on decentralization and centralization cooperation |
-
2020
- 2020-10-04 CN CN202110256272.8A patent/CN112990893A/en not_active Withdrawn
- 2020-10-04 CN CN202110256864.XA patent/CN112990894A/en not_active Withdrawn
- 2020-10-04 CN CN202011067013.2A patent/CN112132562B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111615836A (en) * | 2018-02-19 | 2020-09-01 | 联想（新加坡）私人有限公司 | Provisioning remote units over a blockchain network |
| CN109359994A (en) * | 2018-10-31 | 2019-02-19 | 巴马平方米区块链有限公司 | Method for processing business, apparatus and system based on block chain |
| CN111105228A (en) * | 2019-11-19 | 2020-05-05 | 上海链颉科技有限公司 | Block chain network service fee payment method, system and storage medium |
| CN111242622A (en) * | 2020-01-20 | 2020-06-05 | 江苏荣泽信息科技股份有限公司 | Safe payment system based on block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112990893A (en) | 2021-06-18 |
| CN112990894A (en) | 2021-06-18 |
| CN112132562A (en) | 2020-12-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108764239B (en) | Invoice verification method and device, computer equipment and storage medium | |
| CN110489415B (en) | Data updating method and related equipment | |
| EP2748781A2 (en) | Multi-factor identity fingerprinting with user behavior | |
| US11868979B2 (en) | System and process for electronic payments | |
| CN113034274A (en) | Supply chain financial service system and method based on block chain and terminal equipment | |
| CN109410027B (en) | Financial information processing method based on feature recognition, intelligent terminal and medium | |
| CN110247898B (en) | Identity verification method, identity verification device, identity verification medium and electronic equipment | |
| CN103269384A (en) | Rich client abnormality processing method, processing device and processing system | |
| US20190197539A1 (en) | Method of providing service for setting condition of card use, card company server and user terminal | |
| CN109344599A (en) | A kind of authentication management method, device, terminal and medium | |
| CN112132562B (en) | Block chain-based expense payment method and expense payment platform | |
| CN114218110A (en) | Account checking test method and device for financial data, computer equipment and storage medium | |
| CN111210345B (en) | Signature method and device based on block chain network transaction and terminal equipment | |
| CN111340635A (en) | Data checking method, equipment, server and readable storage medium | |
| CN112132563B (en) | Block chain based fee collection method and platform | |
| CN111291619A (en) | Method, device and client for on-line recognition of characters in claim settlement document | |
| CN107679865B (en) | Identity verification method and device based on touch area | |
| CN116342133A (en) | Face brushing payment method, system, equipment and medium for self-service terminal | |
| CN114723456A (en) | Payment method and payment system | |
| CN113065870A (en) | Safety payment method and system based on artificial intelligence and big data and cloud platform | |
| CN110533297B (en) | Method and device for identifying abnormal equipment | |
| CN113190562A (en) | Report generation method and device and electronic equipment | |
| CN109658084B (en) | Offline payment method and system | |
| CN113836402B (en) | Order screening method based on data processing | |
| CN115345621A (en) | Payment method, system and platform with payment function |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB03 | Change of inventor or designer information |
Inventor after: Zhou Bo Inventor after: Liu Honglin Inventor after: Huang Ying Inventor after: Cao Jianrong Inventor before: Cao Jianrong |
|
| CB03 | Change of inventor or designer information | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210723 Address after: Plant complex building of Laifu Science Park, No.9 Xijiu Road, high tech Zone, Nanning, Guangxi 530000 Applicant after: Guangxi Nanning Dongchuang Intellectual Property Operating Co.,Ltd. Address before: 212001 No.99, dingmaojing 15th Road, Zhenjiang New District, Zhenjiang City, Jiangsu Province Applicant before: Cao Jianrong Effective date of registration: 20210723 Address after: Room 1909, building 3, Wuxiang headquarters building, 8 Yunying Road, Nanning District, China (Guangxi) pilot Free Trade Zone, Nanning City, Guangxi Zhuang Autonomous Region Applicant after: Yunbao Big Data Industry Development Co.,Ltd. Address before: Plant complex building of Laifu Science Park, No.9 Xijiu Road, high tech Zone, Nanning, Guangxi 530000 Applicant before: Guangxi Nanning Dongchuang Intellectual Property Operating Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |