CN116436965B

CN116436965B - Event processing system based on block chain

Info

Publication number: CN116436965B
Application number: CN202310692937.9A
Authority: CN
Inventors: 肖源; 黄尹旭; 杨东; 袁勇; 杨翰方
Original assignee: Renmin University of China
Current assignee: Renmin University of China
Priority date: 2023-06-13
Filing date: 2023-06-13
Publication date: 2023-09-01
Anticipated expiration: 2043-06-13
Also published as: CN116436965A

Abstract

The application provides an event processing system based on a block chain, which relates to the field of block chains, and comprises: the system comprises a block chain data storage server, an event processing server and a plurality of carrier devices, wherein the event processing server and the carrier devices are connected with the block chain data storage server; the block chain data storage server stores a ciphertext carrier identification list A; the event processing server is configured to perform: acquiring target event information WF corresponding to a target event; obtaining target travel information MC from a blockchain data storage server according to WPK (WB) and WT; if WPK (WQ) is not equal to MPK (MQ), if the event occurrence position of the target event is not at the edge position of the geographic area corresponding to WQ, risk prompt information is sent to carrier equipment corresponding to MC.

Description

Event processing system based on block chain

Technical Field

The present application relates to the field of blockchain, and in particular, to a blockchain-based event processing system.

Background

With the development of technology, many events can be automatically processed by an electronic system, such as vehicle violation detection, and violation event establishment. But the automatically established event is erroneous because the event parameters of part of the event may be modified unauthorized. For example, owners of vehicles forge license plates of other vehicles by themselves and place the license plates on their own vehicles. Thus, after the traffic violation event is generated by the vehicle using the fake license plate, the violation event automatically established by the electronic system is associated with the real vehicle of the vehicle owner, and the accuracy of the automatic establishment of the violation event is certainly caused.

Disclosure of Invention

Accordingly, the present application is directed to a blockchain-based event processing system that at least partially addresses the problems of the prior art.

In one aspect of the present application, there is provided a blockchain-based event processing system, comprising: the system comprises a blockchain data storage server, an event processing server and a plurality of carrier devices, wherein the event processing server and the carrier devices are connected with the blockchain data storage server.

The blockchain data storage server stores a ciphertext carrier identification list a= (PK 1 (B1), PK2 (B2), …, PKi (Bi), …, PKn (Bn)), i=1, 2, …, n; the PKi (Bi) is a ciphertext obtained by homomorphic encrypting the carrier identifier Bi of the ith carrier device by using the homomorphic public key PKi () of the ith carrier device.

PKi (Bi) has a corresponding travel information list ci= (Ci 1, ci2, …, cij, …, cif (i)), cij= (Tij, PKi (Qij)), j=1, 2, …, f (i); the Cij is the jth travel information uploaded by the carrier device corresponding to Bi, tij is the uploading time of the Cij, and PKi (Qij) is the ciphertext obtained by homomorphic encryption of the geographical area identifier Qij of the carrier device corresponding to Bi when the Cij is uploaded by using PKi ().

The event processing server is used for executing the following steps:

s100, acquiring target event information WF= (WB, WT, WQ) corresponding to a target event; wherein WB is a carrier identifier of a carrier device corresponding to the target event, WT is event occurrence time of the target event, and WQ is a geographic region identifier corresponding to an event occurrence position of the target event.

S200, acquiring target travel information mc= (MT, MPK (MQ)) from the blockchain data storage server according to WPK (WB) and WT; the WPK () is a homomorphic public key corresponding to WB stored in the event processing server; WPK (WB) is ciphertext obtained by homomorphic encryption of WB by using WPK (); MC is the travel information with the minimum uploading time and WT interval time in the travel information with the same identifier as WPK (WB) of all corresponding ciphertext carriers; MPK () is a homomorphic public key corresponding to the target trip information, MPK () =wpk (); MT is the uploading time corresponding to MC, MPK (MQ) is the geographical area identifier MQ corresponding to MC by MPK () is the ciphertext obtained after homomorphic encryption.

