This application relates to auditing transactions in a blockchain, and more particularly, to filtering and if appropriate, redacting blockchain transactions based on a transaction approval procedure.
In a blockchain, each block contains zero or more transactions. These transactions include data defined, at least in part, by the sender of the transaction. While this data is usually innocuous and relates to the execution of the transaction, it is possible for a malicious user to include data that may be offensive or illegal. Existing blockchains do not have ways of detecting such harmful data included in a transaction. If the transaction is otherwise valid and passes consensus, all blockchain participants will be, in turn, hosting a copy of this data whether it be valid or malicious. Since immutability is a property of blockchains, removing such harmful data from the transaction would be a benefit.
One example embodiment may include a method that comprises one or more of identifying a blockchain transaction, processing content of the blockchain transaction to identify prohibited content, determining whether to approve or disapprove the blockchain transaction based on the content of the blockchain transaction.
Another example embodiment may include a system that comprises a processor and memory, wherein the processor and memory are communicably coupled to one another, wherein the processor is configured to perform one or more of identify a blockchain transaction, process content of the blockchain transaction to identify prohibited content, and determine whether to approve or disapprove the blockchain transaction based on the content of the blockchain transaction.
A further example embodiment may include a non-transitory computer readable medium comprising instructions, that when read by a processor, cause the processor to perform one or more of identifying a blockchain transaction, processing content of the blockchain transaction to identify prohibited content, and determining whether to approve or disapprove the blockchain transaction based on the content of the blockchain transaction.
It will be readily understood that the instant components, as generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of at least one of a method, apparatus, non-transitory computer readable medium and system, as represented in the attached figures, is not intended to limit the scope of the application as claimed, but is merely representative of selected embodiments.
The instant features, structures, or characteristics as described throughout this specification may be combined in any suitable manner in one or more embodiments. For example, the usage of the phrases “example embodiments”, “some embodiments”, or other similar language, throughout this specification refers to the fact that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment. Thus, appearances of the phrases “example embodiments”, “in some embodiments”, “in other embodiments”, or other similar language, throughout this specification do not necessarily all refer to the same group of embodiments, and the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
In addition, while the term “message” may have been used in the description of embodiments, the application may be applied to many types of network data, such as, packet, frame, datagram, etc. The term “message” also includes packet, frame, datagram, and any equivalents thereof. Furthermore, while certain types of messages and signaling may be depicted in exemplary embodiments they are not limited to a certain type of message, and the application is not limited to a certain type of signaling.
Example embodiments provide a process that receives incoming blockchain transactions from various nodes operating on a network. These transactions, which may be financial, can be filtered and/or redacted based on a transaction approval procedure. In other embodiments, other types of blockchain transactions may also be received and processed (filtered and/or redacted) for storage in the blockchain. The transactions are received via an ingress platform which applies filtering based on pre-defined criteria. If the blockchain transaction content of an incoming transaction is suspect based on the filtering, then the message may be quarantined, deleted, forwarded to a computer or an administrator for review or sent back to the transaction originator along with a notification regarding the type of error which was noted and/or logged during the filtering process. In addition, even after transactions are received and logged, another procedure may perform redaction of the transactions in the blockchain based on a further audit process (which may be on-going) that seeks to identify improperly logged transactions.
When redacting a transaction, the data that was originally identified in the transaction may be hidden or blocked from view in the actual committed blockchain transaction. For example, once a transaction is identified as requiring redaction, the transaction may still exist in a block to preserve immutability of that transaction, however, the transaction may be otherwise inaccessible and cannot be accessed or viewed by users. For example, one approach may include placing a contract in a genesis block of the blockchain with code indicating to record redacted transactions. Additionally, by sending a new transaction to the redaction contract identifying a particular blockchain transaction to be redacted, the new transaction may be recorded and a redaction procedure may identify the “improper transaction” as the transaction to be redacted on the blockchain.
There are a number of operations/approaches to limiting improper blockchain transactions. One approach is to filter and discard/stop a transaction prior to the transaction being committed to the blockchain, and possibly redact, if necessary, transactions from blockchain. The offensive/improper transactions can be identified prior to being committed into the blockchain. Another approach is to redact a transaction after it has entered the blockchain. This will not change the immutability property of the blockchain, but instead, provides a way to limit access or hide the transaction so that even though the transaction still exits, it is not accessible or viewable by the users.
Members of the network can select to automatically redact transactions based on a list of noted improper transactions. Once a transaction is added to the list, the peer nodes on the network will no longer expose the contents of the transaction via user API calls. A message will be returned indicating that the transaction has been redacted and is no longer available for public viewing. Peer-to-peer API calls may still include the transaction to maintain the immutability of the blockchain.
The above embodiments may be implemented in hardware, in a computer program executed by a processor, in firmware, or in a combination of the above. A computer program may be embodied on a computer readable medium, such as a storage medium. For example, a computer program may reside in random access memory (“RAM”), flash memory, read-only memory (“ROM”), erasable programmable read-only memory (“EPROM”), electrically erasable programmable read-only memory (“EEPROM”), registers, hard disk, a removable disk, a compact disk read-only memory (“CD-ROM”), or any other form of storage medium known in the art.
An exemplary storage medium may be coupled to the processor such that the processor may read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an application specific integrated circuit (“ASIC”). In the alternative, the processor and the storage medium may reside as discrete components. For example,
As illustrated in
Although an exemplary embodiment of at least one of a system, method, and non-transitory computer readable medium has been illustrated in the accompanied drawings and described in the foregoing detailed description, it will be understood that the application is not limited to the embodiments disclosed, but is capable of numerous rearrangements, modifications, and substitutions as set forth and defined by the following claims. For example, the capabilities of the system of the various figures can be performed by one or more of the modules or components described herein or in a distributed architecture and may include a transmitter, receiver or pair of both. For example, all or part of the functionality performed by the individual modules, may be performed by one or more of these modules. Further, the functionality described herein may be performed at various times and in relation to various events, internal or external to the modules or components. Also, the information sent between various modules can be sent between the modules via at least one of: a data network, the Internet, a voice network, an Internet Protocol network, a wireless device, a wired device and/or via plurality of protocols. Also, the messages sent or received by any of the modules may be sent or received directly and/or via one or more of the other modules.
One skilled in the art will appreciate that a “system” could be embodied as a personal computer, a server, a console, a personal digital assistant (PDA), a cell phone, a tablet computing device, a smartphone or any other suitable computing device, or combination of devices. Presenting the above-described functions as being performed by a “system” is not intended to limit the scope of the present application in any way, but is intended to provide one example of many embodiments. Indeed, methods, systems and apparatuses disclosed herein may be implemented in localized and distributed forms consistent with computing technology.
It should be noted that some of the system features described in this specification have been presented as modules, in order to more particularly emphasize their implementation independence. For example, a module may be implemented as a hardware circuit comprising custom very large scale integration (VLSI) circuits or gate arrays, off-the-shelf semiconductors such as logic chips, transistors, or other discrete components. A module may also be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices, graphics processing units, or the like.
A module may also be at least partially implemented in software for execution by various types of processors. An identified unit of executable code may, for instance, comprise one or more physical or logical blocks of computer instructions that may, for instance, be organized as an object, procedure, or function. Nevertheless, the executables of an identified module need not be physically located together, but may comprise disparate instructions stored in different locations which, when joined logically together, comprise the module and achieve the stated purpose for the module. Further, modules may be stored on a computer-readable medium, which may be, for instance, a hard disk drive, flash device, random access memory (RAM), tape, or any other such medium used to store data.
Indeed, a module of executable code could be a single instruction, or many instructions, and may even be distributed over several different code segments, among different programs, and across several memory devices. Similarly, operational data may be identified and illustrated herein within modules, and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed over different locations including over different storage devices, and may exist, at least partially, merely as electronic signals on a system or network.
It will be readily understood that the components of the application, as generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the detailed description of the embodiments is not intended to limit the scope of the application as claimed, but is merely representative of selected embodiments of the application.
One having ordinary skill in the art will readily understand that the above may be practiced with steps in a different order, and/or with hardware elements in configurations that are different than those which are disclosed. Therefore, although the application has been described based upon these preferred embodiments, it would be apparent to those of skill in the art that certain modifications, variations, and alternative constructions would be apparent.
While preferred embodiments of the present application have been described, it is to be understood that the embodiments described are illustrative only and the scope of the application is to be defined solely by the appended claims when considered with a full range of equivalents and modifications (e.g., protocols, hardware devices, software platforms etc.) thereto.
Number | Name | Date | Kind |
---|---|---|---|
9274710 | Oikarinen | Mar 2016 | B1 |
9608829 | Spanos | Mar 2017 | B2 |
9774578 | Ateniese | Sep 2017 | B1 |
9779015 | Oikarinen | Oct 2017 | B1 |
10402792 | Lin | Sep 2019 | B2 |
10402793 | Haldenby | Sep 2019 | B2 |
10404469 | Madhavan | Sep 2019 | B2 |
10546277 | Metnick | Jan 2020 | B2 |
10679267 | Metnick | Jun 2020 | B2 |
20020161701 | Warmack | Oct 2002 | A1 |
20050131782 | Thuneby | Jun 2005 | A1 |
20050234786 | Aggarwal | Oct 2005 | A1 |
20110246503 | Bender | Oct 2011 | A1 |
20120084135 | Nissan et al. | Apr 2012 | A1 |
20130080301 | Siauw | Mar 2013 | A1 |
20130290655 | Fang | Oct 2013 | A1 |
20140351943 | Gianniotis et al. | Nov 2014 | A1 |
20150121062 | Gajek | Apr 2015 | A1 |
20150237127 | Khemani | Aug 2015 | A1 |
20150277802 | Oikarinen | Oct 2015 | A1 |
20150277969 | Strauss | Oct 2015 | A1 |
20150278243 | Vincent | Oct 2015 | A1 |
20150278397 | Hendrickson | Oct 2015 | A1 |
20150280959 | Vincent | Oct 2015 | A1 |
20160028552 | Spanos | Jan 2016 | A1 |
20160218879 | Ferrin | Jul 2016 | A1 |
20160260169 | Arnold | Sep 2016 | A1 |
20160292672 | Fay | Oct 2016 | A1 |
20160342976 | Davis | Nov 2016 | A1 |
20160342978 | Davis | Nov 2016 | A1 |
20160342989 | Davis | Nov 2016 | A1 |
20160342994 | Davis | Nov 2016 | A1 |
20170034197 | Daniel | Feb 2017 | A1 |
20170046526 | Chan | Feb 2017 | A1 |
20170046709 | Lee | Feb 2017 | A1 |
20170048217 | Biggs | Feb 2017 | A1 |
20170053249 | Tunnell | Feb 2017 | A1 |
20170098291 | Code | Apr 2017 | A1 |
20170132630 | Castinado | May 2017 | A1 |
20170140408 | Wuehler | May 2017 | A1 |
20170177855 | Costa Faidella | Jun 2017 | A1 |
20170193464 | Sher | Jul 2017 | A1 |
20170220815 | Ansari | Aug 2017 | A1 |
20170236102 | Biton | Aug 2017 | A1 |
20170236103 | Biton | Aug 2017 | A1 |
20170236104 | Biton | Aug 2017 | A1 |
20170243177 | Johnsrud | Aug 2017 | A1 |
20170243209 | Johnsrud | Aug 2017 | A1 |
20170243212 | Castinado | Aug 2017 | A1 |
20170262778 | Ganesan | Sep 2017 | A1 |
20170279783 | Milazzo | Sep 2017 | A1 |
20170293669 | Madhavan | Oct 2017 | A1 |
20170295023 | Madhavan | Oct 2017 | A1 |
20170300627 | Giordano | Oct 2017 | A1 |
20170301047 | Brown | Oct 2017 | A1 |
20170323392 | Kasper | Nov 2017 | A1 |
20170337534 | Goeringer | Nov 2017 | A1 |
20170344580 | King | Nov 2017 | A1 |
20170346693 | Dix | Nov 2017 | A1 |
20170353309 | Gray | Dec 2017 | A1 |
20170372308 | Metnick | Dec 2017 | A1 |
20170372391 | Metnick | Dec 2017 | A1 |
20180018723 | Nagla | Jan 2018 | A1 |
20180025423 | Utsumi | Jan 2018 | A1 |
20180032273 | Ateniese | Feb 2018 | A1 |
20180040040 | Barski | Feb 2018 | A1 |
20180040041 | Metnick | Feb 2018 | A1 |
20180046889 | Kapinos | Feb 2018 | A1 |
20180053158 | White | Feb 2018 | A1 |
20180068130 | Chan | Mar 2018 | A1 |
20180075527 | Nagla | Mar 2018 | A1 |
20180089638 | Christidis | Mar 2018 | A1 |
20180089678 | Metnick | Mar 2018 | A1 |
20180089684 | McGregor | Mar 2018 | A1 |
20180089685 | McGregor | Mar 2018 | A1 |
20180089758 | Stradling | Mar 2018 | A1 |
20180089760 | Stradling | Mar 2018 | A1 |
20180089761 | Stradling | Mar 2018 | A1 |
20180091316 | Stradling | Mar 2018 | A1 |
20180096042 | Kuzma | Apr 2018 | A1 |
20180096347 | Goeringer | Apr 2018 | A1 |
20180096360 | Christidis | Apr 2018 | A1 |
20180101906 | Mcdonald | Apr 2018 | A1 |
20180144114 | Fiske | May 2018 | A1 |
20190012666 | Krauss | Jan 2019 | A1 |
20190195852 | Bryant, Jr. | Jun 2019 | A1 |
20190219391 | Haldenby | Jul 2019 | A1 |
Entry |
---|
Anonymous, A novel method and programs to get an effective Thresholds for detecting unusual situations and fo 1ltering usual fluctuations of response times of non-independent transactions, Nov. 22, 2011. |
IBM, Method & System to Filter, Analyze and Statistics Transaction's Performance of Database, Jul. 17, 2007. |
Number | Date | Country | |
---|---|---|---|
20190075137 A1 | Mar 2019 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15348581 | Nov 2016 | US |
Child | 16179929 | US |