WO2014079282A1 - 存储和验证兑换码的方法和装置 - Google Patents
存储和验证兑换码的方法和装置 Download PDFInfo
- Publication number
- WO2014079282A1 WO2014079282A1 PCT/CN2013/084865 CN2013084865W WO2014079282A1 WO 2014079282 A1 WO2014079282 A1 WO 2014079282A1 CN 2013084865 W CN2013084865 W CN 2013084865W WO 2014079282 A1 WO2014079282 A1 WO 2014079282A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- random value
- redemption
- redemption code
- index
- string
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 60
- 238000013507 mapping Methods 0.000 claims abstract description 15
- 238000012795 verification Methods 0.000 claims description 53
- 238000005336 cracking Methods 0.000 claims description 6
- 230000008569 process Effects 0.000 description 13
- 238000010586 diagram Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 5
- 238000013500 data storage Methods 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000004549 pulsed laser deposition Methods 0.000 description 1
- 235000015170 shellfish Nutrition 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90344—Query processing by using string matching techniques
-
- 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/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
-
- 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/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
- G06Q30/0225—Avoiding frauds
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
- G06F21/107—License processing; Key processing
-
- 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/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
- G06Q30/0239—Online discounts or incentives
Definitions
- Embodiments of the present invention relate to the field of information processing technologies, and more particularly, to a method and apparatus for storing and verifying a redemption code. Background of the invention
- Redeem code also known as promo code or promotion code
- the composition generally includes numbers and characters, such as YWERE77RMJA9. Users can use a redemption code to obtain a computer program or other various physical products. After the user redeems the program or other physical products, the redemption code generally fails.
- a random algorithm is used to generate a plurality of character strings, the generated character string is used as a redemption code, and all redemption codes are completely stored in a storage space, such as a database.
- the database is searched by means of string comparison to determine whether the verification code exists in the database or whether the verification code has been exchanged.
- the randomly generated redemption code may also be repeated, so in the process of generating the redemption code or after the generation
- the step of removing the duplicate generated redemption code results in inefficient generation of the redemption code.
- a large amount of storage space is occupied. If the number of digits of the redemption code is reduced simply to save storage space, there is no guarantee that the success rate of the redemption code can be controlled.
- a full-text comparison method is needed to find a database, a file or other storage medium, so the data retrieval amount is large and the verification efficiency is low.
- Embodiments of the present invention provide a method and apparatus for storing and verifying a redemption code, thereby saving data storage space and improving verification efficiency of a redemption code in a situation where the success rate of the redemption code is controlled.
- a method for storing a redemption code comprising:
- a storage location of the random value is determined based on an index of the random value, and the random value is saved at the determined storage location.
- a method for verifying a redemption code including:
- Receiving a redemption code where the method for generating the redemption code includes:
- a storage device for a redemption code comprising a random value generating unit, a redemption code generating unit and a redemption code storage unit, wherein:
- the random value generating unit is configured to generate a random value, and determine an index of the random value according to a generating order of the random value;
- the redemption code generating unit is configured to perform an index according to the random value and the random value Generating a pair of values, mapping the pair of values into a string, and generating a redemption code according to the string;
- the redemption code storage unit is configured to determine a storage location of the random value according to an index of the random value, and save the random value at the determined storage location.
- a verification device for a redemption code comprising a redemption code receiving unit, a storage location determining unit and a verification unit, wherein:
- the redemption code receiving unit is configured to receive a redemption code, where the method for generating the redemption code includes:
- the storage location determining unit is configured to obtain a character string according to the redemption code, inversely map the character string into a value pair, and determine a storage location according to an index of the random value in the value pair;
- the verification unit is configured to further determine, when the random value stored at the storage location is not redeemed, whether the random value in the pair of values is consistent with a random value stored at the storage location, If yes, it is determined that the redemption code is verified successfully.
- each redemption code is formed by a pair of numerical values by setting a redemption code into a mapping rule of a character string and a numerical value, wherein one value is a random value and the other value is It is an index related to the random value generation order.
- the value pair is mapped into a string pair in the process of generating the redemption code, and only the random value needs to be stored when the redemption code is saved, so that the success rate of the redemption code can be controlled. In this case, you can also save data storage space.
- the string pair is mapped into a numerical pair in the redemption link to verify the verification, thereby improving the verification efficiency of the redemption code.
- the embodiments of the present invention can be applied to various terminals, and the present invention can be used across terminals according to platforms. The scope of application is very broad. BRIEF DESCRIPTION OF THE DRAWINGS
- FIG. 1 is a flow chart of a method for storing a redemption code according to an embodiment of the present invention.
- FIG. 2 is a flow chart of a method for verifying a redemption code according to an embodiment of the present invention.
- FIG. 3 is a schematic diagram of a process of generating a redemption code according to an embodiment of the present invention.
- FIG. 4 is a schematic diagram of a verification process of a redemption code according to an embodiment of the present invention.
- FIG. 5 is a structural diagram of a storage device of a redemption code according to an embodiment of the present invention.
- FIG. 6 is a structural diagram of a verification apparatus of a redemption code according to an embodiment of the present invention. Mode for carrying out the invention
- FIG. 1 is a flow chart of a method for storing a redemption code according to an embodiment of the present invention. As shown in Figure 1, the method includes the following steps.
- Step 101 The server generates a random value, and determines an index of the random value according to the generation order of the random value.
- various random number generation algorithms may be utilized to generate random values, and the index of the random values may be determined in accordance with the generation order of the random values.
- the index of the random value is determined by the order in which the random values are generated. In one embodiment of the invention, the index is a positive integer that is continuously incremented.
- the random number generation algorithm generates the random value 123 for the first time
- the random number generation algorithm generates the random value 478 for the second time
- the random number generation algorithm generates the random value 567 for the third time
- the random value can be determined.
- the index of 123 is 1, the index of the random value 478 is 2, and the index of the random value 567 is 3.
- Step 102 The server arranges the random value and the index of the random value into a value pair.
- the value pair is mapped to a string, which can be used as a redemption code.
- the confusing operation may be further performed on the mapped character string, and the character string after the confusing operation is performed as the redemption code.
- the random value generated in step 101 and the index of the random value are first arranged into a pair of values, and then the pair of values is mapped into a character string, and the pair of strings is confused to form a redemption code.
- the value pairs may be first mapped into a string pair in a plurality of ways.
- One implementation is to use a numeric-to-string function ( num 2str ) to convert each value in the pair of values to a corresponding 24-character string, thereby mapping the value pairs to string pairs.
- a new string is formed, and the new string is used as the verification code, and the character string (such as the 24-character string) can be further ) Confusion to enhance security.
- the obfuscation operation is a program conversion technique that can be used to protect mobile code and software intellectual property.
- the embodiments of the present invention can employ various existing obfuscation algorithms, or use confusion algorithms that may occur in the future.
- the values 0-23 in the process of converting the pair of values into a string, can be mapped to 24 characters, for example: "0", “1", "2",
- the confusion is "6C43G4BG60" as a redemption code waiting for storage.
- step 101 suppose that in step 101, the 100000th random value is 47982341, then the value pair is (100000, 47892341), and the data value pair is represented by the corresponding 24-digit ("75EG", "608AA5"). Map the string to "75EG608AA5".
- Y is the 24 characters in the 24-digit conversion.
- embodiments of the present invention are not limited to hexadecimal, but are applicable to any radix and mapping algorithm.
- Step 103 The server determines a storage location of the random value according to the index of the random value, and saves the random value at the determined storage location.
- the correspondence between the index and the storage location is saved in a redemption index table.
- a bitmap, a hash, or an array may be used to determine, according to the index of the random value, the corresponding storage location of the random value in the redemption index table, and The random value is saved at the determined storage location.
- the redemption status bit corresponding to the random value is further stored in the redemption index table, and is used to indicate the redemption status of the redemption code corresponding to the random value, that is, whether the redemption code has been Was exchanged.
- a plurality of bits may be used to indicate the redemption status of the redemption code, which is not limited in the embodiment of the present invention.
- the random value 22078136 may be stored in the storage location corresponding to the index 50000 in the redemption index table; the 900000th random value is 33069592, and the index corresponding to the index 90000 in the redemption index table may be The storage location stores the random value 33069592; the 100000th random value is 47982341, and the random value 47982341 can be stored in the storage location corresponding to the index 10000 in the redemption index table.
- the expected number of generations of the redemption code may be determined in advance, and the number of digits of the index is determined according to the expected number of generations of the redemption code; and the redemption code crack probability threshold is determined, and The redemption code crack probability threshold determines the number of bits of the random value.
- the random value is generated in step 101 and the order is determined according to the generation order of the random value.
- the index of the random value includes: generating a random value according to the number of bits of the random value, and determining an index of the random value according to the generation order of the random value and the number of bits of the index.
- a redemption code with a planned number of 4 billion and a crack success probability of less than 796 million is used as an example.
- each character of the index value and the random value can represent a 24-value value, so that the meaning of a character representation can be separated, one part represents an index value, and a part represents a random value, for example, the first 20-20 bits represent a random value.
- the 21-24bit represents the index value.
- a bitmap, a hash, or an array may be used to place the exchange index table in the memory to speed up the search.
- the embodiment of the invention also proposes a verification method of the redemption code.
- FIG. 2 is a flow chart of a method for verifying a redemption code according to an embodiment of the present invention. As shown in Figure 2, the method includes the following steps.
- Step 201 The server receives the redemption code, where the method for generating the redemption code includes: generating a random value, and determining an index of the random value according to the generation order of the random value; arranging the random value and the index of the random value into A pair of values, maps the pair of values into a string, and confuses the pair of strings to form a redemption code.
- the received redemption code may be a redemption code generated according to the method shown in FIG.
- Step 202 Perform an anti-aliasing operation on the redemption code, obtain a character string corresponding to the redemption code, and further determine a string pair corresponding to the redemption code, and inversely map the string pair to a value pair, and according to the value The index of the random value in the pair determines the storage location.
- Step 203 When the server determines that the random value stored at the storage location is not redeemed, further determining whether the random value in the pair of values is consistent with the random value stored at the storage location, and if so, Then it is determined that the redemption code is verified successfully.
- this step it may be determined according to the redemption status bit in the redemption index table whether the random value stored at the storage location has been redeemed. When it is judged that the random value stored at the storage location has been redeemed, it is determined that the redemption code has been redeemed before, and thus the verification fails. When it is determined that the random value stored in the storage location is not redeemed, it is determined that the redemption code has not been redeemed before, further querying the redemption index table, and determining whether the random value obtained in step 202 is in the redemption index table Whether the random values stored in the storage location are consistent.
- step 202 If the random value obtained in step 202 is consistent with the random value stored in the storage location in the redemption index table, it is determined that the redemption code verification is successful, if the random value obtained in step 202 is If the random values stored in the storage location in the redemption index table are inconsistent, it is determined that the redemption code verification fails.
- the redemption status bit corresponding to the random value in the redemption index table is updated to be redeemed.
- the generation efficiency and verification efficiency of the redemption code are improved, and the storage and verification process of the redemption code is completely free from the database, and the redemption code is stored and inquired according to the index, and the success rate of the redemption code is controllable.
- FIG. 3 is a schematic diagram of a process of generating a redemption code according to an embodiment of the present invention.
- 4 is a schematic diagram of a verification process of a redemption code according to an embodiment of the present invention.
- a description is made by taking an example of generating 4 billion redemption codes.
- 4 billion random values with a value range of [0, 7962624) are generated in sequence. And keep a comparison of the index and the random value in the redemption index table for use in the subsequent redemption phase. Then the index value ( inputjdx ) and the random value ( input_random ) are converted into 4 billion strings by the function num2str of the value to the string ( string ), and then the 4 billion strings are passed through a certain confusion algorithm, such as exchange The order is combined into 4 billion redemption codes and provided to customers for use. At the same time, the random value is stored in the storage location corresponding to the index.
- the redemption code is first restored to a pair of strings by an anti-aliasing operation, and the pair of strings is converted into a value pair by a string-to-value function str2num, where the index value is input_idx, The random value is input_random, and then the redemption index table is searched according to input_idx.
- the redemption index table can be bitmap or hash or data. The table of the library determines whether the redemption code has been redeemed.
- the redemption code has not been redeemed, find the random value corresponding to inputjdx in the redemption index table, compare the found random value with input-random , a random value if found and the same input-random, shellfish 1 J is determined redemption code authentication is successful, the exchange and updating the corresponding redemption code redemption status bit index table; and a random value if found different input_random , then it is determined that the redemption code 3 fails.
- the embodiment of the invention also proposes a storage device for the redemption code.
- FIG. 5 is a structural diagram of a storage device of a redemption code according to an embodiment of the present invention. As shown in FIG. 5, the apparatus includes a random value generating unit 501, a redemption code generating unit 502, and a redemption code storage unit 503.
- the random value generating unit 501 is configured to generate a random value, and determine an index of the random value in accordance with the generation order of the random value.
- the redemption code generating unit 502 is configured to arrange the random value and the index of the random value into a value pair, and map the value pair into a character string to form a redemption code.
- the redemption code storage unit 503 is configured to determine a storage location of the random value based on the index of the random value, and save the random value at the determined storage location.
- the apparatus further includes a bit number determining unit 504.
- the digit determining unit 504 is configured to determine the number of redemption codes, and determine the number of bits of the index according to the number of redemption codes; determine a redemption code crack probability threshold, and determine according to the redemption code crack probability threshold The number of random values.
- the random value generating unit 501 is configured to generate a random value according to the number of bits of the random value, and determine an index of the random value according to the generation order of the random value and the number of bits of the index.
- the redemption code storage unit 502 is configured to use a bitmap, a hash, or an array according to the random value. Determining the storage location of the random value in the redemption index table, and storing the random value at the storage location in the determined redemption index table, and saving in the redemption index table indicates whether the random value has been redeemed. The redemption status bit is further used to update the redemption status bit status of the random value at the storage location in the redemption index table to be redeemed when it is determined that the redemption code verification is successful.
- the embodiment of the invention also proposes a verification device for the redemption code.
- FIG. 6 is a structural diagram of a verification apparatus of a redemption code according to an embodiment of the present invention. As shown in Fig. 6, the apparatus includes a redemption code receiving unit 601, a storage location determining unit 602, and a verification unit 603.
- the redemption code receiving unit 601 is configured to receive a redemption code, where the method for generating the redemption code includes: generating a random value, and determining an index of the random value according to a generation order of the random value; the random value and the random The index of values is arranged into a pair of values, the pair of values is mapped into a pair of strings, and the pair of strings is confused to form a redemption code.
- the storage location determining unit 602 is configured to perform an anti-aliasing operation on the redemption code, obtain a character string corresponding to the redemption code, and inversely map the character string into a value pair, and according to the random number in the value pair The index of the value determines the storage location.
- a verification unit 603 configured to: when determining that the random value stored at the storage location is not redeemed, further determining whether the random value in the pair of values is consistent with the random value stored at the storage location, if Yes, it is determined that the redemption code is verified successfully.
- the verification unit 603 determines whether the random value stored at the storage location has been redeemed, and if the random value stored at the storage location has been redeemed, determining the redemption code Verification failure; if the random value stored at the storage location is not redeemed, further determining whether the random value in the pair of values is consistent with the random value stored at the storage location, if the value is aligned The random value is consistent with the random value stored at the storage location, and then the redemption code verification is successful, if the number is If the random value in the value pair does not coincide with the random value stored at the storage location, it is determined that the redemption code verification fails.
- the verification unit 603 is configured to determine, according to the redemption status bit in the redemption index table, whether the random value stored at the storage location has been redeemed, and update the redemption when it is determined that the redemption code verification is successful.
- the redemption status bit of the random value at the storage location in the index table is redeemed.
- the method flow shown in Fig. 1 and Fig. 2 and the device structure shown in Fig. 5 and Fig. 6 can be integrated into various forms of hardware entities as servers. For example, it can be integrated into: feature phones, smartphones, PDAs, personal computers (PCs), tablets or personal digital assistants (PDAs), and more.
- the methods and apparatus provided by the embodiments of the present invention may be implemented by hardware, or computer readable instructions, or a combination of hardware and computer readable instructions.
- the computer readable instructions used in this embodiment are stored by a plurality of processors in a readable storage medium, such as a hard disk,
- CD-ROM compact disc-read only memory
- DVD digital versatile disc
- CD compact disc-read only memory
- floppy disk CD-ROM
- tape hard disk
- RAM hard disk
- ROM read only memory
- computer readable instructions may be replaced by specific hardware, such as custom integrated circuits, gate arrays, FPGAs, PLDs, and computers with specific functions, and the like.
- Embodiments of the present invention provide a computer readable storage medium for storing instructions for causing a computer to perform the methods described herein.
- the system or device provided by this embodiment has a storage medium in which computer readable program code is stored for implementing the functions of any of the above embodiments, and these systems or devices (or CPUs or MPUs) can read and Execute the program code stored on the storage medium.
- the program code read from the storage medium can implement any of the above embodiments, and thus the program code and the storage medium storing the program code are part of the technical solution.
- the storage medium for providing the program code includes a floppy disk, a hard disk, a magneto-optical disk, and an optical disk (for example) Such as CD-ROM, CD-R, CD-RW, DVD-ROM, DVD-RAM, DVD-RW, DVD+RW), disk, flash card, ROM, etc.
- the program code can also be downloaded from a server computer over a communication network.
- an operation at least partially implemented by the program code may be implemented by an operating system running on a computer, thereby implementing the technical solution of any of the above embodiments, wherein the computer is executed based on the program code. instruction.
- program code in the storage medium is written to the memory, wherein the memory is located in an expansion board inserted in the computer or in an expansion unit connected to the computer.
- the CPU in the expansion board or the expansion unit performs at least part of the operation based on the program code according to the instruction, thereby implementing the technical solution of any of the above embodiments.
- a computer file running device can be written as a plug-in installed in a computer system by following a certain specification application interface, or it can be packaged as an application for the user to download and use.
- a plug-in it can be implemented as a variety of plug-ins such as ocx, dll, and cab.
- the storage and/or verification device of the redemption code proposed by the embodiment of the present invention may also be implemented by a specific technology such as a Flash plug-in, a RealPlayer plug-in, an MMS plug-in, a MIDI staff plug-in, or an ActiveX plug-in.
- each redemption code is composed of a pair of values, one of which is a random value, and the other is a Random values are generated in order-dependent indexes.
- the value pairs are mapped into a character string, and only the random value needs to be stored when the redemption code is saved, so that the data storage space can be saved while ensuring that the success rate of the redemption code is controllable.
- the string is mapped to a numerical value in the redemption link. Line verification, thereby improving the verification efficiency of the redemption code.
- embodiments of the present invention can be applied to various terminals, and the embodiments of the present invention can be used across terminals according to the platform, and the scope of application is very wide.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Entrepreneurship & Innovation (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Economics (AREA)
- Game Theory and Decision Science (AREA)
- Computational Linguistics (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Medical Treatment And Welfare Office Work (AREA)
- Storage Device Security (AREA)
- Multimedia (AREA)
- Technology Law (AREA)
Abstract
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/646,953 US9619657B2 (en) | 2012-11-23 | 2013-10-09 | Method and apparatus for storing redeem code, and method and apparatus for verifying redeem code |
US15/453,280 US10176304B2 (en) | 2012-11-23 | 2017-03-08 | Method and apparatus for storing redeem code, and method and apparatus for verifying redeem code |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210482877.X | 2012-11-23 | ||
CN201210482877.XA CN103838753B (zh) | 2012-11-23 | 2012-11-23 | 一种兑换码的存储、验证方法和装置 |
Related Child Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/646,953 A-371-Of-International US9619657B2 (en) | 2012-11-23 | 2013-10-09 | Method and apparatus for storing redeem code, and method and apparatus for verifying redeem code |
US15/453,280 Continuation US10176304B2 (en) | 2012-11-23 | 2017-03-08 | Method and apparatus for storing redeem code, and method and apparatus for verifying redeem code |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2014079282A1 true WO2014079282A1 (zh) | 2014-05-30 |
Family
ID=50775497
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2013/084865 WO2014079282A1 (zh) | 2012-11-23 | 2013-10-09 | 存储和验证兑换码的方法和装置 |
Country Status (3)
Country | Link |
---|---|
US (2) | US9619657B2 (zh) |
CN (1) | CN103838753B (zh) |
WO (1) | WO2014079282A1 (zh) |
Families Citing this family (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105224414B (zh) * | 2015-09-25 | 2018-01-19 | 北京奇虎科技有限公司 | 用于实现业务任务的码的校验方法及装置 |
CN105468687A (zh) * | 2015-11-17 | 2016-04-06 | 立德高科(北京)数码科技有限责任公司 | 一种码值数据随机关联方法与关联*** |
CN110738507A (zh) * | 2018-07-18 | 2020-01-31 | 北京京东金融科技控股有限公司 | 一种兑换码的领取方法和装置 |
CN109408032A (zh) * | 2018-11-01 | 2019-03-01 | 郑州云海信息技术有限公司 | 一种bios客制化快速实现方法、装置、终端及存储介质 |
CN111723360B (zh) * | 2019-03-18 | 2023-11-03 | 北京京东尚科信息技术有限公司 | 凭证码处理方法、装置及存储介质 |
CN110232601A (zh) * | 2019-06-18 | 2019-09-13 | 深圳前海微众银行股份有限公司 | 卡券管理方法、装置、设备及存储介质 |
CN112953716A (zh) * | 2019-11-26 | 2021-06-11 | 北京沃东天骏信息技术有限公司 | 一种兑换码生成及其验证方法和装置 |
CN111967908A (zh) * | 2020-08-17 | 2020-11-20 | 深圳市欢太科技有限公司 | 兑换码的验证方法、电子设备及存储介质 |
CN113240471A (zh) * | 2021-05-19 | 2021-08-10 | 完美世界(北京)软件科技发展有限公司 | 兑奖码的生成方法、生成装置、电子设备及存储介质 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101076807A (zh) * | 2004-10-15 | 2007-11-21 | 弗里塞恩公司 | 一次性密码 |
CN102332030A (zh) * | 2011-10-17 | 2012-01-25 | 中国科学院计算技术研究所 | 用于分布式键-值存储***的数据存储、管理和查询方法及*** |
WO2012014231A1 (en) * | 2010-07-29 | 2012-02-02 | Nirmal Juthani | System and method for generating a strong multi factor personalized server key from a simple user password |
CN102752115A (zh) * | 2012-07-04 | 2012-10-24 | 北京天龙融和软件有限公司 | 挑战码生成方法及装置、动态口令认证方法及*** |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7206411B2 (en) * | 2003-06-25 | 2007-04-17 | Wegener Communications, Inc. | Rapid decryption of data by key synchronization and indexing |
US9270646B2 (en) * | 2009-04-20 | 2016-02-23 | Citrix Systems, Inc. | Systems and methods for generating a DNS query to improve resistance against a DNS attack |
CN101651546A (zh) * | 2009-09-11 | 2010-02-17 | 福建天晴在线互动科技有限公司 | 一种离线生成动态密码与服务器进行登陆认证和同步的方法 |
US8870084B2 (en) * | 2011-09-13 | 2014-10-28 | Sca Promotions | Method and system for the generation and validation of personal identification numbers |
US20160132871A1 (en) * | 2012-06-07 | 2016-05-12 | Google Inc. | Secure redemption code generation for gift cards and promotions |
-
2012
- 2012-11-23 CN CN201210482877.XA patent/CN103838753B/zh active Active
-
2013
- 2013-10-09 WO PCT/CN2013/084865 patent/WO2014079282A1/zh active Application Filing
- 2013-10-09 US US14/646,953 patent/US9619657B2/en active Active
-
2017
- 2017-03-08 US US15/453,280 patent/US10176304B2/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101076807A (zh) * | 2004-10-15 | 2007-11-21 | 弗里塞恩公司 | 一次性密码 |
WO2012014231A1 (en) * | 2010-07-29 | 2012-02-02 | Nirmal Juthani | System and method for generating a strong multi factor personalized server key from a simple user password |
CN102332030A (zh) * | 2011-10-17 | 2012-01-25 | 中国科学院计算技术研究所 | 用于分布式键-值存储***的数据存储、管理和查询方法及*** |
CN102752115A (zh) * | 2012-07-04 | 2012-10-24 | 北京天龙融和软件有限公司 | 挑战码生成方法及装置、动态口令认证方法及*** |
Also Published As
Publication number | Publication date |
---|---|
CN103838753B (zh) | 2018-04-27 |
CN103838753A (zh) | 2014-06-04 |
US10176304B2 (en) | 2019-01-08 |
US20150278530A1 (en) | 2015-10-01 |
US20170177838A1 (en) | 2017-06-22 |
US9619657B2 (en) | 2017-04-11 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2014079282A1 (zh) | 存储和验证兑换码的方法和装置 | |
CN111030822B (zh) | 用于保护固件的方法和***,以及计算机可读介质 | |
US10042704B2 (en) | Validating stored encoded data slice integrity in a dispersed storage network | |
US10789062B1 (en) | System and method for dynamic data deduplication for firmware updates | |
US8336100B1 (en) | Systems and methods for using reputation data to detect packed malware | |
US9185119B1 (en) | Systems and methods for detecting malware using file clustering | |
TWI435236B (zh) | 惡意程式偵測裝置、惡意程式偵測方法及其電腦程式產品 | |
US8650649B1 (en) | Systems and methods for determining whether to evaluate the trustworthiness of digitally signed files based on signer reputation | |
WO2019160128A1 (ja) | ブロックチェーン・ネットワークにおいてトランザクションを検証するための方法及び当該ネットワークを構成するためのノード | |
US11275835B2 (en) | Method of speeding up a full antivirus scan of files on a mobile device | |
KR20150054380A (ko) | 근거리 무선 통신 칩의 펌웨어 업데이트 방법 및 이를 구현하는 전자 시스템 | |
CN110489466B (zh) | 邀请码的生成方法、装置、终端设备及存储介质 | |
JP6467540B1 (ja) | ブロックチェーン・ネットワークにおいてトランザクションを検証するための方法及び当該ネットワークを構成するためのノード | |
KR20200126061A (ko) | 블록체인 네트워크에서의 트랜잭션의 삭제를 가능하게 하는 노드 장치 및 그 동작 방법 | |
CN105787390A (zh) | 一种数据完整性的验证方法及其*** | |
CN111464258B (zh) | 一种数据校验方法、装置、计算设备及介质 | |
CN109190358B (zh) | 站点密码生成方法、***及密码管理器 | |
KR102375144B1 (ko) | 블록체인을 이용하여 개인키를 관리하는 장치, 방법, 시스템 및 컴퓨터 판독가능 저장 매체 | |
CN111949738A (zh) | 基于区块链的数据存储去重方法、终端设备和存储介质 | |
KR101893504B1 (ko) | 리눅스 환경에서 파일 무결성 검증 장치 및 방법 | |
JP2016130939A (ja) | 乱数生成装置、乱数生成方法、およびプログラム | |
CN111737704B (zh) | 用于数据证明的设备和方法 | |
CN115866542B (zh) | 短信验证码申请和验证方法、装置、设备及存储介质 | |
KR102398962B1 (ko) | 격자 기반 퍼지 추출 장치 및 방법 | |
US20220405372A1 (en) | Biometric authentication based on learning parity with noise |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 13857274 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 14646953 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205N DATED 05.10.2015) |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 13857274 Country of ref document: EP Kind code of ref document: A1 |