CN102810088B - Compound document code check method - Google Patents

Compound document code check method Download PDF

Info

Publication number
CN102810088B
CN102810088B CN201110148878.6A CN201110148878A CN102810088B CN 102810088 B CN102810088 B CN 102810088B CN 201110148878 A CN201110148878 A CN 201110148878A CN 102810088 B CN102810088 B CN 102810088B
Authority
CN
China
Prior art keywords
code
data base
character
dimensional
calibration
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
Application number
CN201110148878.6A
Other languages
Chinese (zh)
Other versions
CN102810088A (en
Inventor
张颂
张敬峰
沈维
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Yinhe Liandong Information Technology(beijing) Co Ltd
Original Assignee
Yinhe Liandong Information Technology(beijing) Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Yinhe Liandong Information Technology(beijing) Co Ltd filed Critical Yinhe Liandong Information Technology(beijing) Co Ltd
Priority to CN201110148878.6A priority Critical patent/CN102810088B/en
Publication of CN102810088A publication Critical patent/CN102810088A/en
Priority to HK13106549.8A priority patent/HK1179015A1/en
Application granted granted Critical
Publication of CN102810088B publication Critical patent/CN102810088B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

Compound document code check method, this compound document code includes a two-dimensional textual code and the one-dimensional text code associated with two-dimensional textual code-phase, the character number that the character number that one-dimensional text code comprises comprises less than two-dimensional textual code, the method includes: 1) character that one-dimensional text code is comprised is input to verify terminal by user, the first data base that verification terminal inquiry prestores, if one-dimensional text code does not exists, refuse compound document code;If one-dimensional text code exists, then carry out below step;2) character at least two ad-hoc location of verification demanding terminal user input two-dimensional textual code, the second data base that verification terminal inquiry and the first data base are associated, if at least one character in the character at least two ad-hoc location does not mate the character being pre-stored in the second data base, refuse compound document code;If the character at least two ad-hoc location all mates, compound document code is by verification.The present invention is simple to operate and cost is relatively low.

Description

