CN116629871B - Order online payment system and payment method - Google Patents
Order online payment system and payment method Download PDFInfo
- Publication number
- CN116629871B CN116629871B CN202310896772.7A CN202310896772A CN116629871B CN 116629871 B CN116629871 B CN 116629871B CN 202310896772 A CN202310896772 A CN 202310896772A CN 116629871 B CN116629871 B CN 116629871B
- Authority
- CN
- China
- Prior art keywords
- verification
- proving
- markov chain
- path
- state
- 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
- 238000000034 method Methods 0.000 title claims abstract description 149
- 238000012795 verification Methods 0.000 claims abstract description 327
- 230000008569 process Effects 0.000 claims abstract description 101
- 230000009977 dual effect Effects 0.000 claims abstract description 10
- 238000004088 simulation Methods 0.000 claims description 55
- 230000007704 transition Effects 0.000 claims description 36
- 238000004422 calculation algorithm Methods 0.000 claims description 29
- 230000004044 response Effects 0.000 claims description 28
- 239000011159 matrix material Substances 0.000 claims description 23
- 239000002243 precursor Substances 0.000 claims description 15
- 238000004364 calculation method Methods 0.000 claims description 11
- SLXKOJJOQWFEFD-UHFFFAOYSA-N 6-aminohexanoic acid Chemical compound NCCCCCC(O)=O SLXKOJJOQWFEFD-UHFFFAOYSA-N 0.000 claims description 3
- 239000000284 extract Substances 0.000 claims description 3
- 101150012763 endA gene Proteins 0.000 claims 1
- 230000006399 behavior Effects 0.000 description 5
- 230000007246 mechanism Effects 0.000 description 4
- 238000012546 transfer Methods 0.000 description 4
- 230000002159 abnormal effect Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000010200 validation analysis Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 230000001010 compromised effect Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 238000010420 art technique Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000013178 mathematical model Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/29—Graphical models, e.g. Bayesian networks
- G06F18/295—Markov models or related models, e.g. semi-Markov models; Markov random fields; Networks embedding Markov models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N7/00—Computing arrangements based on specific mathematical models
- G06N7/01—Probabilistic graphical models, e.g. probabilistic networks
-
- 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
- G06Q20/3825—Use of electronic signatures
-
- 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/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
- G06Q20/401—Transaction verification
- G06Q20/4014—Identity check for transactions
-
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
Abstract
The invention relates to the technical field of online payment, in particular to an order online payment system and an order online payment method. Comprising the following steps: the user terminal is configured to provide the user with an order payment request; the cloud end is configured to receive a payment request of a user and process the payment request to finish the payment request; the system further comprises: the system comprises a double verification end, a double proof end and an analog end; the dual verification terminal comprises: a first verification terminal and a second verification terminal; the dual proving terminal includes: a first proving end and a second proving end. And the payment safety, the verification reliability, the user experience and the system performance are obviously improved.
Description
Technical Field
The invention belongs to the technical field of online payment, and particularly relates to an order online payment system and an order online payment method.
Background
In the current digital age, electronic commerce and online payment have become an integral part of people's life. With the development and popularization of internet technology, more and more users select an online platform to make shopping and payment. In order to meet the demands of users and to ensure the security of transactions, an order online payment system is widely used. However, conventional order payment systems still have problems in some respects, such as the security of the payment process and the reliability of the verification.
Conventional order payment systems typically rely on a simple authentication and payment process. The user verifies the identity by entering a username and password and provides a bank card or other payment information to make the payment. However, this approach presents certain risks such as password theft, identity impersonation, and payment information disclosure. Furthermore, conventional authentication and payment processes lack sufficient means of authentication to ensure the integrity and authenticity of transactions.
In order to solve the problems of the conventional order payment system, some prior art techniques propose methods based on double verification and digital signature. The dual verification is performed by introducing a second verification end, such as a mobile phone short message verification code, fingerprint identification or dynamic password, so as to improve the security of identity verification. The digital signature uses a public key encryption algorithm and a private key signature algorithm to verify the integrity and authenticity of the data by generating a unique digital signature.
However, while the prior art improves the security and validation reliability of conventional order payment systems to some extent, there are still some problems that need to be resolved. Firstly, the double verification method may have the risk that the short message verification code is intercepted or the fingerprint is simulated, and the reliability of the verification process is reduced. Second, conventional digital signature methods may be compromised by the security of the private key, which may lead to the signature being forged and tampered with if the private key is compromised.
In addition, the order payment system in the prior art has a few complicated steps and complicated operations in the verification process, so that the user experience is poor. For example, the user needs to input the verification code, fingerprint the identification or set a complicated password, etc. many times, which increases the time and difficulty of the payment process.
Disclosure of Invention
The invention mainly aims to provide an order online payment system and a payment method, which remarkably improve payment safety, verification reliability, user experience and system performance.
In order to solve the problems, the technical scheme of the invention is realized as follows:
an order online payment system, comprising: the user terminal is configured to provide the user with an order payment request; the cloud end is configured to receive a payment request of a user and process the payment request to finish the payment request; the system further comprises: the system comprises a double verification end, a double proof end and an analog end; the dual verification terminal comprises: a first verification terminal and a second verification terminal; the dual proving terminal includes: a first proving end and a second proving end; the first verification terminal is in signal connection with the user terminal and is configured to acquire identity verification information of the user terminal when a user initiates a payment request to the cloud terminal through the user terminal, execute a first encryption process on the identity verification information, generate a first verification identifier and send the first verification identifier to the cloud terminal together with the payment request; when the first proving end receives a payment request, a first verification identifier acquisition request is sent to the cloud end to acquire a first verification identifier, then the reverse process of a first encryption process is executed, and identity verification information corresponding to the first verification identifier is obtained through decryption; the second proving end builds a state space of a Markov chain based on the identity verification information obtained by decrypting the first proving end as an initial state, then completes a path verification process based on the Markov chain together with the simulation end and the second verifying end, completes payment request verification, completes the payment request if verification is passed, and sends prompt information of failed verification to the user end if verification is not passed.
Further, when the second proving end completes the path verification process based on the Markov chain together with the simulation end and the second verification end, the second proving end uses the identity verification information obtained by decryption of the first proving end as an initial state s 0 Generating a Markov chain; the state space of the Markov chain is S, wherein S epsilon S represents a specific state; the transition probability matrix is p= (P ij ) Wherein p is ij Representing the probability of transitioning from state i to state j.
Further, the executing process of the second proving end when the second proving end completes the path verification process based on the Markov chain together with the simulation end and the second verification end comprises the following steps: selecting a random number c as a challenge and sending the challenge to a second verification terminal; reception ofA Markov chain path submitted by the second verification end and a simulated Markov chain path submitted by the simulation end; meanwhile, two verification processes are executed, namely a first verification process and a second verification process; the first verification process checks whether the following condition holds: judging whether each state in the Markov chain path submitted by the second verification terminal is a legal state or not, namely, belongs to a state space S; judging whether the value of the transition probability matrix P in the Markov chain path submitted by the second verification end can meet the probability from the precursor state to the current state; judging the response number s in the Markov chain path submitted by the second verification terminal response Whether it is a precursor state of a state in the path; the second verification process checks whether the following condition holds: the second proving end checks whether the simulated Markov chain path submitted by the simulation end meets the following conditions: whether each state in the simulated Markov chain path submitted by the simulation end is a legal state or not, namely belongs to a state space S; the value of the transition probability matrix P in the simulated Markov chain path submitted by the simulation end can meet the probability from the precursor state to the current state; if the first verification process and the second verification process are both passed, judging that the second proving end cannot distinguish the Markov chain path submitted by the second verification end from the simulated Markov chain path submitted by the simulation end, and obtaining a verification passing result.
Further, when the second proving end completes the path verification process based on the Markov chain together with the simulation end and the second verification end, the execution process of the simulation end comprises the following steps: select a random number sequence r= (r) 1 ，r 2 ，...，r n ) Wherein r is i Is a random number; according to the random number sequence r and the transition probability matrix P, a simulated Markov chain path s is calculated 0 →s′ 1 →s′ 2 →...→s′ n The method comprises the steps of carrying out a first treatment on the surface of the The length of the simulated Markov chain path is the same as the Markov chain path submitted by the second verification end; at the same time, the simulation end simulates each state s 'in the Markov chain path' i Is submitted to the second proving terminal.
Further, the second proving end is connected withWhen the simulation end and the second verification end jointly complete a path verification process based on a Markov chain, the execution process of the second verification end comprises the following steps: select a random number sequence r= (R 1 ，R 2 ，...，R n ) Wherein R is i Is a random number; according to the random number sequence R and the transition probability matrix P, a Markov chain path s is calculated 0 →s 1 →s 2 →...→s n The method comprises the steps of carrying out a first treatment on the surface of the Each state s in the path i Is submitted to the second proving terminal; according to the challenge number c sent by the second proving end, calculating the response number s response As a precursor state to a state in the path; the response number s response Submitting to the second proving end.
Further, the first verification terminal executes a first encryption process on the identity verification information, and when a first verification identifier is generated, a large prime number p and a large prime number q are generated at first, and calculation is performed:
N＝p×q；
selecting an integer e, satisfying 1< e < phi (N), and e and phi (N) are mutually prime, wherein:
φ(N)＝(p-1)×(q-1)；
calculating d such that d×e≡mod Φ (N); the public key (e, N) and the private key d are kept secret and are not disclosed outside; dividing self identity verification information M into blocks, filling and encoding each block to obtain a digital message sequence M 1 ，M 2 ，...，M n The method comprises the steps of carrying out a first treatment on the surface of the For each message sequence M i Generating a random key K i The method comprises the steps of carrying out a first treatment on the surface of the Using symmetric encryption algorithm and key K i Message sequence M i Encryption is carried out to obtain ciphertext C i The method comprises the steps of carrying out a first treatment on the surface of the Using public key encryption algorithm and public key (e, N), to key K i Encryption is carried out to obtain ciphertext C' i The method comprises the steps of carrying out a first treatment on the surface of the Ciphertext C i And ciphertext C' i And transmitting the data to the cloud terminal.
Further, after the first proving end obtains the first verification identifier, the first proving end performs format verification first, including: using a private key decryption algorithm and private key d, for ciphertext C' i Decryption is performed to obtain a key K i The method comprises the steps of carrying out a first treatment on the surface of the Using symmetric decryption algorithm and key K i For ciphertext C i Decrypted to obtainTo message sequence M i The method comprises the steps of carrying out a first treatment on the surface of the Sequence of messages M i Splicing to obtain received identity verification information M'; performing format verification on the received identity verification information M 'to ensure that the received identity verification information M' meets preset format requirements; if the format check fails, the first proving end refuses the decryption result; if the format check passes, the first proof end receives the decryption result and continues to perform signature verification.
Further, the signature verification process includes: the first proving end divides the decryption result M 'into blocks, and decodes and depacketizes each block to obtain an identity verification information sequence M' 1 ，M′ 2 ，...，M′ n The method comprises the steps of carrying out a first treatment on the surface of the The identity verification information M is obtained by splicing the identity verification information sequences; the first verification end uses a hash function to carry out abstract calculation on the identity verification information M to obtain an abstract value H (M); the first verification end truncates the first 128 bits of the digest value H (M) to obtain a truncated digest H' (M); the first verification end signs the truncated digest H' (M) by using a digital signature algorithm and a private key d to obtain a digital signature S; the first verification terminal transmits the authentication information M and the digital signature S together to the first certification terminal.
Further, after the first proof end receives the identity verification information M and the digital signature S, the following steps are executed: the first proving end uses hash function to carry out abstract calculation on the received identity verification information M to obtain abstract value H (M); the first proving end extracts a truncated digest H' (M) from the received digital signature S by using a public key and a digital signature algorithm; the first proving end cuts off the former part of the digest value H (M) to obtain a cut digest H' (M); the first proving end compares whether the truncated digest H '(M) and the truncated digest H' (M) are consistent, if so, the digital signature is continuously verified; if not, rejecting the identity verification information; the first proving end uses public key and digital signature algorithm to verify the digital signature S, so as to ensure the integrity and authenticity of the signature; if the digital signature verification fails, the first proving end refuses the identity verification information; if the digital signature verification passes, the first proof end receives the authentication information.
An order online payment method, the method comprising:
step 1: a user initiates an order payment request at a user side;
step 2: when a user initiates a payment request to a cloud end through a user end, acquiring identity verification information of the user end, executing a first encryption process on the identity verification information, generating a first verification identifier, and sending the first verification identifier to the cloud end together with the payment request;
step 3: the cloud receives a payment request of a user and processes the payment request to finish the payment request;
step 4: when the cloud receives a payment request, a first verification identifier acquisition request is sent to the cloud to acquire a first verification identifier, and then the reverse process of a first encryption process is executed to decrypt and obtain identity verification information corresponding to the first verification identifier;
step 5: based on the identity verification information obtained through decryption, a state space of a Markov chain is constructed as an initial state, a path verification process based on the Markov chain is completed, payment request verification is completed, if verification is passed, the payment request is completed, and if verification is not passed, no-passing prompt information is sent to a user side.
The order online payment system and the payment method have the following beneficial effects:
1. and (3) payment security is improved: the invention adopts a mechanism of double verification and digital signature, thereby effectively improving the safety of the payment process. The double verification introduces a second verification end, and through multi-factor identity verification, the risks of password leakage and identity impersonation are reduced. Meanwhile, the digital signature technology ensures the integrity and authenticity of transaction data, prevents the data from being tampered and forged, and improves the payment safety.
2. Verification reliability enhancement: the path verification process based on the Markov chain, provided by the invention, is completed through the simulation end and the second verification end together, so that the verification reliability is enhanced. The use of the Markov chain can model and verify the path, and ensure that the state and transition probability in the path meet preset requirements. The verification mode has higher accuracy and reliability, and reduces the error rate in the verification process.
3. Improving the system performance: compared with the traditional verification method, the method has higher efficiency and system performance by utilizing a path verification mechanism of the Markov chain. The path verification process is based on a state space and a transition probability matrix which are constructed in advance, and verification of the payment request can be completed rapidly and accurately through simulation and verification of the path. The efficient verification mode can improve the processing speed and concurrency capacity of the system and provide better user experience.
4. Defending against attacks and fraud: the dual verification and digital signature mechanism of the invention enhances the security of the system and can effectively resist attack and fraud. The double verification reduces the risks of stealing passwords and identity impersonation, and the digital signature ensures the integrity and authenticity of transaction data and prevents tampering and counterfeiting. In this way, the system can better protect the payment information of the user and reduce the payment risk and fraud.
Drawings
Fig. 1 is a method flow diagram of an online payment method for an order according to an embodiment of the present invention.
Detailed Description
An order online payment system and a payment method are provided.
In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.
An order online payment system, comprising: the user terminal is configured to provide the user with an order payment request; the cloud end is configured to receive a payment request of a user and process the payment request to finish the payment request; the system further comprises: the system comprises a double verification end, a double proof end and an analog end; the dual verification terminal comprises: a first verification terminal and a second verification terminal; the dual proving terminal includes: a first proving end and a second proving end; the first verification terminal is in signal connection with the user terminal and is configured to acquire identity verification information of the user terminal when a user initiates a payment request to the cloud terminal through the user terminal, execute a first encryption process on the identity verification information, generate a first verification identifier and send the first verification identifier to the cloud terminal together with the payment request; when the first proving end receives a payment request, a first verification identifier acquisition request is sent to the cloud end to acquire a first verification identifier, then the reverse process of a first encryption process is executed, and identity verification information corresponding to the first verification identifier is obtained through decryption; the second proving end builds a state space of a Markov chain based on the identity verification information obtained by decrypting the first proving end as an initial state, then completes a path verification process based on the Markov chain together with the simulation end and the second verifying end, completes payment request verification, completes the payment request if verification is passed, and sends prompt information of failed verification to the user end if verification is not passed.
Specifically, a Markov chain is a mathematical model consisting of a series of states and probabilities of transitions between the states. During path verification, the payment system uses a Markov chain to describe possible states and transition relationships between states. The system converts the verification problem of the payment request into the validity problem of the path by defining a state space and a state transition probability. In the path verification process, the second proving end uses the identity verification information obtained by the decryption of the first proving end as an initial state. The initial state serves as a starting point for the Markov chain, thereby building a state space. The state space is made up of a predefined set of states of the system, each state representing a possible state of the payment system. For example, the status may indicate that the user authentication is passed, the order is valid, etc. State transition probabilities describe the probability of transitioning from one state to another in a markov chain. During path verification, the system defines the transition probabilities between states. These probabilities may be set based on rules and policies of the payment system. For example, the transition from the authentication passing state to the order valid state may have a higher probability, while the transition from the authentication failing state to the order valid state may have a lower probability. Once the state space and state transition probabilities are determined, the system may begin validating the path of the payment request. During path verification, the system simulates the path of the payment request and compares it to the actual path. The system may consider the predefined state transition probabilities and analyze the validity of the simulated path. If the simulated path matches the actual path and the simulated path meets the validation rules set by the system, the payment request is deemed legitimate. Conversely, if the simulated path does not match the actual path or the simulated path violates the validation rule, the payment request will be deemed to be illegal or risky.
Preferably, the second proving end uses the identity verification information decrypted by the first proving end as the initial state s when the second proving end completes the path verification process based on the Markov chain together with the simulation end and the second verification end 0 Generating a Markov chain; the state space of the Markov chain is S, wherein S epsilon S represents a specific state; the transition probability matrix is p= (P ij ) Wherein p is ij Representing the probability of transitioning from state i to state j.
Specifically, in the path verification process, the second proving end uses the identity verification information obtained by decrypting the first proving end as an initial state, and s is recorded as 0 . This initial state can be regarded as the starting point of the markov chain. The state space S of the markov chain is a set in which each element S represents a specific state. In a payment system, the states may represent different operational states of the system, user behavior states, etc.
Transition probability matrix p= (P ij ) Is a square matrix, wherein p ij Representing the probability of transitioning from state i to state j. This probability matrix describes the transition relationships between the states in the Markov chain. Through the simulation path verification process, the second proving terminal selects the next state according to the current state at each step, and decides which state to transfer to according to the transfer probability matrix P. Definition of transition probability matrix P determines state transitions of the markov chainAnd (5) moving. In the path verification process, the second proving end can detect abnormal paths, illegal transfer or fraudulent behaviors by using the state space S of the Markov chain and the transfer probability matrix P. By cooperating with the simulation end and the second verification end, the system can verify the validity and security of the payment request.
Preferably, the executing process of the second proving end when the second proving end and the simulation end and the second verification end together complete the path verification process based on the Markov chain comprises the following steps: selecting a random number c as a challenge and sending the challenge to a second verification terminal; receiving a Markov chain path submitted by a second verification end and a simulated Markov chain path submitted by a simulation end; meanwhile, two verification processes are executed, namely a first verification process and a second verification process; the first verification process checks whether the following condition holds: judging whether each state in the Markov chain path submitted by the second verification terminal is a legal state or not, namely, belongs to a state space S; judging whether the value of the transition probability matrix P in the Markov chain path submitted by the second verification end can meet the probability from the precursor state to the current state; judging the response number s in the Markov chain path submitted by the second verification terminal response Whether it is a precursor state of a state in the path; the second verification process checks whether the following condition holds: the second proving end checks whether the simulated Markov chain path submitted by the simulation end meets the following conditions: whether each state in the simulated Markov chain path submitted by the simulation end is a legal state or not, namely belongs to a state space S; the value of the transition probability matrix P in the simulated Markov chain path submitted by the simulation end can meet the probability from the precursor state to the current state; if the first verification process and the second verification process are both passed, judging that the second proving end cannot distinguish the Markov chain path submitted by the second verification end from the simulated Markov chain path submitted by the simulation end, and obtaining a verification passing result.
Specifically, the second proving end only proves the validity of the payment request through the verification process without revealing specific information of the payment request path to the second verification end, and the confidentiality of the path is maintained. The second proving end can not distinguish the real path submitted by the second verifying end and the simulation path submitted by the simulation end, so that the two paths can not be distinguished through the verifying process.
And ensuring the validity of the payment request by verifying whether the state in the payment request path belongs to a legal state space and whether the transition probability meets the legal state transition rule. By checking whether the response number is a precursor state to a state in the path, the verification process identifies and prevents possible fraud and abnormal operation. The second proving terminal only proves the validity of the payment request through the verification process, and specific path information is not required to be disclosed, so that the confidentiality of the payment request is protected. The path verification process based on zero knowledge proof provides a powerful payment verification mechanism, improves the safety and reliability of a payment system, and protects payment information and fund safety of a user.
Preferably, when the second proving end completes the path verification process based on the markov chain together with the simulation end and the second verification end, the execution process of the simulation end includes: select a random number sequence r= (r) 1 ，r 2 ，...，r n ) Wherein r is i Is a random number; according to the random number sequence r and the transition probability matrix P, a simulated Markov chain path s is calculated 0 →s′ 1 →s′ 2 →...→s′ n The method comprises the steps of carrying out a first treatment on the surface of the The length of the simulated Markov chain path is the same as the Markov chain path submitted by the second verification end; at the same time, the simulation end simulates each state s 'in the Markov chain path' i Is submitted to the second proving terminal.
Specifically, the existence and the behavior of the simulation end can enable the second proving end to be incapable of distinguishing the real path from the simulation path, so that the difficulty of path verification is increased. By cooperative work with the second proving end and the second verifying end, the security of the payment request is enhanced, and fraudulent behaviors and abnormal operations are prevented. The generation and submission of the simulated paths is to provide a comparison reference to verify whether the second proving end is able to distinguish between the actual paths and the simulated paths.
The simulation side selects a sequence of random numbers that are used to generate a simulated Markov chain path. The random number selection ensures the randomness and independence of the analog paths. The random number sequence ensures the randomness of the simulation path, so that the simulation path is unpredictable, and the difficulty and reliability of path verification are increased.
The random number sequence ensures the randomness of the simulation path, so that the simulation path is unpredictable, and the difficulty and reliability of path verification are increased. The calculation of the simulated markov chain path is to simulate normal payment behavior and path. Based on random number sequence and transition probability, the method ensures the rationality and legality of the simulation path, so that the simulation path has similar characteristics with the real path.
The length of the simulated Markov chain path generated by the simulation end is the same as the Markov chain path submitted by the second verification end. The simulation end submits each state in the simulation path to the second proving end one by one. The length of the simulated path is the same as the real path, ensuring that the path length is consistent during verification. The state-by-state of the simulated path is submitted to a second proving end for comparison verification with the real path to determine whether the second proving end can distinguish the real path from the simulated path.
Preferably, when the second proving end completes the path verification process based on the markov chain together with the simulation end and the second verification end, the execution process of the second verification end comprises: select a random number sequence r= (R 1 ，R 2 ，...，R n ) Wherein R is i Is a random number; according to the random number sequence R and the transition probability matrix P, a Markov chain path s is calculated 0 →s 1 →s 2 →...→s n The method comprises the steps of carrying out a first treatment on the surface of the Each state s in the path i Is submitted to the second proving terminal; according to the challenge number c sent by the second proving end, calculating the response number s response As a precursor state to a state in the path; the response number s response Submitting to the second proving end.
Specifically, the second verification terminal selects a random number sequence, and the random numbers are used for generating a Markov chain path. The random number selection ensures the randomness and independence of the paths. The selection of the random number sequence ensures the randomness of the generated markov link path, making it unpredictable.
The second verification end uses the selected random number sequence and the transition probability matrix to calculate a Markov chain path according to the state transition rule of the Markov chain. The calculated Markov chain path is a reference for comparison with the real path and the simulated path. It has reasonable path characteristics based on random number sequences and transition probabilities.
And the second verification end submits each state in the calculated Markov chain path to the second proving end one by one. Each state in the path is submitted to a second proving terminal for comparison verification with the real path and the simulated path.
According to the challenge number c sent by the second proving end, the second verifying end calculates the response number s response As a precursor state to a state in the path. The calculated response number is used for verifying the correctness of the path. The response number is a response to the challenge for verifying whether the second proving end has a valid precursor state of the path.
The second verification terminal calculates the response number s response Submitting to the second proving end.
The submitted response number is used for comparing and verifying with the real path and the simulation path. It is a response of the second proving end to verify the path validity of the second proving end.
Preferably, the first verification terminal executes a first encryption process on the authentication information, and when generating a first verification identifier, first generates a large prime number p and q, and calculates:
N＝p×q；
selecting an integer e, satisfying 1< e < phi (N), and e and phi (N) are mutually prime, wherein:
φ(N)＝(p-1)×(q-1)；
calculating d such that d×e≡mod Φ (N); the public key (e, N) and the private key d are kept secret and are not disclosed outside; dividing self identity verification information M into blocks, filling and encoding each block to obtain a digital message sequence M 1 ，M 2 ，...，M n The method comprises the steps of carrying out a first treatment on the surface of the For each message sequence M i Generating a random secretKey K i The method comprises the steps of carrying out a first treatment on the surface of the Using symmetric encryption algorithm and key K i Message sequence M i Encryption is carried out to obtain ciphertext C i The method comprises the steps of carrying out a first treatment on the surface of the Using public key encryption algorithm and public key (e, N), to key K i Encryption is carried out to obtain ciphertext C' i The method comprises the steps of carrying out a first treatment on the surface of the Ciphertext C i And ciphertext C' i And transmitting the data to the cloud terminal.
Specifically, the public key encryption algorithm encrypts the secret key and part of the information by using the public key to ensure that only the second verification end with the private key can decrypt. The symmetric encryption algorithm encrypts the authentication information by using a random key, so that confidentiality and integrity of data are ensured. These encryption principles and processes combine to achieve encryption and protection of authentication information, thereby ensuring secure transmission and processing of data of payment requests.
Preferably, after the first proving end obtains the first verification identifier, format verification is performed first, including: using a private key decryption algorithm and private key d, for ciphertext C' i Decryption is performed to obtain a key K i The method comprises the steps of carrying out a first treatment on the surface of the Using symmetric decryption algorithm and key K i For ciphertext C i Decryption is carried out to obtain a message sequence M i The method comprises the steps of carrying out a first treatment on the surface of the Sequence of messages M i Splicing to obtain received identity verification information M'; performing format verification on the received identity verification information M 'to ensure that the received identity verification information M' meets preset format requirements; if the format check fails, the first proving end refuses the decryption result; if the format check passes, the first proof end receives the decryption result and continues to perform signature verification.
Specifically, through format verification, the first proving end can verify the integrity and correctness of the identity verification information obtained through decryption. This may avoid handling erroneous, malicious or corrupted data, ensuring that subsequent authentication and handling operations can be performed based on trusted authentication information. The format verification is an important link in the whole verification process and is used for ensuring the validity and reliability of the data.
Preferably, the signature verification process includes: the first proving end divides the decryption result M' into blocks, and decodes and deblocks each block to obtain an identity verification information sequenceColumn M' 1 ，M′ 2 ，...，M′ n The method comprises the steps of carrying out a first treatment on the surface of the The identity verification information M is obtained by splicing the identity verification information sequences; the first verification end uses a hash function to carry out abstract calculation on the identity verification information M to obtain an abstract value H (M); the first verification end truncates the first 128 bits of the digest value H (M) to obtain a truncated digest H' (M); the first verification end signs the truncated digest H' (M) by using a digital signature algorithm and a private key d to obtain a digital signature S; the first verification terminal transmits the authentication information M and the digital signature S together to the first certification terminal.
Preferably, after the first proof end receives the authentication information M and the digital signature S, the following steps are performed: the first proving end uses hash function to carry out abstract calculation on the received identity verification information M to obtain abstract value H (M); the first proving end extracts a truncated digest H' (M) from the received digital signature S by using a public key and a digital signature algorithm; the first proving end cuts off the former part of the digest value H (M) to obtain a cut digest H' (M); the first proving end compares whether the truncated digest H '(M) and the truncated digest H' (M) are consistent, if so, the digital signature is continuously verified; if not, rejecting the identity verification information; the first proving end uses public key and digital signature algorithm to verify the digital signature S, so as to ensure the integrity and authenticity of the signature; if the digital signature verification fails, the first proving end refuses the identity verification information; if the digital signature verification passes, the first proof end receives the authentication information.
Specifically, first, the decryption result M' is obtained according to the previous encryption process. In this step, M ' is divided into blocks and decoded and depacketized to restore the original authentication information sequence M1', M2',. The purpose of this step is to restore the decryption result to the original authentication information in preparation for subsequent signature verification.
And splicing the decoded authentication information sequences Mi' to form complete authentication information M. And combining the blocked identity verification information into complete identity verification information through splicing, and providing accurate data for subsequent hash calculation and signature verification.
The first verification end uses a hash function to carry out digest calculation on the identity verification information M to obtain a digest value H (M). The hash function converts the authentication information into a fixed-length digest value whose output length is related to the selected hash algorithm. The purpose of this step is to generate a unique digest value to verify the integrity of the data.
The first 128 bits of the digest value H (M) are truncated to obtain a truncated digest H' (M). This step is to limit the length of the signature, and typically a portion of the digest value is chosen as the truncated digest to reduce storage and transmission overhead.
And carrying out signature operation on the truncated digest H' (M) by using a digital signature algorithm and a private key d to obtain a digital signature S. The digital signature is the result of encrypting the digest value for verifying the integrity and authenticity of the information. In this step, the private key d is used to generate a digital signature, ensuring that only the first verifying end holding the private key can generate a valid signature.
Transmitting authentication information and a digital signature: the first verification terminal transmits the authentication information M and the digital signature S together to the first certification terminal. By sending the authentication information and the digital signature, the first authentication end provides proof of authentication to the first proving end and allows the first proving end to authenticate it.
The first proving end uses hash function to carry out digest calculation on the received identity verification information M to obtain a digest value H (M). This step aims at verifying the correctness of the digest value sent by the first verification terminal.
From the received digital signature S, a truncated digest H' (M) is extracted using a public key and a digital signature algorithm. This step is to decrypt the digital signature using the public key to obtain the truncated digest. The first proving terminal truncates the previous part of the digest value H (M) to obtain a truncated digest H "(M). Then, the first proving end compares whether the truncated digest H' (M) and the truncated digest H "(M) are identical. If the digest value and the truncated digest sent by the first verification end are consistent, the validity of the digital signature is continuously verified. If not, the first proving end refuses to accept the information, which indicates that the authentication information may be tampered with.
The first proving end uses a public key and a digital signature algorithm to verify the digital signature S so as to ensure the integrity and the authenticity of the signature. By comparing the decrypted truncated digest H' (M) with the recalculated digest value H (M), it is verified whether the digital signature matches the original authentication information. If the digital signature verification fails, namely the digital signature is not matched with the identity verification information, the first proving end refuses to accept the identity verification information. This means that the authentication information may be tampered with or not generated by the private key holder. If the digital signature passes verification, i.e. the digital signature is matched with the identity verification information, the first proving end receives the identity verification information and can continue subsequent verification and processing operations.
An order online payment method, the method comprising:
step 1: a user initiates an order payment request at a user side;
step 2: when a user initiates a payment request to a cloud end through a user end, acquiring identity verification information of the user end, executing a first encryption process on the identity verification information, generating a first verification identifier, and sending the first verification identifier to the cloud end together with the payment request;
step 3: the cloud receives a payment request of a user and processes the payment request to finish the payment request;
step 4: when the cloud receives a payment request, a first verification identifier acquisition request is sent to the cloud to acquire a first verification identifier, and then the reverse process of a first encryption process is executed to decrypt and obtain identity verification information corresponding to the first verification identifier;
step 5: based on the identity verification information obtained through decryption, a state space of a Markov chain is constructed as an initial state, a path verification process based on the Markov chain is completed, payment request verification is completed, if verification is passed, the payment request is completed, and if verification is not passed, no-passing prompt information is sent to a user side.
The above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (6)
1. An order online payment system, comprising: the user terminal is configured to provide the user with an order payment request; the cloud end is configured to receive a payment request of a user and process the payment request to finish the payment request; characterized in that the system further comprises: the system comprises a double verification end, a double proof end and an analog end; the dual verification terminal comprises: a first verification terminal and a second verification terminal; the dual proving terminal includes: a first proving end and a second proving end; the first verification terminal is in signal connection with the user terminal and is configured to acquire identity verification information of the user terminal when a user initiates a payment request to the cloud terminal through the user terminal, execute a first encryption process on the identity verification information, generate a first verification identifier and send the first verification identifier to the cloud terminal together with the payment request; when the first proving end receives a payment request, a first verification identifier acquisition request is sent to the cloud end to acquire a first verification identifier, then the reverse process of a first encryption process is executed, and identity verification information corresponding to the first verification identifier is obtained through decryption; the second proving end builds a state space of a Markov chain based on the identity verification information obtained by decrypting the first proving end as an initial state, wherein the state space consists of a group of states predefined by the system, each state represents a possible state of the payment system, then the simulation end and the second verifying end together complete a path verification process based on the Markov chain, the payment request verification is completed, if the verification is passed, the payment request is completed, and if the verification is not passed, the non-passed prompt information is sent to the user end; the second proving end decrypts the obtained identity verification information according to the first proving end when the second proving end completes the path verification process based on the Markov chain together with the simulation end and the second verification endAs an initial state s 0 Generating a Markov chain; the state space of the Markov chain is S, wherein S epsilon S represents a specific state; the transition probability matrix is p= (P ij ) Wherein p is ij Representing the probability of transitioning from state i to state j;
the execution process of the second proving end when the second proving end, the simulation end and the second verifying end together complete the path verifying process based on the Markov chain comprises the following steps: selecting a random number c as a challenge and sending the challenge to a second verification terminal; receiving a Markov chain path submitted by a second verification end and a simulated Markov chain path submitted by a simulation end; meanwhile, two verification processes are executed, namely a first verification process and a second verification process; the first verification process checks whether the following condition holds: judging whether each state in the Markov chain path submitted by the second verification terminal is a legal state or not, namely, belongs to a state space S; judging whether the value of the transition probability matrix P in the Markov chain path submitted by the second verification end can meet the probability from the precursor state to the current state; judging the response number s in the Markov chain path submitted by the second verification terminal response Whether it is a precursor state of a state in the path; the second verification process checks whether the following condition holds: the second proving end checks whether the simulated Markov chain path submitted by the simulation end meets the following conditions: whether each state in the simulated Markov chain path submitted by the simulation end is a legal state or not, namely belongs to a state space S; the value of the transition probability matrix P in the simulated Markov chain path submitted by the simulation end can meet the probability from the precursor state to the current state; if the first verification process and the second verification process are both passed, judging that the second proving end cannot distinguish the Markov chain path submitted by the second verification end from the simulated Markov chain path submitted by the simulation end, and obtaining a verification passing result; when the second proving end completes a path verification process based on a Markov chain together with the simulation end and the second verification end, the execution process of the simulation end comprises the following steps: select a random number sequence r= (r) 1 ,r 2 ,…,r n ) Wherein r is i Is a random number; based on random numbersThe column r and the transition probability matrix P calculate a simulated Markov chain path s 0 →s′ 1 →s′ 2 →…→s′ n The method comprises the steps of carrying out a first treatment on the surface of the The length of the simulated Markov chain path is the same as the Markov chain path submitted by the second verification end; at the same time, the simulation end simulates each state s 'in the Markov chain path' i Is submitted to the second proving terminal;
when the second proving end completes a path verification process based on a Markov chain together with the simulation end and the second verification end, the execution process of the second verification end comprises the following steps: select a random number sequence r= (R 1 ,R 2 ,…,R n ) Wherein R is i Is a random number; according to the random number sequence R and the transition probability matrix P, a Markov chain path s is calculated 0 →s 1 →s 2 →…→s n The method comprises the steps of carrying out a first treatment on the surface of the Each state s in the path i Is submitted to the second proving terminal; according to the challenge number c sent by the second proving end, calculating the response number s response As a precursor state to a state in the path; the response number s response Submitting to the second proving end.
2. An order online payment system according to claim 1, wherein the first verification terminal performs a first encryption process on the authentication information, and when generating a first verification identifier, first generates a large prime number p and q, and calculates:
N＝p×q；
an integer e is selected that satisfies 1<e < phi (N), and e is compatible with phi (N), wherein:
φ(N)＝(p-1)×(q-1)；
calculating d such that d×e≡mod Φ (N); the public key (e, N) and the private key d are kept secret and are not disclosed outside; dividing self identity verification information M into blocks, filling and encoding each block to obtain a digital message sequence M 1 ,M 2 ,…,M n The method comprises the steps of carrying out a first treatment on the surface of the For each message sequence M i Generating a random key K i The method comprises the steps of carrying out a first treatment on the surface of the Using symmetric encryption algorithm and key K i Message sequence M i Encryption is carried out to obtain ciphertext C i The method comprises the steps of carrying out a first treatment on the surface of the Using public key encryption algorithm and public key (e, N), to key K i Encryption is carried out to obtain ciphertext C' i The method comprises the steps of carrying out a first treatment on the surface of the Ciphertext C i And ciphertext C' i And transmitting the data to the cloud terminal.
3. The order online payment system of claim 2, wherein after the first proving end obtains the first verification identifier, the first verifying format comprises: using a private key decryption algorithm and private key d, for ciphertext C' i Decryption is performed to obtain a key K i The method comprises the steps of carrying out a first treatment on the surface of the Using symmetric decryption algorithm and key K i For ciphertext C i Decryption is carried out to obtain a message sequence M i The method comprises the steps of carrying out a first treatment on the surface of the Sequence of messages M i Splicing to obtain received identity verification information M'; performing format verification on the received identity verification information M 'to ensure that the received identity verification information M' meets preset format requirements; if the format check fails, the first proving end refuses the decryption result; if the format check passes, the first proof end receives the decryption result and continues to perform signature verification.
4. An order online payment system as recited in claim 3 wherein the process of signature verification comprises: the first proving end divides the decryption result M 'into blocks, and decodes and depacketizes each block to obtain an identity verification information sequence M' 1 ,M′ 2 ,…,M′ n The method comprises the steps of carrying out a first treatment on the surface of the The identity verification information M is obtained by splicing the identity verification information sequences; the first verification end uses a hash function to carry out abstract calculation on the identity verification information M to obtain an abstract value H (M); the first verification end truncates the first 128 bits of the digest value H (M) to obtain a truncated digest H' (M); the first verification end signs the truncated digest H' (M) by using a digital signature algorithm and a private key d to obtain a digital signature S; the first verification terminal transmits the authentication information M and the digital signature S together to the first certification terminal.
5. An order online payment system according to claim 4, wherein after the first proof end receives the identity verification information M and the digital signature S, the following steps are performed: the first proving end uses hash function to carry out abstract calculation on the received identity verification information M to obtain abstract value H (M); the first proving end extracts a truncated digest H' (M) from the received digital signature S by using a public key and a digital signature algorithm; the first proving end cuts the former part of the digest value H (M) to obtain a cut digest H ″ (M); the first proving end compares the truncated digest H' (M) with the truncated digest H ″ (M) if so, continuing to verify the digital signature; if not, rejecting the identity verification information; the first proving end uses public key and digital signature algorithm to verify the digital signature S, so as to ensure the integrity and authenticity of the signature; if the digital signature verification fails, the first proving end refuses the identity verification information; if the digital signature verification passes, the first proof end receives the authentication information.
6. An order online payment method based on the order online payment system of any of claims 1 to 5, the method comprising:
step 1: a user initiates an order payment request at a user side;
step 2: when a user initiates a payment request to a cloud end through a user end, acquiring identity verification information of the user end, executing a first encryption process on the identity verification information, generating a first verification identifier, and sending the first verification identifier to the cloud end together with the payment request;
step 3: the cloud receives a payment request of a user and processes the payment request to finish the payment request;
step 4: when the cloud receives a payment request, a first verification identifier acquisition request is sent to the cloud to acquire a first verification identifier, and then the reverse process of a first encryption process is executed to decrypt and obtain identity verification information corresponding to the first verification identifier;
step 5: based on the identity verification information obtained through decryption, a state space of a Markov chain is constructed as an initial state, a path verification process based on the Markov chain is completed, payment request verification is completed, if verification is passed, the payment request is completed, and if verification is not passed, no-passing prompt information is sent to a user side.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310896772.7A CN116629871B (en) | 2023-07-21 | 2023-07-21 | Order online payment system and payment method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310896772.7A CN116629871B (en) | 2023-07-21 | 2023-07-21 | Order online payment system and payment method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116629871A CN116629871A (en) | 2023-08-22 |
| CN116629871B true CN116629871B (en) | 2023-10-17 |
Family
ID=87602864
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310896772.7A Active CN116629871B (en) | 2023-07-21 | 2023-07-21 | Order online payment system and payment method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116629871B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106779702A (en) * | 2016-11-28 | 2017-05-31 | 努比亚技术有限公司 | Method of payment and payment system |
| KR20180033778A (en) * | 2016-09-26 | 2018-04-04 | 성균관대학교산학협력단 | Authentication method using markov chain modeling |
| CN109255713A (en) * | 2018-11-12 | 2019-01-22 | 裴若含 | In a kind of block chain network in certain time period book keeping operation power acquisition methods |
| WO2021242290A1 (en) * | 2020-05-26 | 2021-12-02 | Google Llc | Methods for aggregating credit across interactions |
| CN115412374A (en) * | 2022-11-01 | 2022-11-29 | 国网浙江省电力有限公司金华供电公司 | Safe data sharing method based on credit consensus mechanism |
| CN116113967A (en) * | 2020-07-16 | 2023-05-12 | 强力交易投资组合2018有限公司 | System and method for controlling digital knowledge dependent rights |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10419428B2 (en) * | 2015-07-05 | 2019-09-17 | NXT-ID, Inc. | System and method to authenticate electronics using electronic-metrics |
| EP3452975A4 (en) * | 2016-05-04 | 2020-04-15 | Algorand Inc. | Distributed transaction propagation and verification system |
| US10503933B2 (en) * | 2016-09-15 | 2019-12-10 | Nuts Holdings, Llc | Structured data folding with transmutations |
| WO2019118447A1 (en) * | 2017-12-11 | 2019-06-20 | Celo Labs Inc. | Decentralized database associating public keys and communications addresses |
| GB2604190A (en) * | 2020-05-26 | 2022-08-31 | Google Llc | Methods for aggregating credit across interactions |
-
2023
- 2023-07-21 CN CN202310896772.7A patent/CN116629871B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20180033778A (en) * | 2016-09-26 | 2018-04-04 | 성균관대학교산학협력단 | Authentication method using markov chain modeling |
| CN106779702A (en) * | 2016-11-28 | 2017-05-31 | 努比亚技术有限公司 | Method of payment and payment system |
| CN109255713A (en) * | 2018-11-12 | 2019-01-22 | 裴若含 | In a kind of block chain network in certain time period book keeping operation power acquisition methods |
| WO2021242290A1 (en) * | 2020-05-26 | 2021-12-02 | Google Llc | Methods for aggregating credit across interactions |
| CN116113967A (en) * | 2020-07-16 | 2023-05-12 | 强力交易投资组合2018有限公司 | System and method for controlling digital knowledge dependent rights |
| CN115412374A (en) * | 2022-11-01 | 2022-11-29 | 国网浙江省电力有限公司金华供电公司 | Safe data sharing method based on credit consensus mechanism |
Non-Patent Citations (2)
| Title |
|---|
| Probabilistic model checking for the quantification of DoS security threats;Basagiannis, S;《COMPUTERS & SECURITY》;第6卷(第28期);全文 * |
| 现代支付系统信息安全的反欺诈监测模型研究;吴敬花;周启海;刘家芬;;计算机科学(第12期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116629871A (en) | 2023-08-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| AU2022224799B2 (en) | Methods for secure cryptogram generation | |
| WO2021012552A1 (en) | Login processing method and related device | |
| US20210367753A1 (en) | Trusted measurement and control network authentication method based on double cryptographic values and chaotic encryption | |
| US20160080153A1 (en) | Device authenticity determination system and device authenticity determination method | |
| CN110990827A (en) | Identity information verification method, server and storage medium | |
| US20110264917A1 (en) | Method for two step digital signature | |
| EP2991263B1 (en) | Offline pin authentication method and system for ic card | |
| US9847879B2 (en) | Protection against passive sniffing | |
| JP7231023B2 (en) | Verification system, client and server | |
| US9509665B2 (en) | Protecting against malicious modification in cryptographic operations | |
| KR20120091618A (en) | Digital signing system and method using chained hash | |
| JP7302606B2 (en) | system and server | |
| CN105873043B (en) | Method and system for generating and applying network private key for mobile terminal | |
| CN116629871B (en) | Order online payment system and payment method | |
| CN110855667A (en) | Block chain encryption method, device and system | |
| CN108242997A (en) | The method and apparatus of secure communication | |
| CN117454437B (en) | Transaction processing method, storage medium and electronic device | |
| CN110321737B (en) | Method for preventing injection type attack of data encryption standard coprocessor | |
| CN117220887A (en) | Digital signature verification method, device, equipment and storage medium | |
| CN116188009A (en) | National cipher soft encryption mode key acquisition method, system, terminal and readable storage medium | |
| CN116248264A (en) | Data transmission method | |
| CN114548986A (en) | Payment method, payment security code generation method, device, equipment and storage medium | |
| CN116743388A (en) | Signature encryption method and device, electronic equipment and storage medium | |
| WO2005031619A2 (en) | Setup and application of mapping cryptogram and device and method thereof |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |