CN115344842A - Login authentication method for business trip management system - Google Patents

Login authentication method for business trip management system Download PDF

Info

Publication number
CN115344842A
CN115344842A CN202211276250.9A CN202211276250A CN115344842A CN 115344842 A CN115344842 A CN 115344842A CN 202211276250 A CN202211276250 A CN 202211276250A CN 115344842 A CN115344842 A CN 115344842A
Authority
CN
China
Prior art keywords
travel information
time
time sequence
node
tree
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.)
Granted
Application number
CN202211276250.9A
Other languages
Chinese (zh)
Other versions
CN115344842B (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.)
Yiqi Business Travel Shandong Technology Service Co ltd
Original Assignee
Yiqi Business Travel Shandong Technology Service 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 Yiqi Business Travel Shandong Technology Service Co ltd filed Critical Yiqi Business Travel Shandong Technology Service Co ltd
Priority to CN202211276250.9A priority Critical patent/CN115344842B/en
Publication of CN115344842A publication Critical patent/CN115344842A/en
Application granted granted Critical
Publication of CN115344842B publication Critical patent/CN115344842B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/30—Authentication, i.e. establishing the identity or authorisation of security principals
    • G06F21/31—User authentication
    • 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
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or 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
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation; Time management
    • G06Q10/103—Workflow collaboration or project management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/12—Accounting

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Accounting & Taxation (AREA)
  • General Business, Economics & Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Finance (AREA)
  • Computer Hardware Design (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Technology Law (AREA)
  • Data Mining & Analysis (AREA)
  • Development Economics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention relates to the technical field of electronic digital data processing, in particular to a business trip management system login authentication method, which comprises the following steps: acquiring all travel information time sequence trees, acquiring the attention weight of the travel information time sequence trees according to the login time and the starting time of the travel information time sequence trees, acquiring the importance degree of nodes according to the levels of the nodes and the number of the nodes at the same level, and acquiring the weight of the nodes according to the attention weight of the travel information time sequence trees and the importance degree of the nodes; acquiring the matching degree of the nodes according to two times input by a user; calculating the authentication integrity of the user according to the matching degrees of all nodes on all the travel information time sequence trees; and finishing the man-machine verification of the login user according to the authentication integrity of the user. According to the invention, login and user authentication operations are carried out according to the memory accuracy of the user to the historical travel information, and because the historical travel information is only stored in the system and is not disclosed, the man-machine verification cannot be cracked by a script program.

Description

Login authentication method for business trip management system
Technical Field
The invention relates to the field of electronic digital data processing, in particular to a business trip management system login authentication method.
Background
The business trip management is a measure for integrally managing the whole business trip activities of an enterprise when business trip expenses of the enterprise reach a certain scale. The method aims to improve the whole process of the travel, minimize the travel cost through the resources owned by the travel management service provider and control the expense of enterprises on the travel.
The existing travel management system generally needs man-machine authentication after logging in, which is to prevent network attacks on the entire management system, such as malicious registration behavior of program scripts. Most of the existing pc-end man-machine verification methods are man-machine verification by using verification codes such as pictures and characters or a slider jigsaw, but with the increasingly powerful functions of script programs, the script programs capable of cracking the verification codes of the existing characters, pictures and slider jigsaw appear, so that the safety of the travel management system is greatly reduced, and if the travel management system of an enterprise is attacked, a series of attack behaviors can be caused, such as data tampering, travel fare repeated reimbursement and the like. These actions all cause the enterprise to suffer from the loss, so there is a need for a non-public and highly accurate authentication method for the user to log in the travel management system, so as to ensure the security of the entire travel management system.
Disclosure of Invention
In order to solve the above problem, the present invention provides a method for login authentication of a travel management system, wherein the method comprises:
acquiring historical travel data of a login user, and constructing all travel information time sequence trees according to all the historical travel data;
acquiring all travel information time sequence trees within a preset range before a login time, and acquiring the attention weight of any travel information time sequence tree according to the time difference between the login time and the starting time of the travel information time sequence tree; obtaining attention weights of all travel information time sequence trees;
for any node on the travel information time sequence tree, obtaining the importance degree of the node according to the level of the node and the number of the nodes at the same level, and obtaining the weight of the node according to the attention weight of the travel information time sequence tree corresponding to the node and the importance degree of the node; obtaining the weights of all nodes of all travel information time sequence trees;
after a user inputs a correct account and a correct password, for any node on any travel information time sequence tree, the user inputs two times according to the location information of the node, and the matching degree of the node is obtained according to the two input times; calculating the authentication integrity of the user according to the matching degrees and weights of all nodes on all travel information time sequence trees;
and finishing the man-machine verification of the login user according to the authentication integrity of the user.
Further, the step of constructing all travel information time sequence trees according to all historical travel data comprises:
for any travel process, the starting time and the ending time of all behaviors in the travel process are obtained, the starting time and the ending time of all the behaviors are arranged to form a time axis, the time domain corresponding to each behavior on the time axis is obtained according to the starting time and the ending time of the behaviors, a travel information time sequence tree is constructed through the inclusion relationship among the time domains, each node of the travel information time sequence tree comprises the starting time and the ending time of one behavior, and the starting time contained in the root node of the travel information time sequence tree is recorded as the starting time of the travel process corresponding to the travel information time sequence tree.
Further, the step of obtaining the attention weight of the travel information time sequence tree according to the time difference between the login time and the start time of the travel information time sequence tree includes:
arranging the travel information time sequence trees of all travel processes in a preset range before the login time from small to large according to the time difference between the login time and the starting time of the travel processes, and
Figure 87093DEST_PATH_IMAGE001
the calculation formula of the attention weight of the travel information time sequence tree is as follows:
Figure 523890DEST_PATH_IMAGE002
in the formula (I), the compound is shown in the specification,
Figure 839596DEST_PATH_IMAGE003
is shown as
Figure 20042DEST_PATH_IMAGE001
The weight of interest of the individual travel information timing tree,
Figure 557333DEST_PATH_IMAGE004
denotes the first
Figure 414300DEST_PATH_IMAGE001
The degree of interest in the individual travel information timing tree,
Figure 466569DEST_PATH_IMAGE005
and the number of the travel information time sequence trees of all the travel processes in a preset range before the login time is represented.
Further, the step of calculating the attention degree of the travel information time sequence tree comprises:
first, the
Figure 185127DEST_PATH_IMAGE001
The calculation formula of the attention degree of the travel information time sequence tree is as follows:
Figure 639242DEST_PATH_IMAGE006
in the formula (I), the compound is shown in the specification,
Figure 431224DEST_PATH_IMAGE004
denotes the first
Figure 970790DEST_PATH_IMAGE001
The degree of interest in the individual travel information timing tree,
Figure 100002_DEST_PATH_IMAGE007
is shown as
Figure 961879DEST_PATH_IMAGE001
The starting time of the travel process corresponding to the travel information time sequence tree,
Figure 519769DEST_PATH_IMAGE008
which indicates the time of the login,
Figure 469270DEST_PATH_IMAGE009
indicates the time of registration and
Figure 230553DEST_PATH_IMAGE001
the time difference of the start time of the individual travel information timing tree,
Figure 510487DEST_PATH_IMAGE005
and the number of the travel information time sequence trees of all the travel processes in a preset range before the login time is represented.
Further, the step of obtaining the importance of the node according to the level of the node and the number of nodes at the same level includes:
first, the
Figure 673615DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 794017DEST_PATH_IMAGE010
The calculation formula of the importance degree of the node is as follows:
Figure 308175DEST_PATH_IMAGE011
in the formula (I), the compound is shown in the specification,
Figure 421494DEST_PATH_IMAGE012
is shown as
Figure 439128DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 996012DEST_PATH_IMAGE010
Importance of the nodeThe degree of the magnetic field is measured,
Figure 100002_DEST_PATH_IMAGE013
is shown as
Figure 225829DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 893570DEST_PATH_IMAGE010
The number of the nodes of (a) is,
Figure 765711DEST_PATH_IMAGE014
is shown as
Figure 493496DEST_PATH_IMAGE001
Maximum level of all nodes of the travel information timing tree.
Further, the step of obtaining the weight of the node according to the attention weight of the travel information time sequence tree corresponding to the node and the importance degree of the node includes:
first, the
Figure 965935DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 375050DEST_PATH_IMAGE010
The calculation formula of the weight of the node is as follows:
Figure 367277DEST_PATH_IMAGE015
in the formula (I), the compound is shown in the specification,
Figure 16695DEST_PATH_IMAGE016
denotes the first
Figure 461583DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 471128DEST_PATH_IMAGE010
The weight value of the node(s) of (c),
Figure 583440DEST_PATH_IMAGE003
is shown as
Figure 902295DEST_PATH_IMAGE001
The weight of interest of the individual travel information timing tree,
Figure 100058DEST_PATH_IMAGE012
is shown as
Figure 647714DEST_PATH_IMAGE001
The level of the travel information time sequence tree is
Figure 614533DEST_PATH_IMAGE010
The importance of the node.
Further, the step of obtaining the matching degree of the node according to the two input times includes:
the time domain of two times input by a user on a time axis is recorded as a first time domain, the time domain of the starting time and the ending time of a node on the time axis is recorded as a second time domain, and the intersection ratio of the first time domain and the second time domain is recorded as the matching degree of the node.
Further, the step of calculating the authentication integrity of the user according to the matching degrees and weights of all nodes on all travel information timing trees includes:
Figure 337245DEST_PATH_IMAGE017
in the formula (I), the compound is shown in the specification,
Figure 22304DEST_PATH_IMAGE018
the degree of integrity of the authentication is indicated,
Figure 576913DEST_PATH_IMAGE005
representing the number of all travel information timing trees,
Figure 647506DEST_PATH_IMAGE014
denotes the first
Figure 58896DEST_PATH_IMAGE001
The maximum level of all nodes of the travel information timing tree,
Figure 965672DEST_PATH_IMAGE019
is shown as
Figure 855131DEST_PATH_IMAGE001
The level of the travel information time sequence tree is
Figure 547275DEST_PATH_IMAGE010
The degree of matching of the nodes of (a),
Figure 863986DEST_PATH_IMAGE016
is shown as
Figure 258059DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 216787DEST_PATH_IMAGE010
The weight of the node of (c).
The embodiment of the invention at least has the following beneficial effects:
the prior man-machine verification method utilizes pictures, characters or puzzles to carry out man-machine verification, the verification of the verification methods all follows a recognized verification logic, if the puzzles need to slide to a missing part, but the verification method generates verification problems according to the historical travel information of users, the historical travel information is stored in a system and is not open, so the historical travel information is not easy to be cracked directly by scripts, meanwhile, the invention considers the memory accuracy of the users to the historical travel information, determines the attention weight of each travel according to the time span of each historical travel relative to the login time, sets the weight of all travel nodes according to the detail information in each historical travel, and can furthest ensure the matching score of the travel information memorized by the users and the historical travel information. And finally, representing the integrity of the authentication by the matching degree of the user input and the travel information in the information node.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions and advantages of the prior art, the drawings used in the embodiments or the description of the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a flowchart illustrating steps of a method for login authentication of a travel management system according to an embodiment of the present invention;
FIG. 2 is a time axis corresponding to a travel process according to an embodiment of the present invention;
fig. 3 is a timing tree of travel information corresponding to the time axis of fig. 2 according to an embodiment of the present invention.
Detailed Description
To further illustrate the technical means and effects of the present invention for achieving the predetermined purpose, the following detailed description of the embodiments, structures, features and effects of the method for log-in authentication of a travel management system according to the present invention will be provided with reference to the accompanying drawings and the preferred embodiments. In the following description, different "one embodiment" or "another embodiment" refers to not necessarily the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following describes a specific scheme of the login authentication method of the travel management system provided by the invention in detail with reference to the accompanying drawings.
Referring to fig. 1, a flowchart illustrating steps of a method for log-in authentication of a travel management system according to an embodiment of the present invention is shown, where the method includes the following steps:
and S001, acquiring historical travel data of the login account.
When a user logs in an account, historical travel data of the current logged-in account are obtained, and the data are various data of the running start-stop time in the journey, which are remained on a travel management system by the user. The specific time point is obtained by operations performed on the travel management system such as when a high-speed rail or an airplane taking a ride lands when taking off, checks in and leaves the hotel for a specific period of time, reserves a restaurant, and arrives at the restaurant and finishes a meal.
And S002, constructing all travel information time sequence trees according to all historical travel data.
For any one travel process, because the account historical travel data is composed of the starting and ending time points of behaviors in some travel processes, each behavior in the travel process corresponds to a starting time and an ending time. The method includes the steps of obtaining start time and end time of all behaviors in a traveling process, arranging the start time and the end time of all the behaviors to form a time axis, obtaining a time domain corresponding to each behavior on the time axis according to the start time and the end time of the behaviors, and constructing a traveling information time sequence tree through inclusion relations among the time domains, wherein fig. 2 is the time axis corresponding to the traveling process, and the traveling information time sequence tree corresponding to the time axis is shown in fig. 3.
Each node of the travel information time sequence tree comprises the starting time and the ending time of one action, and the starting time contained in the root node of the travel information time sequence tree is recorded as the starting time of the travel process corresponding to the travel information time sequence tree.
As shown in fig. 3, the root node in the tree represents the start time and the end time of the entire travel route, typically the departure time of the vehicles on the way and the arrival time of the vehicles on the way. And the intermediate itinerary includes the check-in and check-out time of each hotel and the start time and the end time of other itineraries such as meals performed when the hotel is checked, and as can be seen from the time axes of all the acts, if the start time of the act a is after the start time of the act B, and the end time of the act a is before the end time of the act B, and there are start times and end times of other acts between the start time of the act a and the start time of the act B and between the end time of the act a and the end time of the act B, then on the travel information timing tree, the act a is a subordinate node of the node to which the act B belongs, that is, the act a and the act B are in a strict inclusion relationship, that is, there is no case that the act B includes the act C.
From the above description, the root node in fig. 3 is set as a level 1 node, the lower nodes of the root node are level 2 nodes, and so on. Fig. 2 shows time periods represented on a time axis under ideal conditions of time nodes at various levels, and in actual conditions, the time periods may not necessarily be end-to-end, unrecorded time gaps may exist, and the time gaps do not affect subsequent calculation.
And S003, obtaining attention weights of all the travel information time sequence trees according to the time difference between the login time and the starting time of the travel information time sequence trees.
It should be noted that, because the login authentication is performed according to the memory accuracy of the user on the historical travel information, in order to ensure the authentication integrity of the travel information memorized by the user and the historical travel information matching to the maximum extent, the attention weight of the travel information time sequence tree of each travel is determined according to the time span of the starting time of each historical travel relative to the login time.
1. And obtaining the attention degree of all the travel information time sequence trees according to the time difference between the login time and the starting time of the travel information time sequence trees.
The travel information time sequence tree of all travel processes in a preset range before the login time is displayed, the preset range is 1 year in the embodiment, and in other embodiments, implementers can set the preset range as required. Arranging according to the time difference between the login time and the starting time of the travel process from small to large, and calculating the attention degree of each travel information time sequence tree, wherein the first step is
Figure 261973DEST_PATH_IMAGE001
The calculation formula of the attention degree of the travel information time sequence tree is as follows:
Figure 15165DEST_PATH_IMAGE006
in the formula (I), the compound is shown in the specification,
Figure 896533DEST_PATH_IMAGE004
is shown as
Figure 127795DEST_PATH_IMAGE001
The degree of interest in the individual travel information timing tree,
Figure 526021DEST_PATH_IMAGE007
is shown as
Figure 450115DEST_PATH_IMAGE001
The starting time of the travel process corresponding to the travel information time sequence tree,
Figure 22042DEST_PATH_IMAGE008
which indicates the time of the login,
Figure 306262DEST_PATH_IMAGE005
representing the number of travel information time sequence trees of all travel processes within a preset range before the login time,
Figure 811192DEST_PATH_IMAGE009
indicates the time of registration and
Figure 906187DEST_PATH_IMAGE001
the smaller the time difference is, the greater the attention degree of the travel information time sequence tree is.
2. And obtaining the attention weight of the travel information time sequence tree according to the attention degree of the travel information time sequence tree.
First, the
Figure 762148DEST_PATH_IMAGE001
The calculation formula of the attention weight of the travel information time sequence tree is as follows:
Figure 85944DEST_PATH_IMAGE002
in the formula (I), the compound is shown in the specification,
Figure 710960DEST_PATH_IMAGE003
is shown as
Figure 976857DEST_PATH_IMAGE001
The weight of interest of the individual travel information timing tree,
Figure 320113DEST_PATH_IMAGE004
is shown as
Figure 414977DEST_PATH_IMAGE001
The degree of interest in the individual travel information timing tree,
Figure 894500DEST_PATH_IMAGE005
and the number of the travel information time sequence trees of all the travel processes in a preset range before the login time is represented. In order to ensure the authentication integrity of the matching between the travel information memorized by the user and the historical travel information to the maximum extent, the closer the travel route represented by the travel information time sequence tree is to the login time, the larger the attention weight of the travel information time sequence tree is.
And S004, obtaining the importance degree of the node according to the level of the node and the number of the nodes at the same level, and obtaining the weight of the node according to the attention weight of the travel information time sequence tree corresponding to the node and the importance degree of the node.
It should be noted that, since the login authentication is performed according to the memory accuracy of the user on the historical travel information, in order to perform the login authentication on the user better, the weights of all the nodes are set according to the detail information in the travel information time sequence tree corresponding to each historical travel.
1. And obtaining the importance degree of the node according to the level of the node and the number of the nodes in the same level.
It should be noted that, for any travel information timing tree, nodes at each level also have different attention weights, because the information in the root node is the start time and the end time of the whole trip, the attention weight should be smaller, and the larger the level number of the node is, the more detailed formation in the trip is described, and the node has a certain characteristic, so the importance degree of the node is obtained according to the level of the node and the number of the nodes at the same level.
In this embodiment, the first
Figure 331298DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 909653DEST_PATH_IMAGE010
The calculation formula of the importance degree of the node is as follows:
Figure 824519DEST_PATH_IMAGE011
in the formula (I), the compound is shown in the specification,
Figure 424128DEST_PATH_IMAGE012
is shown as
Figure 31827DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 333364DEST_PATH_IMAGE010
The degree of importance of the node(s),
Figure 255184DEST_PATH_IMAGE013
denotes the first
Figure 709299DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 238631DEST_PATH_IMAGE010
The number of the nodes of (a) is,
Figure 778197DEST_PATH_IMAGE014
is shown as
Figure 300445DEST_PATH_IMAGE001
Maximum level of all nodes of the travel information timing tree. In order to better perform login authentication on a user, the more detailed information is information corresponding to a node, the greater the importance degree of the node is, and the greater the weight of the node is.
2. And obtaining the weight of the node according to the attention weight of the travel information time sequence tree corresponding to the node and the importance degree of the node.
In this embodiment, the first
Figure 609067DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 73415DEST_PATH_IMAGE010
The calculation formula of the weight of the node is as follows:
Figure 834698DEST_PATH_IMAGE015
in the formula (I), the compound is shown in the specification,
Figure 160637DEST_PATH_IMAGE016
is shown as
Figure 323765DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 203689DEST_PATH_IMAGE010
The weight value of the node(s) of (c),
Figure 717847DEST_PATH_IMAGE003
is shown as
Figure 581898DEST_PATH_IMAGE001
The weight of interest of the individual travel information timing tree,
Figure 599533DEST_PATH_IMAGE012
denotes the first
Figure 608946DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 344821DEST_PATH_IMAGE010
The importance of the node.
It should be noted that, the weights of the travel information nodes at the same level on the same travel information timing tree are the same.
S005, acquiring the matching degree of the nodes according to two times input by a user; and calculating the authentication integrity of the user according to the matching degrees and the weights of all nodes on all the travel information time sequence trees.
1. And acquiring the matching degree of the nodes according to the two times input by the user.
After a user inputs a correct account and a correct password, the travel management system sequentially traverses all nodes of all travel information time sequence trees, a pop-up window is arranged according to the location information of each node, and the user inputs two times according to the location information on the pop-up window and the memory of the user, wherein one time is the start time in the memory, and the other time is the end time in the memory.
Recording time domains of two times input by a user on a time axis as a first time domain, recording time domains of the start time and the end time of the node on the time axis as a second time domain, and recording the intersection ratio of the first time domain and the second time domain as the matching degree of the node.
2. And calculating the authentication integrity of the user according to the matching degrees and the weights of all nodes on all the travel information time sequence trees.
In this embodiment, the authentication integrity of the user is calculated according to the matching degrees and the weights of all nodes on all the travel information timing trees, and the specific calculation formula is as follows:
Figure 746983DEST_PATH_IMAGE020
in the formula (I), the compound is shown in the specification,
Figure 635436DEST_PATH_IMAGE018
the degree of integrity of the authentication is indicated,
Figure 363220DEST_PATH_IMAGE005
representing the number of all travel information timing trees,
Figure 320812DEST_PATH_IMAGE014
is shown as
Figure 57824DEST_PATH_IMAGE001
The maximum level of all nodes of the travel information timing tree,
Figure 299318DEST_PATH_IMAGE019
is shown as
Figure 932425DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 642892DEST_PATH_IMAGE010
The degree of matching of the nodes of (a),
Figure 652436DEST_PATH_IMAGE016
is shown as
Figure 246972DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 316559DEST_PATH_IMAGE010
The weight of the node of (c). Integrity of authentication
Figure DEST_PATH_IMAGE021
Is a normalized value having a minimum value of 0 and a maximum value of 1, and thus, authentication integrity
Figure 170115DEST_PATH_IMAGE021
The closer to 1, the more complete the authentication, and the incomplete authentication.
The invention generates verification problems according to the historical travel information of the user, the historical travel information is stored in the system and is not disclosed, so the historical travel information is not easy to be cracked directly by the script.
And S006, completing the man-machine verification of the login user according to the authentication integrity of the user.
If the authentication integrity of the travel information is greater than the verification threshold, the verification is passed; if the user does not pass the verification for more than three times, the travel management system pops up the two-dimensional code to carry out the verification of the mobile phone end, and the verification mode of the mobile phone end can be set as face login. In the present embodiment, the verification threshold is 0. In other embodiments, the validation threshold may be set by the implementer as desired.
In summary, the present invention obtains all travel information timing trees, obtains the attention weight of the travel information timing tree according to the login time and the start time of the travel information timing tree, obtains the importance degree of the node according to the level of the node and the number of the nodes at the same level, and obtains the weight of the node according to the attention weight of the travel information timing tree and the importance degree of the node; acquiring the matching degree of the nodes according to two times input by a user; calculating the authentication integrity of the user according to the matching degrees of all nodes on all the travel information time sequence trees; and finishing the man-machine verification of the login user according to the authentication integrity of the user. According to the invention, login and user authentication operations are carried out according to the memory accuracy of the user to the historical travel information, and because the historical travel information is only stored in the system and is not disclosed, the man-machine verification cannot be cracked by a script program.
It should be noted that: the precedence order of the above embodiments of the present invention is only for description, and does not represent the merits of the embodiments. And that specific embodiments have been described above. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments.
The above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; the modifications or substitutions do not make the essence of the corresponding technical solutions deviate from the technical solutions of the embodiments of the present application, and are included in the protection scope of the present application.

Claims (8)

1. A business trip management system login authentication method is characterized by comprising the following steps:
acquiring historical travel data of a login user, and constructing all travel information time sequence trees according to all the historical travel data;
acquiring all travel information time sequence trees within a preset range before a login time, and acquiring the attention weight of any travel information time sequence tree according to the time difference between the login time and the starting time of the travel information time sequence tree; obtaining attention weights of all travel information time sequence trees;
for any node on the travel information time sequence tree, obtaining the importance degree of the node according to the level of the node and the number of the nodes at the same level, and obtaining the weight of the node according to the attention weight of the travel information time sequence tree corresponding to the node and the importance degree of the node; obtaining the weights of all nodes of all travel information time sequence trees;
after a user inputs a correct account and a correct password, for any node on any travel information time sequence tree, the user inputs two times according to the location information of the node, and the matching degree of the node is obtained according to the two input times; calculating the authentication integrity of the user according to the matching degrees and weights of all nodes on all the travel information time sequence trees;
and finishing the man-machine verification of the login user according to the authentication integrity of the user.
2. The method of claim 1, wherein the step of constructing a time sequence tree of all travel information according to all historical travel data comprises:
for any travel process, the starting time and the ending time of all behaviors in the travel process are obtained, the starting time and the ending time of all the behaviors are arranged to form a time axis, the time domain corresponding to each behavior on the time axis is obtained according to the starting time and the ending time of the behaviors, a travel information time sequence tree is constructed through the inclusion relationship among the time domains, each node of the travel information time sequence tree comprises the starting time and the ending time of one behavior, and the starting time contained in the root node of the travel information time sequence tree is recorded as the starting time of the travel process corresponding to the travel information time sequence tree.
3. The method of claim 1, wherein the step of obtaining the attention weight of the travel information timing tree according to the time difference between the login time and the starting time of the travel information timing tree comprises:
arranging the travel information time sequence trees of all travel processes in a preset range before the login time according to the time difference between the login time and the starting time of the travel processes from small to large, and
Figure 740536DEST_PATH_IMAGE001
when the individual is travelingThe calculation formula of the attention weight of the order tree is as follows:
Figure 80513DEST_PATH_IMAGE002
in the formula (I), the compound is shown in the specification,
Figure 329091DEST_PATH_IMAGE003
denotes the first
Figure 458721DEST_PATH_IMAGE001
The weight of interest of the individual travel information timing tree,
Figure 991203DEST_PATH_IMAGE004
is shown as
Figure 485769DEST_PATH_IMAGE001
The degree of interest in the individual travel information timing tree,
Figure 221644DEST_PATH_IMAGE005
and the number of the travel information time sequence trees of all travel processes in a preset range before the login time is represented.
4. The method of claim 3, wherein the step of calculating the attention degree of the travel information timing tree comprises:
first, the
Figure 902768DEST_PATH_IMAGE001
The calculation formula of the attention degree of the travel information time sequence tree is as follows:
Figure 40488DEST_PATH_IMAGE006
in the formula (I), the compound is shown in the specification,
Figure 705956DEST_PATH_IMAGE004
denotes the first
Figure 178394DEST_PATH_IMAGE001
The degree of interest in the individual travel information timing tree,
Figure DEST_PATH_IMAGE007
is shown as
Figure 118668DEST_PATH_IMAGE001
The starting time of the travel process corresponding to the travel information time sequence tree,
Figure 64890DEST_PATH_IMAGE008
which indicates the time of the login,
Figure 432417DEST_PATH_IMAGE009
indicates the time of registration and
Figure 860993DEST_PATH_IMAGE001
the time difference of the start time of the individual travel information timing tree,
Figure 604959DEST_PATH_IMAGE005
and the number of the travel information time sequence trees of all the travel processes in a preset range before the login time is represented.
5. The method of claim 1, wherein the step of obtaining the importance of the node according to the level of the node and the number of nodes at the same level comprises:
first, the
Figure 717271DEST_PATH_IMAGE001
The level of the travel information time sequence tree is
Figure 521279DEST_PATH_IMAGE010
Of the nodeThe calculation formula is as follows:
Figure 744143DEST_PATH_IMAGE011
in the formula (I), the compound is shown in the specification,
Figure 291799DEST_PATH_IMAGE012
denotes the first
Figure 258618DEST_PATH_IMAGE001
The level of the travel information time sequence tree is
Figure 499106DEST_PATH_IMAGE010
The degree of importance of the node(s),
Figure DEST_PATH_IMAGE013
denotes the first
Figure 636695DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 988042DEST_PATH_IMAGE010
The number of the nodes of (a) is,
Figure 809368DEST_PATH_IMAGE014
denotes the first
Figure 174752DEST_PATH_IMAGE001
Maximum level of all nodes of the travel information timing tree.
6. The method of claim 1, wherein the step of obtaining the weights of the nodes according to the attention weights of the travel information timing trees corresponding to the nodes and the importance degrees of the nodes comprises:
first, the
Figure 81528DEST_PATH_IMAGE001
The level of the travel information time sequence tree is
Figure 970987DEST_PATH_IMAGE010
The calculation formula of the weight of the node is as follows:
Figure 161666DEST_PATH_IMAGE015
in the formula (I), the compound is shown in the specification,
Figure 743957DEST_PATH_IMAGE016
is shown as
Figure 138029DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 96758DEST_PATH_IMAGE010
The weight value of the node of (a),
Figure 374899DEST_PATH_IMAGE003
is shown as
Figure 128091DEST_PATH_IMAGE001
The weight of interest of the individual travel information timing tree,
Figure 9460DEST_PATH_IMAGE012
is shown as
Figure 506300DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 405992DEST_PATH_IMAGE010
The importance of the node.
7. The method of claim 1, wherein the step of obtaining the matching degree of the node according to the two input times comprises:
the time domain of two times input by a user on a time axis is recorded as a first time domain, the time domain of the starting time and the ending time of a node on the time axis is recorded as a second time domain, and the intersection ratio of the first time domain and the second time domain is recorded as the matching degree of the node.
8. The method of claim 1, wherein the step of calculating the integrity of the user's authentication according to the matching degree and the weight of all nodes on all travel information timing trees comprises:
Figure 64506DEST_PATH_IMAGE017
in the formula (I), the compound is shown in the specification,
Figure 636433DEST_PATH_IMAGE018
the degree of integrity of the authentication is indicated,
Figure 422118DEST_PATH_IMAGE005
representing the number of all travel information timing trees,
Figure 192628DEST_PATH_IMAGE014
denotes the first
Figure 22043DEST_PATH_IMAGE001
The maximum level of all nodes of the travel information timing tree,
Figure 878004DEST_PATH_IMAGE019
is shown as
Figure 965914DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 590931DEST_PATH_IMAGE010
The degree of matching of the nodes of (a),
Figure 856827DEST_PATH_IMAGE016
is shown as
Figure 934505DEST_PATH_IMAGE001
The rank of the travel information time sequence tree is
Figure 324641DEST_PATH_IMAGE010
The weight of the node of (c).
CN202211276250.9A 2022-10-19 2022-10-19 Login authentication method for travel management system Active CN115344842B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211276250.9A CN115344842B (en) 2022-10-19 2022-10-19 Login authentication method for travel management system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211276250.9A CN115344842B (en) 2022-10-19 2022-10-19 Login authentication method for travel management system

Publications (2)

Publication Number Publication Date
CN115344842A true CN115344842A (en) 2022-11-15
CN115344842B CN115344842B (en) 2023-04-21

Family

ID=83957030

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211276250.9A Active CN115344842B (en) 2022-10-19 2022-10-19 Login authentication method for travel management system

Country Status (1)

Country Link
CN (1) CN115344842B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140172867A1 (en) * 2012-12-17 2014-06-19 General Electric Company Method for storage, querying, and analysis of time series data
CN110457365A (en) * 2019-07-15 2019-11-15 中国平安人寿保险股份有限公司 Based on the parallel decision tree generation method of timing and device, electronic equipment
US20200092284A1 (en) * 2018-09-19 2020-03-19 Alibaba Group Holding Limited Authentication method and system
CN111143981A (en) * 2019-12-18 2020-05-12 北京临近空间飞艇技术开发有限公司 Virtual test model verification system and method
AU2020202793A1 (en) * 2017-09-29 2020-05-21 Leverage Rock Llc Scalable distributed ledger system, transaction privacy and combating fraud, theft and loss
CN113326442A (en) * 2020-11-17 2021-08-31 崔海燕 Recommended material pushing method and system based on big data positioning and cloud computing center
CN113407342A (en) * 2021-06-23 2021-09-17 航天科工智能运筹与信息安全研究院(武汉)有限公司 Trusted computing node dynamic management method under cloud environment

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140172867A1 (en) * 2012-12-17 2014-06-19 General Electric Company Method for storage, querying, and analysis of time series data
AU2020202793A1 (en) * 2017-09-29 2020-05-21 Leverage Rock Llc Scalable distributed ledger system, transaction privacy and combating fraud, theft and loss
US20200092284A1 (en) * 2018-09-19 2020-03-19 Alibaba Group Holding Limited Authentication method and system
CN110457365A (en) * 2019-07-15 2019-11-15 中国平安人寿保险股份有限公司 Based on the parallel decision tree generation method of timing and device, electronic equipment
CN111143981A (en) * 2019-12-18 2020-05-12 北京临近空间飞艇技术开发有限公司 Virtual test model verification system and method
CN113326442A (en) * 2020-11-17 2021-08-31 崔海燕 Recommended material pushing method and system based on big data positioning and cloud computing center
CN113407342A (en) * 2021-06-23 2021-09-17 航天科工智能运筹与信息安全研究院(武汉)有限公司 Trusted computing node dynamic management method under cloud environment

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
AMIT KUMARBAIRWA ER AL.: "Mutual authentication of nodes using session token with fingerprint and MAC address validation", 《EGYPTIAN INFORMATICS JOURNAL》 *
吴重光等: "SDG故障诊断模型的检验和验证", 《北京化工大学学报(自然科学版)》 *
徐志熹等: "融合时序的决策树推荐算法研究", 《现代计算机》 *
王凌宇等: "基于多分支树结构的电力缴费终端数据完整性验证方案", 《重庆邮电大学学报(自然科学版)》 *
赵艳妮等: "基于路径权重的XML文档相似度仿真研究", 《计算机技术与发展》 *

Also Published As

Publication number Publication date
CN115344842B (en) 2023-04-21

Similar Documents

Publication Publication Date Title
Lempert et al. Managing the risk of uncertain threshold responses: comparison of robust, optimum, and precautionary approaches
KR101238081B1 (en) User authentication device, user authentication method, and computer-readable recording medium having user authentication program
CN110309587A (en) Decision model construction method, decision-making technique and decision model
KR101752540B1 (en) Utilizing a social graph for network access and admission control
CN109104413A (en) The method and verification method that private data for multi-party computations seeks common ground
CN111932262B (en) Methods, computing devices, and media for identifying transaction risk with respect to consumption credentials
CN105260628A (en) Classifier training method and device and identity verification method and system
CN110009322A (en) Auth method and device in transfer procedure
CN106202270A (en) Interactive method based on natural language and device
CN105022939B (en) Information Authentication method and device
CN110011932A (en) A kind of the net flow assorted method and terminal device of recognizable unknown flow rate
CN105897704A (en) Authority adding method, device, and system, and authority addition requesting method and device
CN109831310A (en) A kind of auth method, system and relevant apparatus
CN108038361A (en) Dual system recognition methods, mobile terminal and storage medium based on vocal print
KR102424507B1 (en) Method of operating golf team matching platform that prevents user-customized team matching and rounding no-shows based on artificial intelligence and location information technology
CN115344842A (en) Login authentication method for business trip management system
CN112910953B (en) Business data pushing method and device and server
CN104965846A (en) Virtual human establishing method on MapReduce platform
CN112131544A (en) Shell script method for user management of springboard machine
CN109617901A (en) Determine the method and device thereof of white list
CN109739626A (en) A kind of workflow engine and the access control method based on workflow engine
CN115526315A (en) Generation method and device of rating card model
US10181229B2 (en) Method and system for implementing a universal key card
EP3842966A1 (en) Identifying a user from the sequence of windows opened on a user interface
CN110336840A (en) Third party's account register method and system for voice dialogue platform

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
PE01 Entry into force of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: A Login Authentication Method for Travel Management System

Effective date of registration: 20230824

Granted publication date: 20230421

Pledgee: Taiping Property Insurance Co.,Ltd. Qingdao Branch

Pledgor: Yiqi business travel (Shandong) Technology Service Co.,Ltd.

Registration number: Y2023370010093