Compound document code check method
Technical field
Present invention relates generally to method of calibration, in particular it relates to text code method of calibration.
Background technology
Currently, more and more occur substituting the application of papery bill evidence with Quick Response Code, with Quick Response Code form realize bill, Can apply various encryption, signature, authentication techniques when VIP qualification, identification easily, being effectively improved these should With required security requirement.Therefore, this application tool has a wide range of applications.
Especially, disclosed in the patent application document of Publication No. CN 101859398A Quick Response Code array so that Quick Response Code can be transmitted by normal short message.Simultaneously as the mobile service that short message service is user to be accepted extensively and use One of, almost all of mobile terminal all supports short message service, short message service with low cost, to issue success rate high, be not required to Will carry out adaptation according to the size of customer mobile terminal and resolution, the storage capacity of data also ratio is relatively low.Thus improve two dimension Arrival rate in code transmission, and add the motility on actually used and convenience, more it is so that the application of Quick Response Code more Add extensively.
But, although Quick Response Code in use has many advantages, but the recognition and verification for Quick Response Code is complicated, passes The mode of system needs to utilize optical identifying apparatus to carry out optically reading and processing further.Thus, improve application Quick Response Code Cost, increased the weight of the burden of user, and reduced the convenience in use.
It addition, for the businessman with optical read device, often due to equipment fault, be read Quick Response Code carrier The reasons such as broken or optical device pollution and cannot complete to optically read and/or process.Therefore, one objectively it is also required for Easy, the most standby or emergency method.
Accordingly, it is desirable to provide a kind of compound document code check method, to solve the problems referred to above.
Summary of the invention
The present invention solves the problems referred to above, it is provided that a kind of compound document code check method.
The invention discloses a kind of compound document code check method, described compound document code include a two-dimensional textual code and with One one-dimensional text code of described two-dimensional textual code-phase association, the character number that described one-dimensional text code is comprised is less than described two The character number that dimension text code is comprised, described method includes: the 1) institute that user will associate with described two-dimensional textual code-phase State the character that one-dimensional text code comprised and be input to verify terminal, the first data base that described verification terminal inquiry prestores, If described one-dimensional text code does not exists, refuse this compound document code;If described one-dimensional text code exists, then carry out following Step;2) user input at least two ad-hoc location in described two-dimensional textual code described in described verification demanding terminal On character, the second data base that described verification terminal inquiry is associated with described first data base, if described at least two At least one character in character on ad-hoc location does not mate the character being pre-stored in described second data base, refuses this compound literary composition This code;If the character on described at least two ad-hoc location all mates the character being pre-stored in described second data base, described Compound document code is by verification.
In one embodiment, the character number that described one-dimensional text code is comprised can be not more than described two-dimensional textual code institute / 2nd of the character number comprised, and preferably, the character number that described one-dimensional text code is comprised can also be little In the character number that described two-dimensional textual code is comprised 1/3rd.It will be appreciated by those skilled in the art that described one The character number that dimension text code is comprised can also be not more than 1/4th of the character number that described two-dimensional textual code is comprised Or 1/5th.
In one embodiment, the character that described one-dimensional text code and described two-dimensional textual code are comprised can include but not limit In, numeral, letter, GB2312 character or ascii character and combinations thereof.
In one embodiment, described verification terminal can be mobile terminal, it is preferable that described mobile terminal can be hands Machine, and the invention is not restricted to this, the most described mobile terminal can also be computer, PDA, POS etc..
In one embodiment, described first data base and described second data base can be same data base.
In one embodiment, described first data base and described second data base can be stored in described verification terminal. It will be appreciated by those skilled in the art that described first data base and described second data base being associated can store respectively In described verification terminal, it is also possible to be stored in described verification terminal as a data base.
In one embodiment, described first data base can be stored in described verification terminal, and described second data base can To be stored in far-end server, described far-end server is connected with described verification terminal by wired or wireless network, Qi Zhongsuo The operation stating the second data base that inquiry is associated with described first data base includes that described verification terminal is to described remote service Device sends inquiry request, and described far-end server beams back retrieval result to described verification terminal.
In one embodiment, described first data base and described second data base can be stored in far-end server, institute State far-end server to be connected with described verification terminal by wired or wireless network, wherein, the behaviour of described inquiry the first data base Make to include that described verification terminal sends inquiry request to described far-end server, and described far-end server is to described verification eventually End beams back retrieval result;Further, wherein, the operation bag of the second data base that described inquiry is associated with described first data base Include described verification terminal and send inquiry request to described far-end server, and described far-end server is sent out to described verification terminal Return retrieval result.It will be appreciated by those skilled in the art that described first data base and described second data base being associated Described far-end server can be separately stored in, it is also possible to be stored in described far-end server as a data base.
In one embodiment, described at least two ad-hoc location can determine at random, and the invention is not restricted to this, The most described at least two ad-hoc location can also be fixing or be determined by mathematical algorithm.
In one embodiment, described at least two ad-hoc location can show in verification terminal with matrix diagramatic way.
In one embodiment, described at least two ad-hoc location can be three positions.
In one embodiment, described compound document code can be received and displayed on verifying in terminal by short message mode, also Can be received and displayed on verifying in terminal by browser mode, it is also possible to be received and displayed on school by application software mode Testing in terminal, the present invention is also not limited to this.
The compound document code check method of the present invention uses be mutually related two-dimensional textual code and one-dimensional text code dexterously, by code Recognition and checking procedure be divided into two stages, by the user input shorter character of length, thus without optical sensing device, Under conditions of ensureing safety, reduce cost, and make checking procedure convenient.It is particularly suited for portfolio relatively Little and the user of optical sensing device need not be purchased, or need to apply a large amount of optical sensing device to cause cost abruptly increase User.
Accompanying drawing explanation
The present invention be may be better understood, in the accompanying drawings by referring to embodiment of the present invention are illustrated:
Fig. 1 is the schematic diagram of the first embodiment of the present invention;
Fig. 2 is the flow chart of the first embodiment of the present invention;
Fig. 3 is the schematic diagram of the second embodiment of the present invention;And
Fig. 4 is the schematic diagram of three ad-hoc locations in the two-dimensional textual code in the second embodiment of the present invention.
Detailed description of the invention
In the following description, in order to reach purpose of explanation the present invention there to be a comprehensive understanding, elaborate big The detail of amount, however, it will be apparent that to those skilled in the art, it is not necessary to these details can also realize The present invention.In this respect, the present invention, only for explanation, is not caused restriction by the illustrative example embodiment lifted. Therefore, protection scope of the present invention is not limited by above-mentioned specific embodiments, only with appending claims in the range of Accurate.
First combining with reference to Fig. 1 and Fig. 2, Fig. 1 is the schematic diagram of the first embodiment of the present invention, and Fig. 2 is the of the present invention The flow chart of one embodiment.Verification terminal 10 receives a compound document code with short message mode and is shown by described compound document code Show in verification terminal 10.Wherein, the mode receiving described compound document code is not limited to note, can also be by browsing Device mode or application software mode, the present invention is the most unrestricted.Described compound document code includes a two-dimensional textual code 40 And the one-dimensional text code 60 being associated with two-dimensional textual code 40.The character number that one-dimensional text code 60 is comprised is permissible The character number comprised much smaller than two-dimensional textual code 40.Such as, the character number that one-dimensional text code 60 is comprised can not More than 1/2nd or 1/3rd of the character number that two-dimensional textual code 40 is comprised, and preferably, one-dimensional text code 60 character numbers comprised can also be without 1/4th of the character number comprised more than two-dimensional textual code 40.Preferably In embodiment, two-dimensional textual code 40 can be the two-dimensional textual code of four row eight row, and one-dimensional text code 60 can only include The seldom character of number, such as seven characters.
First, the word that the one-dimensional text code 60 being associated with two-dimensional textual code 40 is comprised by the user of verification terminal 10 Symbol is input to verify terminal 10 (step 201).Then, verification terminal 10 inquires about the first data base 15 prestored, And judge one-dimensional text code 60 whether in the first data base 15 (step 202), if one-dimensional text code 60 does not exists, Refuse described compound document code;If one-dimensional text code 60 exists, then carry out below step.In one embodiment, When one-dimensional text code 60 is not in the first data base 15, verification terminal 10 easily can be thought by those skilled in the art To the various ways prompting compound document code that currently verified of user invalid, such as, by display information or auditory tone cues Information again or the mode such as display lamp, the emphasis place of this respect content non-invention, therefore does not repeats.
After the checking procedure of first stage, verification terminal 60 require user input in two-dimensional textual code 40 at least Character (step 203) on two ad-hoc locations.The second number that verification terminal 10 inquiry is associated with the first data base 15 According to storehouse 25, and judge that the character on described at least two ad-hoc location the most all mates the word being pre-stored in the second data base 25 Symbol (step 204).If at least one character in character on described at least two ad-hoc location does not mate is pre-stored in The character of two data bases 25, refuses described compound document code;If the character on described at least two ad-hoc location is all Joining the character being pre-stored in the second data base 25, described compound document code is by verification (step 205).Similarly, verification is eventually The compound document that end 10 currently can also be verified by the various ways prompting user that those skilled in the art are readily apparent that Whether code is by verification.
In the above-described embodiment, the character that one-dimensional text code 40 and two-dimensional textual code 60 are comprised can include but not limited to, Numeral, letter, GB2312 character or ascii character and combinations thereof.It will be appreciated by those skilled in the art that one-dimensional Text code 40 can make Chinese character or other similar words with some or all of the character that two-dimensional textual code 60 is comprised.
In the above-described embodiment, verification terminal 10 can be mobile terminal, it is preferable that described mobile terminal can be hands Machine, and the invention is not restricted to this, the most described mobile terminal can also be computer, PDA, POS etc..
It is the schematic diagram of the second embodiment of the present invention with reference to Fig. 3, Fig. 3.In this embodiment, verification terminal 10 is hands Machine.Being with the difference of the first embodiment, the first data base 15 and the second data base 25 are separately stored in mobile phone 10 With in a far-end server 20.Mobile phone 10 is connected with each other by wired or wireless network with far-end server 20.Wherein look into The operation asking the second data base 25 being associated with the first data base 15 includes that mobile phone 10 sends inquiry to far-end server 20 Ask, and far-end server 20 beams back retrieval result to mobile phone 10.Meanwhile, in the second embodiment shown in Fig. 3, It is that the character on three ad-hoc locations by judging in two-dimensional textual code 40 the most all mates and is pre-stored in the second data base 25 Character determine whether that described compound document code is the most effective.General English alphabet is added the simple application situation of numeral For, the probability guessing the character on three ad-hoc locations right is less than 40,006 one thousandths, and this has met and has been normally applied Requirement.
In preferred embodiments, the first data base 15 and the second data base 25 can be same data base, or the two Can be stored in verify terminal 10, then or both of which can be stored in far-end server 20.When both of which is stored in school When testing terminal 10, then eliminate the communication process between verification terminal 10 and far-end server 20.
Referring finally to the signal that Fig. 4, Fig. 4 are three ad-hoc locations in the two-dimensional textual code in the second embodiment of the present invention Figure.As shown in Figure 4, user needs to input the character on three ad-hoc locations in two-dimensional textual code 40, wherein said Ad-hoc location can show in verification terminal 10 with matrix diagramatic way (the as directed matrix being four row seven and arranging).? In other embodiments, the number of described ad-hoc location can be more, and described ad-hoc location can determine at random, And the invention is not restricted to this, the most described ad-hoc location can also be fixing or be determined by mathematical algorithm.
It is stored in another embodiment of far-end server 20 the first data base 15 and the second data base 25, inquiry the The operation of one data base 15 includes that verifying terminal 10 sends inquiry request, and far-end server 20 to far-end server 20 Retrieval result is beamed back to verification terminal 10;Further, wherein, the second data base 15 being associated with the first data base 10 is inquired about Operation include that verifying terminal 10 sends inquiry request to far-end server 20, and far-end server 20 is to verification terminal 10 beam back retrieval result.But, those skilled in the art, so it is easy to understand that when the first data base 15 and the second data When storehouse 25 is stored in verifying terminal 10, it is convenient to omit and carry out data transmission between far-end server 20 Flow.
The compound document code check method of the present invention uses be mutually related two-dimensional textual code and one-dimensional text code dexterously, by code Recognition and checking procedure be divided into two stages, by the user input shorter character of length, thus without optical sensing device, Under conditions of ensureing safety, reduce cost, and make checking procedure convenient.It is particularly suited for portfolio relatively Little and the user of optical sensing device need not be purchased, or need to apply a large amount of optical sensing device to cause cost abruptly increase User.
It will be appreciated by those skilled in the art that the method for the present invention is also applied for having multiple stage verification terminal (even multiple stage Server) occasion that simultaneously uses.At this moment, if having one compound document code of a verification terminal authentication, all verifications All data bases in terminal and/or Servers-all can carry out simultaneously operating, with the data that upgrade in time.
Although having been described above describing several exemplary with details, but disclosed embodiment being only example Property and nonrestrictive, and those skilled in the art will readily appreciate that, the most a lot of other amendments, It is possible for changing and/or replacing, and essence does not deviates novel teachings and the advantage of the disclosure.Therefore, all these repair Change, change and/or replace and be intended to be included in the scope of the present disclosure limited such as appended claims.