S300, if WPK (WQ) is not equal to MPK (MQ), determining whether the event occurrence position of the target event is at the edge position of the geographic area corresponding to WQ; WPK (WQ) is an arrival ciphertext obtained by homomorphically encrypting WQ using WPK ().

S400, if the event occurrence position of the target event is not at the edge position of the geographic area corresponding to the WQ, sending risk prompt information to the carrier equipment corresponding to the MC.

According to the event processing system based on the blockchain, after the event processing server acquires the target event information corresponding to the target event, the event processing server acquires the homomorphic public key WPK (), corresponding to the WB, stored in the event processing server according to the WB, and encrypts the WB to obtain the WPK (WB). The MC is then retrieved from the blockchain data storage server in accordance with WPK (WB). Since the ciphertext carrier identifier corresponding to MC is identical to WPK (WB), it can be determined that the plaintext carrier identifier corresponding to MC is identical to WB. After obtaining the MC, the event processing server determines whether WPK (WQ) and MPK (MQ) are the same, if not, it may determine that the position of the carrier device corresponding to the MC and the event occurrence position of the target event are respectively in different geographical areas when the uploading time of the MC is different, and because the MC is the travel information with the minimum interval time between the uploading time and the WT in the travel information with the same identifier of all the corresponding ciphertext carriers as the WPK (WB), if the carrier device corresponding to the target event and the carrier device corresponding to the MC are the same carrier device, the possibility that the position of the carrier device corresponding to the MC and the event occurrence position of the target event are in the same local area when the uploading time of the MC is greater. If the vehicle equipment is located in different geographical areas and the event occurrence position of the target event is not located at the edge position of the geographical area corresponding to the WQ, the distance between the two points is far, and the vehicle equipment which can be considered to generate the target event is not the vehicle equipment which is actually supposed to correspond to the WB, namely the fake-licensed vehicle is possible, and at the moment, risk prompt information can be sent to the vehicle equipment corresponding to the MC to prompt the owner of the vehicle equipment.

Further, in the embodiment of the present application, since each carrier device needs to upload the respective trip information to the blockchain data storage server, the trip information is data-uplink. The characteristic of the blockchain is that each participating device can access all data on the blockchain, so in the embodiment of the application, in the travel information uploaded by the carrier device, the area identifier, the latitude and the longitude are encrypted by using the homomorphic public key uniquely corresponding to the area identifier, and the homomorphic private key for decryption is only stored by itself, so that the private information of the user is prevented from being revealed.

Further, when the event processing server obtains the target trip information, the obtained area identifier, longitude and latitude are also ciphertext, but because the homomorphic public keys are the same, the encrypted data can be directly compared (such as WPK (WQ) and MPK (MQ)), so that whether the encrypted data are in the same area can be judged without obtaining plaintext data. The possibility of disclosure of the private information is further reduced.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.

FIG. 1 is a block diagram of a block chain based event processing system according to an embodiment of the present application.

FIG. 2 is a flowchart illustrating steps performed by an event processing server in a blockchain-based event processing system according to an embodiment of the present application.

FIG. 3 is a flowchart illustrating steps performed by an event processing server in a blockchain-based event processing system according to another embodiment of the present application.

FIG. 4 is a flowchart illustrating steps performed by an event processing server in a blockchain-based event processing system according to another embodiment of the present application.

Detailed Description

Embodiments of the present application will be described in detail below with reference to the accompanying drawings.

It should be noted that, without conflict, the following embodiments and features in the embodiments may be combined with each other; and, based on the embodiments in this disclosure, all other embodiments that may be made by one of ordinary skill in the art without inventive effort are within the scope of the present disclosure.

It is noted that various aspects of the embodiments are described below within the scope of the following claims. It should be apparent that the aspects described herein may be embodied in a wide variety of forms and that any specific structure and/or function described herein is merely illustrative. Based on the present disclosure, one skilled in the art will appreciate that one aspect described herein may be implemented independently of any other aspect, and that two or more of these aspects may be combined in various ways. For example, an apparatus may be implemented and/or a method practiced using any number of the aspects set forth herein. In addition, such apparatus may be implemented and/or such methods practiced using other structure and/or functionality in addition to one or more of the aspects set forth herein.

