Abstract: Systems and methods for verifying a firewall for a cloud provider. The method includes receiving by a timelord module configured with access to a plurality of HTTP attacks that incorporate random tokens, an updated policy ok signal that was generated by an external element. The timelord module responds by (a) loading a first HTTP attack with a first expected response that is either forbidden or accepted, the first HTTP attack including the random tokens in a form of a header key value parameter; (b) sending the first HTTP attack to the firewall; (c) comparing a response from the firewall to the first HTTP attack with the first expected response; and (d) incrementing the first HTTP attack and repeating (a)-(c) until the plurality of HTTP attacks has been sent; and deleting the random tokens after the plurality of HTTP attacks have been sent.

Abstract: In some embodiments, a method stores an executable contract in a ledger. The executable contract is for a test to be performed on a network and includes terms for the test. The method receives an indication of traffic that is received at a network device. It is determined that the traffic is associated with the executable contract that is stored in the ledger based on the terms of the test. The method responds to the network device with a response indicating that the traffic is associated with the executable contract. The network device allows the traffic to be sent to a destination on the network to perform an operation for the test.

Abstract: Disclosed herein are system, method and computer readable storage medium for enabling access control to be performed on messages received in a first-party (corporate) data center from a third-party (cloud) data center. Based on a received update request from an update service in the third-party (cloud) data center, an access control system (“ACL”) controller generates an ACL entry for enabling access to a first-party (corporate) data center from a system, within the third-party data center where a system configuration change was performed by a cloud platform. The ACL controller then transmits the ACL entry to one or more devices within the first-party data center, enabling access from the updated system hosted in the third-party data center.

Abstract: Systems and methods for verifying a firewall for a cloud provider. The method includes receiving by a timelord module configured with access to a plurality of HTTP attacks that incorporate random tokens, an updated policy ok signal that was generated by an external element. The timelord module responds by (a) loading a first HTTP attack with a first expected response that is either forbidden or accepted, the first HTTP attack including the random tokens in a form of a header key value parameter; (b) sending the first HTTP attack to the firewall; (c) comparing a response from the firewall to the first HTTP attack with the first expected response; and (d) incrementing the first HTTP attack and repeating (a) - (c) until the plurality of HTTP attacks has been sent; and deleting the random tokens after the plurality of HTTP attacks have been sent.

Abstract: Disclosed herein are system, method and computer readable storage medium for enabling access control to be performed on messages received in a first-party (corporate) data center from a third-party (cloud) data center. Based on a received update request from an update service in the third-party (cloud) data center, an access control system (“ACL”) controller generates an ACL entry for enabling access to a first-party (corporate) data center from a system, within the third-party data center where a system configuration change was performed by a cloud platform. The ACL controller then transmits the ACL entry to one or more devices within the first-party data center, enabling access from the updated system hosted in the third-party data center.

Abstract: A computer implemented method and apparatus for optimized online presence blockchain trust management to avoid online fraud.

Abstract: A method for providing a proof-of-work challenge based on hash mining for reducing spam attacks comprising: receiving an email message from a client device; determining a level of trustworthiness of the client device; generating a challenge message based on the determined trustworthiness of the client device; transmitting the challenge message to the client device; receiving a response to the challenge message from the client device; and forwarding the email to one or more recipients when the response to the challenge message is correct.

Abstract: Data obsolescence is managed using a bitmap or bit array index which is associated with a table during an obsolescence control period. A table is selected to undergo obsolescence control for a period of time. Any records that have not been accessed for a certain number of cycles ‘M’, which represents an obsolescence limit, are deemed to be obsolete. During at least a part of each cycle, the results of database queries to the table are monitored, such that for each cycle an ‘obsolescence’ bitmap is created indicating which records were accessed. Once a sufficient number of cycles have elapsed, so that records that have not been accessed at all since the start of the obsolescence control period lie outside the obsolescence limit, queries are restricted to records which have been accessed during the last ‘M’ cycles by applying the ‘M’ most recently stored obsolescence bitmaps.

Abstract: A method for providing a proof-of-work challenge based on hash mining for reducing spam attacks comprising: receiving an email message from a client device; determining a level of trustworthiness of the client device; generating a challenge message based on the determined trustworthiness of the client device; transmitting the challenge message to the client device; receiving a response to the challenge message from the client device; and forwarding the email to one or more recipients when the response to the challenge message is correct.

Abstract: Data obsolescence is managed using a bitmap or bit array index which is associated with a table during an obsolescence control period. A table is selected to undergo obsolescence control for a period of time. Any records that have not been accessed for a certain number of cycles ‘M’, which represents an obsolescence limit, are deemed to be obsolete. During at least a part of each cycle, the results of database queries to the table are monitored, such that for each cycle an ‘obsolescence’ bitmap is created indicating which records were accessed. Once a sufficient number of cycles have elapsed, so that records that have not been accessed at all since the start of the obsolescence control period lie outside the obsolescence limit, queries are restricted to records which have been accessed during the last ‘M’ cycles by applying the ‘M’ most recently stored obsolescence bitmaps.

Abstract: A computer implemented method and system comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.

Abstract: Data obsolescence is managed using a bitmap or bit array index which is associated with a table during an obsolescence control period. A table is selected to undergo obsolescence control for a period of time. Any records that have not been accessed for a certain number of cycles ‘M’, which represents an obsolescence limit, are deemed to be obsolete. During at least a part of each cycle, the results of database queries to the table are monitored, such that for each cycle an ‘obsolescence’ bitmap is created indicating which records were accessed. Once a sufficient number of cycles have elapsed, so that records that have not been accessed at all since the start of the obsolescence control period lie outside the obsolescence limit, queries are restricted to records which have been accessed during the last ‘M’ cycles by applying the ‘M’ most recently stored obsolescence bitmaps.

Abstract: A computer implemented method and system comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.

Abstract: A computer implemented method and system comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.

Abstract: Data obsolescence is managed using a bitmap or bit array index which is associated with a table during an obsolescence control period. A table is selected to undergo obsolescence control for a period of time. Any records that have not been accessed for a certain number of cycles ‘M’, which represents an obsolescence limit, are deemed to be obsolete. During at least a part of each cycle, the results of database queries to the table are monitored, such that for each cycle an ‘obsolescence’ bitmap is created indicating which records were accessed. Once a sufficient number of cycles have elapsed, so that records that have not been accessed at all since the start of the obsolescence control period lie outside the obsolescence limit, queries are restricted to records which have been accessed during the last ‘M’ cycles by applying the ‘M’ most recently stored obsolescence bitmaps.

Abstract: A technique for generating or updating a user profile based on a packet flow in a communications network from a user terminal to a destination address is described. A method implementation of this technique comprises receiving, by a Policy Control and Charging Rules Function (PCRF) from a Policy and Charging Enforcement Function (PCEF), at least one item of information indicative of at least one of the destination address and a service provided at the destination address to the user terminal. Based on this item of information, a user profile for a user associated with the user terminal is generated or updated.

Abstract: A computer implemented method and system comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.

Abstract: A computer program product for implementing a method comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, and determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.

Abstract: A denormalized dataset, an associated primary key field, one or more associated secondary key fields and information identifying one or more normalized datasets associated with each secondary key field, is received. A denormalized table comprising fields and data types corresponding to said denormalized dataset, said denormalized table having a primary key field corresponding to said primary key field associated with said denormalized dataset, is created. The said information identifying the one or more normalized datasets associated with each secondary key field, creating one or more normalized tables, each of said one or more normalized tables corresponding to a respective one of said one or more normalized datasets, each of said one or more normalized tables comprising a foreign key corresponding to said associated primary key and a primary key corresponding to the secondary key field associated with said normalized dataset, is utilized. Additionally, each of said foreign keys is utilized.

Abstract: A computer implemented method and system comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.