Claims (19)

1. a compound document code check method, described compound document code include a two-dimensional textual code and with described two dimension The one-dimensional text code that text code is associated, the character number that described one-dimensional text code is comprised is less than described two-dimensional textual code The character number comprised, described method includes:
1) described compound document code is received and displayed on verifying in terminal;
2) character that the described one-dimensional text code associated with described two-dimensional textual code-phase is comprised is input to described school by user Testing terminal, the first data base that described verification terminal inquiry prestores, if described one-dimensional text code does not exists, refusal should Compound document code;If described one-dimensional text code exists, then carry out below step;
3) on user input at least two ad-hoc location in described two-dimensional textual code described in described verification demanding terminal Character, the second data base that described verification terminal inquiry is associated with described first data base, if described at least two is specific At least one character in character on position does not mate the character being pre-stored in described second data base, refuses this compound document Code;If the character on described at least two ad-hoc location all mates the character being pre-stored in described second data base, described multiple Close text code by verification.
2. method of calibration as claimed in claim 1, the character number that wherein said one-dimensional text code is comprised is not more than institute State 1/2nd of the character number that two-dimensional textual code is comprised.
3. method of calibration as claimed in claim 2, the character number that wherein said one-dimensional text code is comprised is not more than institute State 1/3rd of the character number that two-dimensional textual code is comprised.
4. method of calibration as claimed in claim 3, the character number that wherein said one-dimensional text code is comprised is not more than institute State 1/4th of the character number that two-dimensional textual code is comprised.
5. method of calibration as claimed in claim 1, wherein said one-dimensional text code and described two-dimensional textual code are comprised Character includes numeral, letter, GB2312 character or ascii character and combinations thereof.
6. method of calibration as claimed in claim 1, wherein said verification terminal is mobile terminal.
7. method of calibration as claimed in claim 6, wherein said mobile terminal is mobile phone.
8. method of calibration as claimed in claim 1, wherein said first data base and described second data base are same Data base.
9. method of calibration as claimed in claim 1, wherein said first data base and described second data base are stored in Described verification terminal.
10. method of calibration as claimed in claim 1, wherein said first data base is stored in described verification terminal, and institute Stating the second data base and be stored in far-end server, described far-end server is by wired or wireless network with described verification terminal even Connecing, the operation of the second data base that wherein said inquiry is associated with described first data base includes that described verification terminal is to described Far-end server sends inquiry request, and described far-end server beams back retrieval result to described verification terminal.
11. methods of calibration as claimed in claim 1, wherein said first data base and described second data base are stored in Far-end server, described far-end server is connected with described verification terminal by wired or wireless network, wherein, described inquiry The operation of the first data base includes that described verification terminal sends inquiry request, and described remote service to described far-end server Device beams back retrieval result to described verification terminal;Further, wherein, described inquiry be associated with described first data base second The operation of data base includes that described verification terminal sends inquiry request to described far-end server, and described far-end server to Described verification terminal beams back retrieval result.
12. methods of calibration as claimed in claim 1, wherein said at least two ad-hoc location determines at random.
13. methods of calibration as claimed in claim 1, wherein said at least two ad-hoc location is fixing.
14. methods of calibration as claimed in claim 1, wherein said at least two ad-hoc location is to be determined by mathematical algorithm 's.
15. methods of calibration as claimed in claim 1, wherein said at least two ad-hoc location with matrix diagramatic way in school Test in terminal and show.
16. methods of calibration as claimed in claim 1, wherein said at least two ad-hoc location is three positions.
17. methods of calibration as claimed in claim 1, described compound document code is received and displayed on verification by short message mode In terminal.
18. methods of calibration as claimed in claim 1, described compound document code is received and displayed on school by browser mode Test in terminal.
19. methods of calibration as claimed in claim 1, described compound document code is received and displayed on by application software mode In verification terminal.
CN201110148878.6A 2011-06-03 2011-06-03 Compound document code check method Active CN102810088B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201110148878.6A CN102810088B (en) 2011-06-03 2011-06-03 Compound document code check method
HK13106549.8A HK1179015A1 (en) 2011-06-03 2013-06-04 Method for checking a composite text code

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201110148878.6A CN102810088B (en) 2011-06-03 2011-06-03 Compound document code check method