Referring to fig. 1-4, in one aspect of the present application, a blockchain-based event processing system is provided, comprising: the system comprises a blockchain data storage server, an event processing server and a plurality of carrier devices, wherein the event processing server and the carrier devices are connected with the blockchain data storage server. The vehicle device may refer to a vehicle, or may be a vehicle-mounted device in the vehicle. The event processing server may be a traffic violation event processing server.

Each carrier device is provided with a unique corresponding carrier identifier, and a homomorphic public key and a homomorphic private key which are uniquely corresponding to the carrier device are stored in each carrier device; and the event processing server stores the carrier identifier and homomorphic public key corresponding to each carrier device. Specifically, the carrier identifier may be a license plate number.

The blockchain data storage server stores a ciphertext carrier identification list a= (PK 1 (B1), PK2 (B2), …, PKi (Bi), …, PKn (Bn)), i=1, 2, …, n; the method comprises the steps that PKi (Bi) is ciphertext obtained by homomorphic encryption of carrier identifiers Bi of an ith carrier device by using homomorphic public keys PKi () of the ith carrier device, namely Bi is the carrier identifier of the ith carrier device, PKi () is the homomorphic public key of the ith carrier device, PKi (Bi) is the ciphertext carrier identifier corresponding to Bi, and n is the number of the carrier devices. Those skilled in the art will appreciate that if PKi () is a public key, PKi (X) represents the ciphertext obtained by encrypting X using PKi (). Hereinafter, similar writing methods will be known to those skilled in the art as to their specific meaning.

PKi (Bi) has a corresponding travel information list ci= (Ci 1, ci2, …, cij, …, cif (i)), cij= (Tij, PKi (Qij)), j=1, 2, …, f (i); the method comprises the steps that Cij is the jth travel information uploaded by carrier equipment corresponding to Bi, tij is the uploading time of the Cij, and PKi (Qiaj) is ciphertext obtained by homomorphic encryption of a geographic area identifier Qiaj of the position of the carrier equipment corresponding to Bi when the Cij is uploaded by PKi ();

specifically, in this embodiment, the geographical area may be divided according to the formation area, for example, if the geographical area is a city level area, the geographical area may be divided by "district" as a unit, and if the geographical area is a county level area, one county level area may be regarded as one geographical area. Accordingly, according to this region division rule, in this embodiment. The time interval between the uploading time corresponding to any two adjacent journey information in Ci is a preset time interval. The preset time interval is within the range of 5 minutes to 30 minutes. That is, the carrier device will upload the current trip information once every preset time interval, and in this embodiment, the range of values of the preset time interval from 5 minutes to 30 minutes is correspondingly designed according to the region division rule, if the trip information is uploaded sequentially at the preset time interval, the geographic regions corresponding to the two times of trip information that are adjacent with high probability are the same unless at the edge position of the geographic region. Thereby increasing the accuracy of subsequent processing. Preferably, in this embodiment, the preset time interval is 15 minutes. Therefore, the uploading frequency of the carrier equipment can be guaranteed not to cause waste of communication resources and storage resources too fast.

Referring to fig. 2, the event processing server is configured to perform the following steps:

s100, acquiring target event information WF= (WB, WT, WQ) corresponding to a target event; wherein WB is a carrier identifier of a carrier device corresponding to the target event, WT is event occurrence time of the target event, and WQ is a geographic region identifier corresponding to an event occurrence position of the target event. In this embodiment, the target event may be a traffic violation event, and the target event information may be automatically uploaded by the traffic system through a monitoring facility, or may be manually input by a related staff. The event occurrence position of the target event is the position for generating the traffic violation event.

