In one aspect, the present disclosure relates to security data management, and more specifically, systems and methods for distributing, storing, and/or validating common vulnerabilities and exposures intelligence entries using blockchain. Other aspects also are described.
Existing security vulnerabilities and exposures intelligence databases, such as databases that provide entries or definitions for publicly disclosed or known security vulnerability and exposure intelligence, such as Cybersecurity Vulnerabilities and Exposures (“CVEs”), are generally made available online (e.g., one such database is provided by the MITRE Corporation of Bedford Mass., which organizes and runs a centralized online system providing access to information in their database as a whole via a search engine). Available centralized systems however historically have faced many problems and various disadvantages. For example, existing systems experience considerable delays, with contributors becoming frustrated with available systems, due to the fact that it can take a significant amount of time, such as many months or even several years, before new entries or updates thereto are assigned/released, creating a significant backlog of entries and potentially giving malicious actors time to develop new/different tactics that cannot be quickly detected. Further, since these centralized systems generally are owned and maintained by one, or only a few, specific entities that have exclusive control thereof, security researchers and analysts typically cannot effectively participate in developing new entries or updates thereto, and further do not receive adequate credit when they do contribute. Still further, because the intelligence entries and updates thereto are subject to being rejected outright by the controlling entities, e.g., for being viewed as out of scope, many important entries and updates developed/discovered by security analysts and others in the security field are never even considered for inclusion in existing databases, potentially resulting in significant coverage gaps.
Accordingly, it can be seen that a need exists for more efficient ways of security entry and update verification for security vulnerabilities and exposures intelligence databases, and in particular, for systems and methods that enable decentralized sharing, validation, and storing of cybersecurity knowledge or intelligence and that can incentivize consensus based updates in the cybersecurity intelligence community, while also allowing for the release of intelligence information quicker, without having to go through one or only a few entities. The present disclosure addresses these and other related and unrelated problems in the art.
Briefly described, the present disclosure is generally directed to techniques for management of data, reward, and authority associated with a distributed security vulnerabilities and exposures intelligence system. The system can store security entries and updates thereto that can include Common Vulnerabilities and Exposures (“CVEs”) or Extended Common Vulnerabilities and Exposures (“ECVEs”).
In one aspect, a distributed security vulnerabilities and exposures intelligence system can include a secure chain of data blocks stored on computing nodes including computing devices or other suitable information handling systems. The computing nodes can be part of a distributed network(s) of public or private computing nodes, and store and maintain the chain of data blocks securely, as a blockchain. The chain of data blocks maintained in each computer node further contains data blocks that represent one or more validated updates to security entries, such as CVEs or ECVEs. Blocks can be added to the blockchain periodically, as new updates are proposed, and synced across all computing nodes, with each computer node on the distributed network acting as miner of the blocks using a Proof of Work (“PoW”) algorithm or workflow to secure the blockchain, which miners can receive digital tokens as compensation. The computing nodes on the distributed network further may be configured to act either or both as validator and voter of the updates using a Proof of Stake (“PoS”) algorithm or workflow, and also can receive and distributing digital tokens as compensation for voting or validation. The blockchain generally enables the creation and maintenance of a digital ledger or record of transactions on a ledger of records among the distributed computing network, and uses cryptography to allow each participant on the network to manipulate the ledger securely, without the need for a central point of control.
The system also can provide rewards to incentivize contributions, and more openness and flexibility using a democratic approval process for entry and update verification. For example, the distributed security vulnerabilities and exposures intelligence system may include a merit distribution mechanism on the blockchain that may reward users with digital tokens for creating and updating security entries. Issuance of these digital tokens provides a way to reward and incentivize contributors and validators, and also ensure that anyone who uses the intelligence system becomes a “shareholder” of the data. The digital tokens further can be used to enable access, enact revisions, and power the system. For example, if a user identifies incorrectness in an entry field, the user can commit an amount of digital tokens to challenge it. If a majority of committed stake from other contributors (validators) agrees with the dissenting user, on a consensus basis, an amendment can be made to the entry and the dissenting user's digital tokens may be returned along with some additional digital tokens, as compensation. Similarly, if a user identifies relevant extra data to be added to an ECVE, and other contributors (validators) agree with that addition, on a consensus basis, additions will be made, and digital tokens can be rewarded to that contributor. Validators who agree with the consensus decision to either approve or reject an update also may receive digital tokens as compensation.
In another aspect, a method for validating and storing security vulnerabilities and exposures intelligence entries is provided. This method can include storing a secure chain of data blocks in computing nodes including information handling systems that are part of a distributed network of computing nodes. The set of computing nodes part of that network store and maintain the chain of data blocks, securely. Each block represents one or more security entries or updates thereto, such as CVEs or ECVEs. The method further comprises adding blocks to the chain periodically (e.g., when new entries or updates thereto are proposed by participants) and syncing across all computing nodes in response to determining that update data associated with the last data block are valid. These method steps can be implemented by one or more processors operatively coupled with storage or memory associated with the given computer node.
In a further aspect, a computer program product can include a digital token program or module having encoded therein executable code of one or more software programs. The one or more software programs, when executed by one or more processors implement steps of: minting of new digital tokens, locking of digital tokens during the security entry or update consensus process, and transfer of digital tokens. The one or more processors can be included in a computer node that is part of a set of computing nodes in a distributed network thereof wherein each confirms the minting of new digital tokens, lock of digital tokens during the entry and update consensus process, and transfer of digital tokens.
In yet another aspect, a computer program or computer program product comprises a voting program or module. The voting program can have encoded therein executable code of one or more software programs, workflows, etc., which has scope to elect approval or rejection of each security entry or update based on a PoS consensus algorithm. The voting program can be configured to facilitate majority stake consensus approval mechanism for entries or updates. When approved, new entries or updates can be persisted on the blockchain in a trustless manner.
Accordingly, illustrative embodiments of the present disclosure advantageously provide effective techniques for validating, managing, and storing data related to vulnerabilities and exposures intelligence entries and updates, such as updates to CVEs or ECVEs. These embodiments provide a secure and robust approach to tracking, amending, and appending information related to such security entries, and the various fields of the security entries and updates may be securely tracked using the secure chain of data blocks. Furthermore, the digital token and voting system embodiments can provide effective techniques for providing an incentive and reward mechanism to all types of actors in the system, such as contributors, validators, and miners that secure the blockchain on the network.
Other various objects, features, and/or advantages of the present disclosure will become apparent to those skilled in the art upon a review of the following detail description, when taken in conjunction with the accompanying drawings.
It will be appreciated that for simplicity and clarity of illustration, elements illustrated in the Figures are not necessarily drawn to scale. For example, the dimensions of some elements may be exaggerated relative to other elements. Embodiments incorporating teachings of the present disclosure are shown and described with respect to the drawings herein, in which:
The use of the same reference symbols in different drawings indicates similar or identical items.
The following description in combination with the Figures is provided to assist in understanding the teachings disclosed herein. The description is focused on specific implementations and embodiments of the teachings, and is provided to assist in describing the teachings. This focus should not be interpreted as a limitation on the scope or applicability of the teachings.
As also illustrated in
According to the present disclosure, data blocks, e.g., related to security entries and/or updates, are added to the chain periodically and synced across all the computing nodes 10. In particular, the computing nodes 12 can receive broadcast security updates, e.g., by listening on a socket connection in communication with the network 22, from system contributors, participants or other security researchers or entities. The security updates then can be added to a current or latest block as one or more transactions that will be included in the blockchain if verified by the computing nodes 12. Accordingly, a secure chain of data blocks can be stored in the memory 16 of the computing node 20 such that the set of computing nodes 12 in communication with the network 18 store and maintain the chain of data blocks (blockchain) securely and in a distributed manner. Thus, the blockchain generally enables the creation and maintenance of a digital ledger or record of security entries and updates, e.g., CVE and ECVE updates, on a secure ledger of records distributed about the system 10. One benefit of storing CVEs and ECVEs on the blockchain ensures that data validation is decentralized and securely maintained, so as to improve CVEs or ECVEs access availability, replication, as well as higher level of censorship prevention, in comparison to existing centralized systems.
The system 10 further uses cryptography to allow each participant to manipulate the ledger securely, without the need for a central point of control. In particular, for each submitted and validated block added to the blockchain, the system 10 generates a hash of the previous block in the block chain and provides a hash value or information related thereto with the validated block to be stored in the blockchain datastore 18 in the memory 16 of the computing nodes 12. More specifically, the system 10 applies a cryptic hash function or other suitable hash function or algorithm to data or information of or related to the previous block in the block chain and adds the hash to the current block for identification thereof (e.g., the memory 16 of the computing nodes 10 can store instructions, workflows, etc. for the hash function or algorithm that can be accessed by the processors 14 and applied to data or information of or related to the previous block for generation of the hash value).
Each computer node 12 in the distributed network 22 additionally can act as a miner of blocks for the blockchain, with each computer node 12 including a validation controller 24 that facilitates mining of the blocks. In particular, when a contributor submits a new security update for consideration by network participants, e.g., as a new block to be added to the chain and synced across all computing nodes 12, each computing node 12 can apply the validation controller 24 that includes a Proof of Work (“PoW”) workflow, algorithm, etc., to verify the blocks and secure the chain. The PoW generally facilitates validation and rejection of newly submitted blocks on a consensus basis. That is, in one embodiment, as discussed in detail in connection with
In addition, the system 10 can include a digital token software program or module that facilitates creation, control, and/or distribution of digital tokens. For example, the system participants managing the computing nodes 12 may be granted one or more incentivizing rewards, such as digital tokens, notifications, payments, etc., for mining and validation of new blocks, and further contributors of new security entries or updates may be granted one or more incentivizing rewards for security updates that are validate and synced across all nodes, e.g., CVE and ECVE updates that are added to the blockchain ledger or database thereof. The digital token program can be configured to create or mint new digital tokens. The digital token program can be configured to lock the digital tokens, e.g., prevent creation or distribution thereof, during the security entry or update consensus process. And, the digital token program can be configured to transfer digital tokens to the computing nodes 12 when appropriate, e.g., as compensation for mining/validation or as an award for a validated security update. The digital token program can be part of the validation controller 24, though the digital token program can be a separate, additional program, component, etc., without departing from the scope of the present disclosure. One or more of the processors 14 of the computing nodes 10 will access and execute the digital token program or components thereof, which includes encoded therein executable codes, instructions, workflows etc. that when executed by one or more of the processors 14, causes the processors to generate and confirms the minting of new digital tokens, lock digital tokens during the entry/update consensus process, and transfer the digital tokens to appropriate participants.
In one embodiment, an ECVE blockchain may start off (genesis) as a private network, where only a small set of contributors or single contributor sync(s) the blockchain with the publicly available data set of existing CVEs. Then, the contributor(s) can open up connections to exhibit the blockchain to other potential contributors, miners, security analysis, researchers, etc. interested in maintaining, securing, and/or updating the ECVEs blockchain data base. The system further can benefit from network effect, with the system getting stronger and stronger as the network of miners and contributors grows in size and more and more cybersecurity intelligence information is included in the system, e.g., allowing for the development of more effective cybersecurity tools, databases, and services.
In one embodiment, these security update entries 50 may be stored outside the network of computing nodes 12, such as in a database or other suitable datastore in communication with the system 10; however, these security update entries can be stored in the memory 16 of one or more of the computing nodes 12, without departing from the scope of the present disclosure.
Typically, each block 62 can accommodate one or more transactions, and as the transactions flow into the network, each node of the network generally will be able to process them into a block in a timely manner. Alternatively, each block could represent only a single transaction, i.e., each security entry, e.g., a particular ECVE, and can have its own blockchain including verified updates, appendices, amendments, etc. thereto added as single blocks in the blockchain, for example, depending on possible block size limitations for receipt of the transactions within a selected cycle period. Furthermore, according to this disclosure, the block size, e.g., the number of transactions allowed to be included in each block, may be limited and/or increased to reduce the impact of spam, such as contributors presenting or validating meritless entries or updates, e.g., to allow action to be taken, such as modifying the software with other spam prevention systems.
On the other hand, as shown in
In one embodiment, the validation controller 24 can include a voting program or module configured to establish validation and rejection on a consensus basis, wherein the majority stakeholders' weight determines whether an update gets validated or rejected. More specifically, the validation controller 24 can determine whether a majority of the computing nodes 12 validated or denied, the security entry or update, and if it is a determined that a majority validated the update, the updated is added to the current block and then to the blockchain; however, if it is determined that a majority denied the update, the update is not added to the current block and not included in the blockchain. The validation module 24 can be configured to validate the updates either automatically or to facilitate manual validation by security analysts. For automatic validation, the validation controller 24 will use the Proof of Work (“PoW”) algorithm, workflow, etc. that contains a set of rules that must be meet for validation. For example, the PoW can require that the submitted security updates include specific fields or information, and if the submitted entry is missing a required field, the entry or update is denied. In one embodiment, a valid duplication ID, description, and reference may be required, and if any of the duplication ID, description, or reference are missing, validation of the security entry or update will be denied by the validation controller 24.
For manual validation, the validation controller 24 can simply receive votes for the validation or denial of security entries and/or updates. Furthermore, the validation controller 24 can set a specific confirmation time interval during which votes can be cast for validation, and a majority of votes that are cast within the confirmation time interval can determine whether the security entry or updates are validated or denied. For example, the validation controller 24 can start a timer when the security entry or update is received from the submitting contributor, with the timer being set to run for the confirmation time interval, and when the timer expires, the validation controller 24 can determine the number of votes for or against validation, and validate or deny validation based on the majority of votes. The confirmation time of each block can vary and generally will be selected or set to a time cycle of a length sufficient to allow enough manual validators to get the necessary time to vote for the proposed updates, such as a specific number of days, weeks, months, or years.
Notably, if a computer node 12 (miner), or set of computing nodes 12 (miners) does, or do, not validate/reject one or more updates according to the set of rules shared by the majority of computing nodes, then, those computing nodes could potentially fork the blockchain, or at some point in time having to reject its own new block and merge the out of sync block from the majority chain (merging) to continue to participate in the majority network. However, the majority of computing nodes that do adhere to the predefined set of validation rules will all continue mining for the next block on the majority network. Thus, one benefit of validation based on consensus (in other words, the winning (over 50%) cumulative Proof Of Work) is that the majority has authority on validating updates that gets persisted in a block, allowing for a democratic voting system, where one or more community, or group of nodes, are free to follow a forked version of the original, in other words genesis state of the blockchain.
Thereafter, at 306, the voting power of each of the participants is determined, e.g., weighted, by their staked amount, and as shown at 308, the votes with the highest cumulated stakes will win and determine whether the security entry or update is validated or denied. For example, the each validation or denial vote is weighted based on the total amount staked for each vote (e.g., if 1 token is staked, then 1 vote is counted; if 2 tokens are staked, then 2 votes are counted; 3 tokens are staked, then 3 votes are counted; and so on), and the total number of weighted votes are compared to determine the winner, with the highest total determining validation or denial.
At 310, the contributors that voted for the winning side, e.g., to validate or deny, are awarded digital tokens. The awarded tokens can be based on the total amount staked for each vote and the more staked increases the reward returned (e.g., the reward can be equal to the amount staked for the submitted vote; however, the reward can include any suitable percentage of the originally staked amount, such as 0.25, 0.33, 0.50, 0.75, 2, 3, 4, and up to 5 or more times the amount associated with the vote or other integers or non-integers therebetween). Also, as shown at 312, if the security entry or update is validated, the contributor gets a reward including digital tokens.
If the security update did include all of required fields, the process can continue on and votes or digital token weighted votes can be received from system participants (at 414). For the embodiment in which digital weighted votes are used, the system also will receive information related to a staked amount of digital tokens for each vote (at 414). Then, at 416, the total number of votes or weighted votes can be determined or tallied. It then can be determined whether the received security update received a majority of the votes or weighted votes at 418. If the received security update did not receive a majority of the votes or weighted votes, validation will be denied and a digital token award will be provided to participants that voted to deny the updates at 420. Optionally, at 420, a notification can be provided to the contributor or other participants that validation was denied.
As further shown in
As
The foregoing description generally illustrates and describes various embodiments of this disclosure. It will, however, be understood by those skilled in the art that various changes and modifications can be made to the above-discussed constructions and systems without departing from the spirit and scope of this disclosure as disclosed herein, and that it is intended that all matter contained in the above description or shown in the accompanying drawings shall be interpreted as being illustrative, and not to be taken in a limiting sense. Furthermore, the scope of the present disclosure shall be construed to cover various modifications, combinations, additions, alterations, etc., above and to the above-described embodiments, which shall be considered to be within the scope of this disclosure. Accordingly, various features and characteristics as discussed herein may be selectively interchanged and applied to other illustrated and non-illustrated embodiment, and numerous variations, modifications, and additions further can be made thereto without departing from the spirit and scope of the present invention as set forth in the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
5937066 | Gennaro et al. | Aug 1999 | A |
6357010 | Viets et al. | Mar 2002 | B1 |
7269578 | Sweeney | Sep 2007 | B2 |
7331061 | Ramsey et al. | Feb 2008 | B1 |
7492957 | Bonhaus | Feb 2009 | B1 |
7548932 | Horvitz et al. | Jun 2009 | B2 |
7555482 | Korkus | Jun 2009 | B2 |
7571474 | Ross et al. | Aug 2009 | B2 |
7594270 | Church et al. | Sep 2009 | B2 |
7606801 | Faitelson et al. | Oct 2009 | B2 |
7613722 | Horvitz et al. | Nov 2009 | B2 |
7770031 | MacKay et al. | Aug 2010 | B2 |
7856411 | Darr | Dec 2010 | B2 |
8079081 | Lavrik et al. | Dec 2011 | B1 |
8122495 | Ramsey et al. | Feb 2012 | B2 |
8156553 | Church et al. | Apr 2012 | B1 |
8327419 | Korablev et al. | Dec 2012 | B1 |
8407335 | Church et al. | Mar 2013 | B1 |
8490193 | Sarraute et al. | Jul 2013 | B2 |
8490196 | Lucangeli et al. | Jul 2013 | B2 |
8522350 | Davenport et al. | Aug 2013 | B2 |
8539575 | Schmitlin et al. | Sep 2013 | B2 |
8578393 | Fisher | Nov 2013 | B1 |
8595170 | Gladstone et al. | Nov 2013 | B2 |
8621618 | Ramsey et al. | Dec 2013 | B1 |
8701176 | Ramsey et al. | Apr 2014 | B2 |
8805881 | Hom et al. | Aug 2014 | B2 |
8832048 | Lim | Sep 2014 | B2 |
8839414 | Mantle et al. | Sep 2014 | B2 |
8898777 | Oliver | Nov 2014 | B1 |
8909673 | Faitelson et al. | Dec 2014 | B2 |
8928476 | Jerhotova et al. | Jan 2015 | B2 |
8931095 | Ramsey et al. | Jan 2015 | B2 |
8938802 | Davenport et al. | Jan 2015 | B2 |
8959115 | Marathe | Feb 2015 | B2 |
8984644 | Oliphant et al. | Mar 2015 | B2 |
9009828 | Ramsey et al. | Apr 2015 | B1 |
9032478 | Ballesteros et al. | May 2015 | B2 |
9046886 | Chong et al. | Jun 2015 | B2 |
9047336 | Hom et al. | Jun 2015 | B2 |
9069599 | Martinez et al. | Jun 2015 | B2 |
9098702 | Rubin et al. | Aug 2015 | B2 |
9129105 | Donley et al. | Sep 2015 | B2 |
9130988 | Seifert et al. | Sep 2015 | B2 |
9137262 | Qureshi | Sep 2015 | B2 |
9298895 | Lim | Mar 2016 | B2 |
9319426 | Webb et al. | Apr 2016 | B2 |
9338134 | Yin | May 2016 | B2 |
9338180 | Ramsey et al. | May 2016 | B2 |
9430534 | Bhattacharya et al. | Aug 2016 | B2 |
9438563 | Yin | Sep 2016 | B2 |
9519756 | Bitran et al. | Dec 2016 | B2 |
9544273 | Fleury | Jan 2017 | B2 |
9548994 | Pearcy et al. | Jan 2017 | B2 |
9558352 | Dennison et al. | Jan 2017 | B1 |
9560062 | Khatri et al. | Jan 2017 | B2 |
9560068 | Figlin et al. | Jan 2017 | B2 |
9596252 | Coates et al. | Mar 2017 | B2 |
9628511 | Ramsey et al. | Apr 2017 | B2 |
9667656 | Banerjee et al. | May 2017 | B2 |
9667661 | Sharma et al. | May 2017 | B2 |
9710672 | Braun | Jul 2017 | B2 |
9742559 | Istodorescu | Aug 2017 | B2 |
9767302 | Lim | Sep 2017 | B2 |
9805202 | Medeiros et al. | Oct 2017 | B2 |
9832022 | Pedersen | Nov 2017 | B1 |
9910986 | Saxe | Mar 2018 | B1 |
9973524 | Boyer | May 2018 | B2 |
10050992 | Thyni | Aug 2018 | B2 |
10116500 | Long | Oct 2018 | B1 |
10169937 | Zwink et al. | Jan 2019 | B1 |
10311231 | Kayyoor | Jun 2019 | B1 |
10356125 | Goutal et al. | Jul 2019 | B2 |
10382489 | Das | Aug 2019 | B2 |
10419903 | Singh et al. | Sep 2019 | B2 |
10425223 | Roth | Sep 2019 | B2 |
10474820 | Manadhata | Nov 2019 | B2 |
10491632 | Natarajan | Nov 2019 | B1 |
10567407 | Tang et al. | Feb 2020 | B2 |
10594713 | McLean | Mar 2020 | B2 |
10601865 | Mesdaq et al. | Mar 2020 | B1 |
10728263 | Neumann | Jul 2020 | B1 |
10762206 | Titonis et al. | Sep 2020 | B2 |
10790982 | Clements | Sep 2020 | B2 |
10834128 | Rajogopalan et al. | Nov 2020 | B1 |
10853431 | Lin et al. | Dec 2020 | B1 |
10915828 | Qhi | Feb 2021 | B2 |
11044263 | McLean et al. | Jun 2021 | B2 |
11165862 | Austin | Nov 2021 | B2 |
20020129135 | Delany et al. | Sep 2002 | A1 |
20040019785 | Hawkes et al. | Jan 2004 | A1 |
20050138204 | Iyer et al. | Jun 2005 | A1 |
20050288939 | Peled et al. | Dec 2005 | A1 |
20060012815 | Ebner et al. | Jan 2006 | A1 |
20060037076 | Roy | Feb 2006 | A1 |
20060195575 | Delany et al. | Aug 2006 | A1 |
20060253447 | Judge | Nov 2006 | A1 |
20070226248 | Darr | Sep 2007 | A1 |
20070226807 | Ginter et al. | Sep 2007 | A1 |
20080077593 | Abrams et al. | Mar 2008 | A1 |
20080219334 | Brainos | Sep 2008 | A1 |
20080255997 | Bluhm et al. | Oct 2008 | A1 |
20080262991 | Kapoor | Oct 2008 | A1 |
20080320000 | Gaddam | Dec 2008 | A1 |
20090198682 | Buehler et al. | Aug 2009 | A1 |
20100125913 | Davenport et al. | May 2010 | A1 |
20110004771 | Matsushima | Jan 2011 | A1 |
20110179492 | Markopoulou et al. | Jul 2011 | A1 |
20110276604 | Hom et al. | Nov 2011 | A1 |
20110276716 | Coulson | Nov 2011 | A1 |
20120117640 | Ramsey et al. | May 2012 | A1 |
20120185275 | Loghmani | Jul 2012 | A1 |
20120246730 | Raad | Sep 2012 | A1 |
20120254333 | Chandramouli | Oct 2012 | A1 |
20120260341 | Chan et al. | Oct 2012 | A1 |
20130104191 | Peled et al. | Apr 2013 | A1 |
20130138428 | Chandramouli | May 2013 | A1 |
20130173620 | Takenouchi | Jul 2013 | A1 |
20130226938 | Risher et al. | Aug 2013 | A1 |
20130238319 | Minegishi et al. | Sep 2013 | A1 |
20130282746 | Balko | Oct 2013 | A1 |
20130291103 | Davenport et al. | Oct 2013 | A1 |
20130318604 | Coates et al. | Nov 2013 | A1 |
20140003606 | Birnbaum et al. | Jan 2014 | A1 |
20140006785 | Shaliv et al. | Jan 2014 | A1 |
20140004102 | Ramsey et al. | Feb 2014 | A1 |
20140047544 | Jakobsson | Feb 2014 | A1 |
20140051432 | Gupta | Feb 2014 | A1 |
20140222712 | Samaha | Aug 2014 | A1 |
20140373151 | Webb et al. | Dec 2014 | A1 |
20150019323 | Goldberg | Jan 2015 | A1 |
20150040225 | Coates et al. | Feb 2015 | A1 |
20150074390 | Stoback | Mar 2015 | A1 |
20150113258 | Grieco et al. | Apr 2015 | A1 |
20150135287 | Medeiros et al. | May 2015 | A1 |
20150156212 | Khatri et al. | Jun 2015 | A1 |
20150186618 | Poorvin | Jul 2015 | A1 |
20150220918 | Davis et al. | Aug 2015 | A1 |
20150222652 | Ramsey et al. | Aug 2015 | A1 |
20150269570 | Phan | Sep 2015 | A1 |
20150271047 | McLean | Sep 2015 | A1 |
20150324457 | McLean | Nov 2015 | A1 |
20160014140 | Akireddy et al. | Jan 2016 | A1 |
20160014151 | Prakash | Jan 2016 | A1 |
20160078365 | Baumard | Mar 2016 | A1 |
20160099963 | Mahaffey | Apr 2016 | A1 |
20160139886 | Perdriau | May 2016 | A1 |
20160182546 | Coates et al. | Jun 2016 | A1 |
20160241591 | Ramsey et al. | Aug 2016 | A1 |
20160277423 | Apostolescu et al. | Sep 2016 | A1 |
20160313709 | Biesdorf | Oct 2016 | A1 |
20160337400 | Gupta | Nov 2016 | A1 |
20160342805 | Lim | Nov 2016 | A1 |
20160378978 | Singla | Dec 2016 | A1 |
20170026343 | Wardman | Jan 2017 | A1 |
20170063893 | Franc et al. | Mar 2017 | A1 |
20170098087 | Li | Apr 2017 | A1 |
20170111379 | Khatri et al. | Apr 2017 | A1 |
20170140295 | Bandara | May 2017 | A1 |
20170142149 | Coates et al. | May 2017 | A1 |
20170169154 | Lin et al. | Jun 2017 | A1 |
20170171228 | McLean | Jun 2017 | A1 |
20170180418 | Shen | Jun 2017 | A1 |
20170201381 | Kinder et al. | Jul 2017 | A1 |
20170201431 | Kinder et al. | Jul 2017 | A1 |
20170201490 | Kinder et al. | Jul 2017 | A1 |
20170201548 | Kinder et al. | Jul 2017 | A1 |
20170208084 | Steelman et al. | Jul 2017 | A1 |
20170208085 | Steelman et al. | Jul 2017 | A1 |
20170214675 | Johnsrud | Jul 2017 | A1 |
20170243004 | Kinder et al. | Aug 2017 | A1 |
20170243005 | Kinder et al. | Aug 2017 | A1 |
20170244734 | Kinder et al. | Aug 2017 | A1 |
20170244750 | Kinder et al. | Aug 2017 | A1 |
20170244754 | Kinder et al. | Aug 2017 | A1 |
20170244762 | Kinder et al. | Aug 2017 | A1 |
20170308872 | Uhr et al. | Oct 2017 | A1 |
20170318034 | Holland et al. | Nov 2017 | A1 |
20170359368 | Hodgman | Dec 2017 | A1 |
20170366348 | Weimer et al. | Dec 2017 | A1 |
20180077189 | Doppke | Mar 2018 | A1 |
20180089574 | Goto | Mar 2018 | A1 |
20180091306 | Antonopoulos | Mar 2018 | A1 |
20180101842 | Ventura et al. | Apr 2018 | A1 |
20180124073 | Scherman et al. | May 2018 | A1 |
20180124085 | Frayman | May 2018 | A1 |
20180152480 | Kinder et al. | May 2018 | A1 |
20180181599 | Crabtree et al. | Jun 2018 | A1 |
20180288198 | Pope et al. | Oct 2018 | A1 |
20180367550 | Musuvathi et al. | Dec 2018 | A1 |
20180375668 | Diehl | Dec 2018 | A1 |
20190014149 | Cleveland et al. | Jan 2019 | A1 |
20190037406 | Wash | Jan 2019 | A1 |
20190050554 | Fiske | Feb 2019 | A1 |
20190095801 | Saillet et al. | Mar 2019 | A1 |
20190102646 | Redmon | Apr 2019 | A1 |
20190104154 | Kumar et al. | Apr 2019 | A1 |
20190109717 | Reddy | Apr 2019 | A1 |
20190122258 | Bramberger et al. | Apr 2019 | A1 |
20190132131 | Clements | May 2019 | A1 |
20190132344 | Lem et al. | May 2019 | A1 |
20190141079 | Vidas et al. | May 2019 | A1 |
20190149564 | McLean | May 2019 | A1 |
20190171849 | Assenmacher | Jun 2019 | A1 |
20190173919 | Irimie | Jun 2019 | A1 |
20190179801 | Jang | Jun 2019 | A1 |
20190297096 | Ahmed et al. | Sep 2019 | A1 |
20190342296 | Anandam | Nov 2019 | A1 |
20190347433 | Chakravorty | Nov 2019 | A1 |
20190377832 | McLean et al. | Dec 2019 | A1 |
20190379678 | McLean et al. | Dec 2019 | A1 |
20200036750 | Bahnsen | Jan 2020 | A1 |
20200183950 | Gaillardetz | Jun 2020 | A1 |
20200259791 | Garcia et al. | Aug 2020 | A1 |
20200351302 | Kyle | Nov 2020 | A1 |
20200351307 | Vidas et al. | Nov 2020 | A1 |
20200356665 | Denney et al. | Nov 2020 | A1 |
20200358795 | Urbanski et al. | Nov 2020 | A1 |
20200358819 | Bowditch et al. | Nov 2020 | A1 |
20200364338 | Ducau et al. | Nov 2020 | A1 |
20200394309 | Angelo | Dec 2020 | A1 |
20210014067 | Clements | Jan 2021 | A1 |
20210067562 | Kinder et al. | Mar 2021 | A1 |
20210109797 | Zhou | Apr 2021 | A1 |
20210185057 | McLean | Jun 2021 | A1 |
Number | Date | Country |
---|---|---|
3599753 | Jan 2020 | EP |
2738344 | Dec 2020 | RU |
WO2007002749 | Jan 2007 | WO |
WO2007090605 | Aug 2007 | WO |
WO2010059843 | May 2010 | WO |
WO2021067238 | Apr 2021 | WO |
Entry |
---|
Buyukkayhan, Ahmet Sali; Oprea, Alina; Li, Zhou; and Robertson, William; “Lens on the endpoint; Hunting for malicious software through endpoint data analysis”; International Symposium on Research in Attacks, Intrusions, and Defenses; RAID 2017: Research in Attacks, Intrusions, and Defenses Proceedings; pp. 73-79; Sep. 18-20, 2017; Atlanta, GA, USA. |
Sofya Raskhodnikova & Adam Smith; CSE 598A Algorithmic Challenges in Data Privacy; Lecture 2; Jan. 19, 2010. |
Github, Inc.; https://github.com/blockstack-packages/blockchain-id-deprecated/wiki/Home; Oct. 15, 2015 (last edited). |
Github, Inc.; https://github.com/blockstack-packages/blockchain-id-deprecated/wiki/Blockstore; Sep. 3, 2015 (last edited). |
Afroz, S. and Greenstadt, R. “PhishZoo: Detecting Phishing Websites by Looking at Them”; IEEE Fifth International Conference on Semantic Computing, 2011; pp. 368-375; doi: 10.1109/ICSC.2011.52; 2011. |
Alkhawlani, Mohammed, Elmogy, Mohammed and Elbakry, Hazem; “Content-based image retrieval using local features descriptors and bag-of-visual words”; International Journal of Advanced Computer Science and Applications, vol. 6 No. 9 2015; pp. 212-219; 2015. |
Buber, E., Demir, O. and Sahingoz, O.K.; “Feature selections for the machine learning based detection of phishing websites”; 2017 International Artificial Intelligence and Data Processing Symposium (IDAP), 2017; pp. 1-5; doi: 10.1109/DAP.2017.8090317; 2017. |
Lin, Tsung-Yi, et al.; “Microsoft coco: Common objects in context”; European Conference on Computer Vision, Springer, Cham, 2014; 2014. |
Liu, Y., Wang, Q., Zhuang, M. and Zhu, Y.; Reengineering Legacy Systems with RESTFul Web Service; 2008 32nd Annual IEEE International Computer Software and Applications Conference, 2008; pp. 785-790; doi: 10.1109/COMPSAC.2008.89; 2008. |
White, Joshua S., Matthews, Jeanna N., and Stacy, John L.; A method for the automated detection phishing websites through both site characteristics and image analysis Cyber Sensing 2012; vol. 8408; International Society for Optics and Photonics, 2012; 2012. |
Urlvoid; URLVoid.com; retrieved from archives.org: https: web.archive.org/web/20180730215132/https.://www.urlvoid.com/); Published Jul. 30, 2018. |
Number | Date | Country | |
---|---|---|---|
20210112087 A1 | Apr 2021 | US |