Publications (2)

Publication Number Publication Date
CN102810088A CN102810088A (en) 2012-12-05
CN102810088B true CN102810088B (en) 2016-09-28

Family

ID=47233795

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201110148878.6A Active CN102810088B (en) 2011-06-03 2011-06-03 Compound document code check method

Country Status (2)

Country Link
CN (1) CN102810088B (en)
HK (1) HK1179015A1 (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH1139344A (en) * 1997-07-18 1999-02-12 Nec Corp Character string retrieval method using two-dimensional array code
CN101552675A (en) * 2009-05-12 2009-10-07 佳学时代教育科技(北京)有限公司 Commercial intelligent real time identity authentication method based on mobile handhold terminal and two-dimension bar-code
CN101859398A (en) * 2009-04-10 2010-10-13 银河联动信息技术(北京)有限公司 Two-dimensional array code
CN101894424A (en) * 2009-05-21 2010-11-24 北京西阁万投资咨询有限公司 Trading card processing system and method for improving safety

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH1139344A (en) * 1997-07-18 1999-02-12 Nec Corp Character string retrieval method using two-dimensional array code
CN101859398A (en) * 2009-04-10 2010-10-13 银河联动信息技术(北京)有限公司 Two-dimensional array code
CN101552675A (en) * 2009-05-12 2009-10-07 佳学时代教育科技(北京)有限公司 Commercial intelligent real time identity authentication method based on mobile handhold terminal and two-dimension bar-code
CN101894424A (en) * 2009-05-21 2010-11-24 北京西阁万投资咨询有限公司 Trading card processing system and method for improving safety

Also Published As

Publication number Publication date
CN102810088A (en) 2012-12-05
HK1179015A1 (en) 2013-09-19

Similar Documents

Publication Publication Date Title
CN1845489B (en) Authentication information generating device and its method, inverse automata checking device and its method
CN104601712B (en) Resource supplying method and system
CN102752115A (en) Challenge code generation method and device, dynamic password authentication method and system
CN101609541A (en) The method and system of authenticating serialized commodities
CN101930557B (en) A kind of method and system of improving article delivery safety
CN101273574A (en) System for managing authenticating data for access to a service
US20190318280A1 (en) Method, system, and device for online ticket checking based on a client interface
CN104283682A (en) Method, device and system conducting verification through verification codes
CN108985066A (en) Intelligent contract security vulnerability detection method, device, terminal and storage medium
CN105100119A (en) URL detection method and device
CN107992759A (en) Realize device, method and the computer-readable recording medium of E-seal
CN101971560A (en) Method and apparatus for processing a multi-step authentication sequence
CN107104996A (en) Customer location method of calibration and device, controlled plant access method and device
CN106973043B (en) Password verification system and password verification method
KR102207466B1 (en) Method of generating mobile tickets and system of verificating mobile tickets for preventing illegal tickets
CN109635016A (en) Data transfer device, device, equipment and computer readable storage medium
CN102483747A (en) Image element searching
US7277723B2 (en) Method for inputting and permuting original scripts to external mobile phone and the device for performing the same
CN107342931A (en) Security message sending method using personalized template and the equipment using this method
CN102810088B (en) Compound document code check method
US20080103778A1 (en) Mobile terminal having function for reporting credit card loss and method using same
CN102609648A (en) Method and device for using word stock safely
CN106104547A (en) Login service based on confidential data provides method
CN107220838A (en) Anti-counterfeit authentication method and device
CN101299850B (en) Terminal number-baking method based on AT command

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 1179015

Country of ref document: HK

C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
REG Reference to a national code

Ref country code: HK

Ref legal event code: GR

Ref document number: 1179015

Country of ref document: HK