In particular, the MC may be determined by the blockchain data storage server based on WPK (WB) and WT. A specific determination method may be that the blockchain data storage server traverses a according to WPK (WB), and if PKi (Bi) =wpk (WB), PKi () =wpk (), and bi=wb may be determined. At this time, ci corresponding to PKi (Bi) may be determined as the target travel information list. And then, according to the WT and each uploading time in the Ci, determining travel information of the uploading time with the smallest absolute value of the difference as MC.

S300, if WPK (WQ) +.MPK (MQ), determining whether the event occurrence position of the target event is at the edge position of the geographic area corresponding to WQ. WPK (WQ) is an arrival ciphertext obtained by homomorphically encrypting WQ using WPK ().

Specifically, the edge position is a position where the area edge of the geographic area corresponding to the WQ is smaller than a preset distance (e.g., 1 KM). Those skilled in the art can determine whether the event occurrence position of the target event is at the edge position of the geographic area corresponding to WQ through the latitude and longitude coordinates of the edge of the area, WX and WY, which are not described herein.

The risk prompting information is used for prompting an owner of the carrier equipment corresponding to the MC, and the carrier identification of the carrier equipment possibly has the risk of being applied by unauthorized, namely, the carrier equipment possibly is possibly sleeved by other vehicles.

Referring to fig. 3, in an exemplary embodiment of the present application, cij= (Tij, PKi (Qij)) is replaced with cij= (Tij, PKi (Qij), PKi (Xij), PKi (Yij)); PKi (Xij) is ciphertext obtained by homomorphic encryption of latitude Xij of a position where the carrier device corresponding to Bi is located when uploading Cij by using PKi (); PKi (YIj) is a ciphertext obtained by homomorphic encryption of longitude YIj of the location of the carrier device corresponding to Bi at the time of uploading Cij by PKi ().

Wf= (WB, WT, WQ) replaced with wf= (WB, WT, WQ, WX, WY); wherein WX is latitude corresponding to the event occurrence position of the target event, and WY is longitude corresponding to the event occurrence position of the target event.

Mc= (MT, MPK (MQ)) is replaced with mc= (MT, MPK (MQ), MPK (MX), MPK (MY)); the MPK (MX) is a ciphertext obtained by homomorphic encryption of the latitude MX corresponding to the MC by using MPK (), and the MPK (MY) is a ciphertext obtained by homomorphic encryption of the longitude MY corresponding to the MC by using MPK ().

After the step S200, the event processing server is further configured to perform the following steps:

s500, if WPK (WQ) =mpk (MQ), obtaining a first ciphertext distance WPK (((MX-WX)) from MPK (MX), MPK (MY), WPK (WX) and WPK (WY) ² +(MY-WY) ² ) ^1/2 )。

Since in the present embodiment, since the homomorphic public key is used in encryption and WPK () =mpk (), WPK (((MX-WX)) is based on the homomorphic encryption feature ² +(MY-WY) ² ) ^1/2 ) Can be calculated by the following formula.

WPK(((MX-WX) ² +(MY-WY) ² ) ^1/2 )=((MPK(MX)-WPK(WX)) ² +(MPK(MX)-WPK(WX)) ² ) ^1/2 。

I.e. WPK (((MX-WX) ² +(MY-WY) ² ) ^1/2 ) Can be obtained without decrypting MPK (MX), MPK (MY). And WPK (((MX-WX) ² +(MY-WY) ² ) ^1/2 ) The plaintext data obtained after decryption should be the distance between the position corresponding to the MC and the event occurrence position of the target event.

S510, WPK (((M)X-WX) ² +(MY-WY) ² ) ^1/2 ) And sending the information to the carrier equipment corresponding to the WB.

S520, receiving a first clear text distance L1 returned by the carrier equipment corresponding to WB; wherein L1 is WPK (((MX-WX)) of the carrier device corresponding to WB by using the homomorphic private key stored by the carrier device itself ² +(MY-WY) ² ) ^1/2 ) And (5) decrypting to obtain the product.

S530, if the predicted speed YV is smaller than a preset speed threshold QV, establishing a correlation event corresponding to WB; wherein yv=l1/|mt-wt|. Specifically, the association event may be a traffic violation punishment event.

In this embodiment, since the event processing server does not store the homomorphic private key corresponding to each carrier device, the ciphertext in the MC cannot be decrypted. At this time, the event processing server may acquire the first ciphertext distance WPK (((MX-WX)) from MPK (MX), MPK (MY), WPK (WX) and WPK (WY) ² +(MY-WY) ² ) ^1/2 ) Then, the information is sent to a real owner of a carrier device corresponding to WB (i.e. MB) for decryption, so as to obtain a distance between two positions, then YV is determined through L1, and in the case that YV < QV (i.e. the carrier device corresponding to MC can reasonably move to an event occurrence position of a target event at WT), it can be determined that the carrier device generating the target event is the carrier device corresponding to MC. So the related event corresponding to WB can be directly generated. Otherwise, if YV > QV, it indicates that the carrier device corresponding to MC cannot move to the event occurrence position of the target event at the time of WT, and at this time, risk prompt information may be sent to the carrier device corresponding to MC.

Further, under normal traffic conditions, the vehicle cannot travel between two positions through a straight line, so that in practical application, the final speed threshold QV (for example, qv=60+20) can be determined according to the road complexity based on the road speed limit (for example, 60 KM/h) of the geographic area corresponding to WQ. Further, one skilled in the art may set different speed thresholds for different geographic areas according to the actual situation.

Further, since the carrier device corresponding to the MC can only be connectedWPK (((MX-WX)) obtained by processing a plurality of ciphertexts is received ² +(MY-WY) ² ) ^1/2 ) The specific data of the MC and the WF are not known, so that the carrier equipment corresponding to the MC does not know how to modify the L1 to avoid the associated event from being established, thereby escaping from punishment, and the carrier equipment corresponding to the MC is reasonably selected only by sending the original L1 to the event processing server, thereby avoiding malicious operation of the carrier equipment corresponding to the MC.

Referring to fig. 4, in an exemplary embodiment of the present application, the step S530 includes:

s531, if L1 is more than or equal to 0 and less than or equal to QL2, entering step S532; otherwise, establishing a correlation event corresponding to the WB; wherein QL2 is the maximum distance between the event occurrence position of the target event and the geographic area corresponding to WQ.

S532, if the predicted speed YV is smaller than the preset speed threshold QV, establishing a correlation event corresponding to WB.

Specifically, QL2 may be the maximum value in the distance between the time occurrence position of the target event and each point of the region edge of the geographic region corresponding to WQ.

In this embodiment, in order to avoid that the carrier device corresponding to the MC modifies L1 too much, which results in that the calculated YV is too large, so as to avoid the penalty (i.e. avoid the establishment of the association event), in this embodiment, it is determined whether the carrier device corresponding to the MC modifies L1 by 0.ltoreq.l1.ltoreq.ql2. If L1 is greater than QL2, it may be directly determined that the carrier device corresponding to MC modifies L1, and at this time, a corresponding association event may be directly established.

In an exemplary embodiment of the present application, after the step S200, the event processing server is further configured to perform the steps of:

s600, if WPK (WQ) =mpk (MQ), the process proceeds to step S510.

S610, obtaining a first ciphertext distance WPK (((MX-WX)) from MPK (MX), MPK (MY), WPK (WX) and WPK (WY) ² +(MY-WY) ² ) ^1/2 )。

S620, according to WPK (SX), WPK (SY), WPK (WX) and WPK (WY), the second ciphertext distance WPK (((SX-WX)) ² +(SY-WY) ² ) ^1/2 ) The method comprises the steps of carrying out a first treatment on the surface of the SX is the latitude of a calibration position randomly acquired by an event processing server, and WPK (SX) is ciphertext obtained by homomorphic encryption of SX by using WPK (); SY is the longitude of the calibration position randomly acquired by the event processing server; WPK (SY) is ciphertext obtained by homomorphic encryption of SY using WPK (). The calibration position is in the geographic area corresponding to WQ.

S630, WPK (((MX-WX)) ² +(MY-WY) ² ) ^1/2 ) And WPK (((SX-WX) ² +(SY-WY) ² ) ^1/2 ) And sending the information to the carrier equipment corresponding to the WB.

S640, receiving a first clear text distance L1 and a second clear text distance L2 returned by the carrier equipment corresponding to the WB; l1 is the corresponding carrier device of WB using the homomorphic private key pair WPK stored by itself (((MX-WX)) ² +(MY-WY) ² ) ^1/2 ) Decryption is carried out to obtain the product; l2 is the corresponding carrier device of WB using the homomorphic private key pair WPK stored by itself (((SX-WX)) ² +(SY-WY) ² ) ^1/2 ) And (5) decrypting to obtain the product.

S650, if L2++ ((SX-WX) ² +(SY-WY) ² ) ^1/2 And establishing the association event corresponding to the WB.

In an exemplary embodiment of the present application, after the step S540, the event processing server is further configured to perform the steps of:

s660, if l2= ((SX-WX) ² +(SY-WY) ² ) ^1/2 Step S570 is advanced.

S670, if the predicted speed YV is smaller than a preset speed threshold QV, establishing a correlation event corresponding to WB; wherein yv=l1/|mt-wt|.

In this embodiment, compared to the previous embodiment, a calibration location is randomly selected in the geographic area corresponding to WQ, and WPK (((SX-WX)) is then generated ² +(SY-WY) ² ) ^1/2 ). At this time, the event processing server simultaneously transmits the distances of the two ciphertexts to the carrier device corresponding to the MC, at this time, the carrier device cannot know which distance is the distance between the MC and the target event occurrence position, and the event processing server explicitly knows the correct distance of the L2, at this time, the process proceedsThe operability of the carrier equipment corresponding to the MC for modifying the decrypted plaintext is avoided, and therefore the accuracy of building the association event is further improved.

In an exemplary embodiment of the present application, the step S670 includes:

s671, if 0 is less than or equal to L1 is less than or equal to QL2, then step S672 is entered; otherwise, establishing a correlation event corresponding to the WB; wherein QL2 is the maximum distance between the event occurrence position of the target event and the geographic area corresponding to WQ.

S672, if the predicted speed YV is smaller than the preset speed threshold QV, establishing a correlation event corresponding to WB.

Furthermore, although the steps of the methods in the present disclosure are depicted in a particular order in the drawings, this does not require or imply that the steps must be performed in that particular order or that all illustrated steps be performed in order to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step to perform, and/or one step decomposed into multiple steps to perform, etc.

From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, including several instructions to cause a computing device (may be a personal computer, a server, a mobile terminal, or a network device, etc.) to perform the method according to the embodiments of the present disclosure.

In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.

Those skilled in the art will appreciate that the various aspects of the application may be implemented as a system, method, or program product. Accordingly, aspects of the application may be embodied in the following forms, namely: an entirely hardware embodiment, an entirely software embodiment (including firmware, micro-code, etc.) or an embodiment combining hardware and software aspects may be referred to herein as a "circuit," module "or" system.

An electronic device according to this embodiment of the application. The electronic device is merely an example, and should not impose any limitations on the functionality and scope of use of embodiments of the present application.

The electronic device is in the form of a general purpose computing device. Components of an electronic device may include, but are not limited to: the at least one processor, the at least one memory, and a bus connecting the various system components, including the memory and the processor.

Wherein the memory stores program code that is executable by the processor to cause the processor to perform steps according to various exemplary embodiments of the application described in the "exemplary methods" section of this specification.

The storage may include readable media in the form of volatile storage, such as Random Access Memory (RAM) and/or cache memory, and may further include Read Only Memory (ROM).

The storage may also include a program/utility having a set (at least one) of program modules including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment.

The bus may be one or more of several types of bus structures including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures.

The electronic device may also communicate with one or more external devices (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device, and/or with any device (e.g., router, modem, etc.) that enables the electronic device to communicate with one or more other computing devices. Such communication may be through an input/output (I/O) interface. And, the electronic device may also communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the Internet, through a network adapter. The network adapter communicates with other modules of the electronic device via a bus. It should be appreciated that although not shown, other hardware and/or software modules may be used in connection with an electronic device, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.

From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, including several instructions to cause a computing device (may be a personal computer, a server, a terminal device, or a network device, etc.) to perform the method according to the embodiments of the present disclosure.

In an exemplary embodiment of the present disclosure, a computer-readable storage medium having stored thereon a program product capable of implementing the method described above in the present specification is also provided. In some possible embodiments, the various aspects of the application may also be implemented in the form of a program product comprising program code for causing a terminal device to carry out the steps according to the various exemplary embodiments of the application as described in the "exemplary methods" section of this specification, when said program product is run on the terminal device.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The computer readable signal medium may include a data signal propagated in baseband or as part of a carrier wave with readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Program code for carrying out operations of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., connected via the Internet using an Internet service provider).

Furthermore, the above-described drawings are only schematic illustrations of processes included in the method according to the exemplary embodiment of the present application, and are not intended to be limiting. It will be readily appreciated that the processes shown in the above figures do not indicate or limit the temporal order of these processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, for example, among a plurality of modules.

It should be noted that although in the above detailed description several modules or units of a device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit in accordance with embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into a plurality of modules or units to be embodied.

The foregoing is merely illustrative of the present application, and the present application is not limited thereto, and any changes or substitutions easily contemplated by those skilled in the art within the scope of the present application should be included in the present application. Therefore, the protection scope of the application is subject to the protection scope of the claims.

Claims

1. A blockchain-based event processing system, comprising: the system comprises a block chain data storage server, an event processing server and a plurality of carrier devices, wherein the event processing server and the carrier devices are connected with the block chain data storage server;

the blockchain data storage server stores a ciphertext carrier identification list a= (PK 1 (B1), PK2 (B2), …, PKi (Bi), …, PKn (Bn)), i=1, 2, …, n; the PKi (Bi) is a ciphertext obtained by homomorphic encrypting the carrier identifier Bi of the ith carrier device by using the homomorphic public key PKi () of the ith carrier device;

PKi (Bi) has a corresponding travel information list ci= (Ci 1, ci2, …, cij, …, cif (i)), cij= (Tij, PKi (Qij)), j=1, 2, …, f (i); the method comprises the steps that Cij is the jth travel information uploaded by carrier equipment corresponding to Bi, tij is the uploading time of the Cij, and PKi (Qiaj) is ciphertext obtained by homomorphic encryption of a geographic area identifier Qiaj of the position of the carrier equipment corresponding to Bi when the Cij is uploaded by PKi (); f (i) is the number of pieces of travel information contained in Ci;

the event processing server is used for executing the following steps:

s100, acquiring target event information WF= (WB, WT, WQ) corresponding to a target event; wherein WB is a carrier identifier of carrier equipment corresponding to the target event, WT is event occurrence time of the target event, WQ is a geographic area identifier corresponding to an event occurrence position of the target event;

s200, acquiring target travel information mc= (MT, MPK (MQ)) from the blockchain data storage server according to WPK (WB) and WT; the WPK () is a homomorphic public key corresponding to WB stored in the event processing server; WPK (WB) is ciphertext obtained by homomorphic encryption of WB by using WPK (); MC is the travel information with the minimum uploading time and WT interval time in the travel information with the same identifier as WPK (WB) of all corresponding ciphertext carriers; MPK () is a homomorphic public key corresponding to target travel information, and MPK () is the same as WPK (); MT is the uploading time corresponding to MC, MPK (MQ) is ciphertext obtained by homomorphic encryption of the geographic area identifier MQ corresponding to MC by MPK ();

s300, if WPK (WQ) is not equal to MPK (MQ), determining whether the event occurrence position of the target event is at the edge position of the geographic area corresponding to WQ; WPK (WQ) is ciphertext obtained by homomorphic encryption of WQ by using WPK ();