This disclosure relates generally to data processing devices and, more particularly, to cryptographic currency user directory data and enhanced peer-verification ledger synthesis through multi-modal cryptographic key-address mapping.
A cryptographic currency may be a peer-to-peer digital currency in which a user of the cryptographic currency may transfer a value from a public key-address under a control of the user to a different public key-address under a control of a different user through a transaction that is propagated across a cryptocurrency network. The user may have many unique instances of the public key-address, as the user may be able to generate a new public key-address at will with a key generation software. For example, the user may create the new public key-address for each transaction. To allow the peer-to-peer cryptographic currency to function without a central authority, the set of transactions may be recorded in a peer-verification ledger at a set of cryptographic nodes that comprise the cryptocurrency network. The peer-verification ledger may be a publically available data comprising an entire set of the previous transactions of the cryptographic currency to allow the cryptographic node to verify the transaction is valid (e.g., to verify that a value is currency associated with the public key-address that the transaction is purporting to transfer the value from). The peer-verification ledger, while including within the publically available data a set of transactions and an associated set of public key-addresses that the value has been transferred to and/or from, may not have any information regarding a true identity of who may control a particular public key-address (e.g., who may control the private key that may allow the value transfer from the corresponding public key-address). The cryptographic currency may therefore be “pseudonymous,” that is, anonymous until the user discloses his or her control of the public key-address.
The cryptographic currency may be used by both a legitimate user and an illegitimate user. The illegitimate user may use the cryptographic currency to purchase contraband, support crime, and/or participate in terrorist activity. An analyst, who may be a law enforcement agency and/or an intelligence agency, may therefore be interested in monitoring or thwarting activity of a user of interest who is transacting in the cryptographic currency.
However, due to the pseudonymous nature of the cryptographic currency, the analyst may be unable to tell who sent and/or received the value of the cryptographic currency within a particular transaction. Criminals and/or terrorists, who may be synonymous with or comprise the user of interest, may continue to transact anonymously. Additionally, a thief of the cryptographic currency itself may use a hacking technique to obtain the private key of a legitimate user of the cryptographic currency and steal the value associated with the corresponding public key-address. Further, the user of interest may transact in several instances of the cryptographic currency, further complicating detection and surveillance efforts. The user of interest may therefore operate financially outside the control of a government authority that might otherwise be able to reduce crime and/or prevent terrorism by analyzing a set of global financial transactions.
Disclosed are a method, a device and/or a system of cryptographic currency user directory data and enhanced peer-verification ledger synthesis through multi-modal cryptographic key-address mapping.
In one embodiment, a method for multimodal cryptographic key-address mapping includes using a computer processor and a volatile memory to determine that a propagation packet is a transaction of a cryptographic currency propagating across a network for integration into a peer-verification ledger. The transaction includes a value transfer of the cryptographic currency between an input key-address of an input of the transaction and an output key-address of an output of the transaction. The method also extracts an IP address from a TCP/IP layer of the propagation packet associated with the transaction, and additionally extracts from the transaction a transactional hash associated with the input of the transaction. The transactional hash references a previous output of a previous transaction.
Further, the method analyzes the peer-verification ledger to determine the input key-address associated with the transactional hash referencing the previous output. The input key-address of the input of the transaction of the cryptographic currency propagating across the network for integration into the peer-verification ledger is then extracted. Next, the IP address from the TCP/IP layer of the propagation packet is linked with the input key-address of the input of the transaction. The method also determines that the input key-address of the input of the transaction is under a suspected control of a user of interest based upon an association between the user of interest and the IP address extracted from the TCP/IP layer of the propagation packet of the transaction.
The method may further include stratifying, within a user directory data, a designation of the suspected control of the input key-address of the input of the transaction into one or more designations of a provisional control and a designation of a verified control. This designation may be based upon a predetermined certainty of the association between the user of interest and the IP address extracted from the TCP/IP layer of the propagation packet of the transaction.
The propagation packet may be determined to be the transaction of the cryptographic currency based upon the identification, within an application layer protocol of the propagation packet, of a magic number associated with a specific cryptographic currency and/or the magic number located in a header field of the application layer protocol. A byte size of the propagation packet and a hash format associated with the specific cryptographic currency may also be used to determine the presence of the propagation packet. The method may also determine that a point-to-point packet relayed between the user of interest and a correspondent of the user of interest is a key-bearing communication that includes a relayed key-address of the key-bearing communication. The key-bearing communication may be a chat note, a social media message, a text message, and/or a voice call. The relayed key-address of the key-bearing communication may be extracted from the key-bearing communication, and it may be determined that the user directory data includes the relayed key-address of the key-bearing communication.
When the user directory data does not include the relayed key-address of the key-bearing communication, the method may create a new entry for the relayed key-address within the user directory data. Similarly, it may be designated, within the user directory data, that the relayed key-address of the key-bearing communication is under the suspected control of the user of interest.
The method may also stratify, within the user directory data, the designation of the suspected control of the relayed key-address of the key-bearing communication into one or more designations of the provisional control and the designation of the verified control. The stratification may be based upon a predetermined certainty of the association between the user of interest and an IP address of the key-bearing communication extracted from the TCP/IP layer of the peer-to-peer packet and/or an online identity associated with a transmission of the key-bearing communication. The point-to-point packet may be identified as associated with the key-bearing communication based on a length of a character string of the relayed key-address of the key-bearing communication, a leading character of the character string of the relayed key-address of the key-bearing communication, and/or the character string of the relayed key-address of the key-bearing communication being a base-58 alpha-numeric format.
The method may also determine that a web content comprises a key-bearing content having an exhibited key-address of the key-bearing content. The key-bearing content may be a markup language page, a forum post, an online cryptographic key directory entry, and/or a social media data. Additionally, using a web-scraper, the exhibited key-address of the key-bearing content may be extracted from the key-bearing content. Following this process, and within the user directory data, the exhibited key-address of the key-bearing content may be designated as under the suspected control of the user of interest based upon an association between the online identity responsible for creating the key-bearing content and the user of interest.
The method may consolidate a set of key-addresses within a control radius of the verified control of the user of interest into a crypto bank profile corresponding to the user of interest, and additionally verify that the transaction has been incorporated into a forming unit of the peer-verification ledger and/or a confirmed unit of the peer-verification ledger. A majority of a set of prepopulated key-addresses within the user directory data may be derived from a set of previous transactions of the peer-verification ledger.
Also, when a first key-address of a specific stratum of the provisional control of the user of interest and a second key-address of an unknown control are both used as the input of the transaction, the method may designate, within the user directory data, the second key-address of the input of the transaction as under the specific stratum of the provisional control of the user of interest. Similarly, when a third key-address under a first stratum of provisional control of the user of interest and a fourth key-address under a second stratum of provisional control of the user of interest are both used as the input of the transaction, the method may elevate the designation of the third key-address and the designation of the fourth key-address to be under the verified control or a third stratum of provisional control closer in certainty to the verified control as measured by the control radius.
It may also be determined, when the transaction has a first key-address of the output of the transaction and a second key-address of the output of the transaction, that the first key-address of the output of the transaction is a change key-address returning a portion of the value transfer of the transaction back to the user of interest associated with the input key-address of the input of the transaction. The first key-address of the output of the transaction may be identified as the change key-address. This identification may occur by determining that the transfer of the value to the second key-address of the output of the transaction is an approximate integer multiple of a unit of the cryptographic currency. The identification may also occur by determining, when the second key-address of the output of the transaction is used as a next key-address of a new input of a later transaction, that traveling a distance between a geographic origin of the transaction and the later transaction would be physically impracticable for a suspected controller of both the second key-address of the output of the transaction and the next key-address of the new input of the later transaction within an elapse time of the transaction and the later transaction. The method may designate, within the user directory data, the change key-address as under the suspected control of the user of interest.
The method also applies to specific mechanisms of the cryptographic currency. For example, the peer-verification ledger may be a block chain data with the forming unit being a forming block of the block chain data and the confirmed unit being a confirmed block of the block chain data. The method also applies to specific types of the cryptographic currency. For example, the cryptographic currency may be a bitcoin currency, and the hash format may be a string of twenty-seven to thirty-four base-58 alphanumeric characters beginning with a numeral “1” or a numeral “3”.
In another embodiment, a method includes determining that a propagation packet is a transaction of a cryptographic currency propagating across a network for integration into a peer-verification ledger, the transaction including a value transfer of the cryptographic currency between an input key-address of an input of the transaction and an output key-address of an output of the transaction. Next, an IP address from a TCP/IP layer of the propagation packet associated with the transaction is extracted. Similarly extracted from the transaction is a transactional hash associated with the input of the transaction. The transactional hash referencing a previous output of a previous transaction.
The peer-verification ledger is then analyzed to determine the input key-address associated with the transactional hash referencing the previous output. The input key-address of the input of the transaction of the cryptographic currency propagating across the network for integration into the peer-verification ledger is then extracted, allowing for the linking of the IP address from the TCP/IP layer of the propagation packet with the input key-address of the input of the transaction. Within an enhanced ledger data it is then designated that the input key-address of the input of the transaction is under a suspected control of a user of interest, based upon an association between the user of interest and the IP address extracted from the TCP/IP layer of the propagation packet of the transaction.
In yet another embodiment, a system includes a collection server associated with an access point and having a computer processor and physical memory. The collection server intercepts an internet protocol packet determined by the collection server to have an association with a transaction of a cryptographic currency propagating across a network for integration into a peer-verification ledger and/or a key-bearing communication between a user of interest and a correspondent of the user of interest.
The system also includes an IP extraction module to extract an IP address from a TCP/IP layer of the propagation packet associated with the transaction and/or the key-bearing communication. A key extraction module extracts a transactional hash of an input of the transaction of the cryptographic currency propagating across the network for integration into the peer-verification ledger and/or extracts a relayed key-address of the key-bearing communication between the user of interest and the correspondent of the user of interest. Finally, the system includes a network, a cryptocurrency network, and a directory server that houses a ledger copy data, a user directory data, and/or an enhanced ledger data.
The embodiments of this invention are illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:
Other features of the present embodiments will be apparent from the accompanying drawings and from the detailed description that follows.
Disclosed are a method, a device and a system of cryptographic currency user directory data and enhanced peer-verification ledger synthesis through multi-modal cryptographic key-address mapping. Although the present embodiments have been described with reference to specific example embodiments, it will be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the various embodiments.
In
In a first mode of cryptographic key-address mapping, the directory server 100 may probe for and collect the propagation packet (which may be an internet protocol packet, e.g., the propagation packet 301 of
The propagation of the transaction to the cryptocurrency network 110, as initiated by the user of interest 118, is seen in ‘circle 1’ of
A second primary mode of cryptographic key-address mapping may be the addition to the enhanced ledger data 102 and/or the user directory data 104 of information derived from intercepted communications and/or transactions between the user of interest 118 and the correspondent 120 of the user of interest 118. The collection server 106, with its access point 108 located at the communication node 114 of the wide area network 101, may be able to identify a communication having a public key-address and/or a private key (e.g., the key-bearing communication 606 of
Another source of cryptographic key-address mapping used to populate the enhanced ledger data 102 and/or the user directory data 104 may include information that the user of interest 118 may make available on a public forum, a web page, and/or a markup-language page hosted on the web host 116. In
The cryptographic currency may be a medium of exchange designed to securely exchange information through a public, peer-to-peer transaction verification process enabled by certain principles of cryptography. The cryptographic currency may also be a type of digital currency that is based on cryptography to ensure security, making the cryptographic currency difficult to counterfeit. The cryptographic currency may be a medium of exchange using public and private keys to transfer the value of the currency from one person to another. The cryptographic currency may also be referred to as a crypto-currency, a cyber currency, a digital cash, a digital currency, a digital money, an e-currency, an e-money, an electronic cash, an electronic currency, and an electronic money. A specific instance of the cryptographic currency is Bitcoin (which may be denoted BTC), which launched in 2009. Other specific examples of the cryptographic currency include Litecoin (LTC), Namecoin (NMC), Dogecoin (Doge) and Masertercoin (MSC).
The cryptocurrency network 110 may be a network of peer-to-peer nodes (e.g., the cryptographic node 112) that process the transaction of the value transfer of the cryptographic currency from a first public key-address (e.g., the input key-address of the transaction) to a second public key-address (e.g., the output key-address of the transaction). The transaction is broadcast to the cryptocurrency network 110 and included in a peer-verification ledger, a copy of which may be located at or associated with the cryptographic node 112. A person and/or an organization associated with the cryptographic node may participate in the cryptocurrency network 110—specifically, by keeping a public copy of a peer-verification ledger that records the set of transaction—because a software code implementing the cryptocurrency network 110 may reward the person and/or the organization for doing so. This reward may take the form of randomly awarding a predetermined value of the cryptographic currency, a probability of receiving the reward proportionate upon a total computational power contributed to processing the set of transactions of the cryptocurrency network 110. Dedicating or contributing a computing power to the cryptocurrency network 110 in an effort to receive the reward may be referred to as “mining” the cryptographic currency. A distributed nature of the peer-verification ledger may ensure that the value of the cryptographic currency associated with a particular public key-address cannot be spent twice. Each user of the cryptocurrency network may potentially have many instances of the public key-address. Although one form of the cryptographic currency has been described, the user directory data 104 and/or the enhanced ledger data may be comprised of additional instances of the cryptographic currency that use a public key-address with a corresponding private key, even where the additional instance of the cryptographic currency uses a different reward structure and/or a different peer-verification process.
The cryptocurrency network 110 may be comprised of the cryptographic nodes 112 to publically verify a set of transactions of users of the cryptographic currency. The cryptographic node 112 may be a node that participates in the cryptocurrency network 110 by relaying the transaction, maintaining the peer-verification ledger, and/or “mining” for the cryptographic currency (e.g., attempting to receive the reward by participating in the maintenance of the cryptocurrency network 110).
The access point 108 may be a location at which the collection server 106A may be communicatively coupled to a backbone transport of the wide area network 101 to replicate and analyze information and/or traffic over the backbone transport. The access point 108 may also be any other location that may allow for an interception of information and/or an interception of data across the wide area network 101. One or more of the set of collection servers 106 through 106N may be associated with the access point and communicatively coupled with the directory server 100. The set of collection servers 106A through 106N may be responsible for identifying which of a set of information moving past the access point 108 associated with a particular collection server 106 should be analyzed and/or conveyed to the directory server 100.
The ISP 109 may be an organization that provides services for accessing, using, or participating in the Internet and/or other communications and transactions over the wide area network 101. The ISP 109 may be an organization that is commercial, community-owned, non-profit, or otherwise privately owned. The user of interest 118 may refer to a specific person and/or a group of people such as an organization. For example, a non-profit organization may be a user of interest, as might be a government, a business, or a terrorist organization. In some cases, the user of interest 118 may only refer to an online identity, as a controller of the online identity (e.g., the natural person and/or organization that controls the use of the online identity) may be unknown. In one or more embodiments, each and every user of the cryptographic currency may be the user of interest 118. The correspondent 120 of the user of interest 118 may also be a specific person and/or a group of people such as an organization, or may be an online identity when no additional information of the correspondent is known. Similarly, the analyst 122 may represent a natural person and/or an organization. For example, analyst 122 may be a government law enforcement agency, a security agency, a non-profit corporation or educational institution, and/or an agent or employee of any of these organizations. The analyst 122 may use the enhanced ledger data 102 and/or the user directory data 104 to improve an integrity of the cryptocurrency network 110 (e.g., by catching a cryptocurrency thief), study a behavioral pattern of a use of the cryptographic currency (e.g., economics), or to gather an information related to criminal activity and/or collect intelligence (for example, to thwart a terrorist activity).
The auxiliary memory 107 may include the peer-verification ledger 200 that may be referenced in forming the enhanced ledger data 102 and/or the user directory data 104 as described in conjunction with
The enhanced ledger data 102 may include an enhanced transaction entry 202 that may be a form of the transaction as incorporated into the peer-verification ledger but with added information such as a name of the user of interest 118 (and/or their IP address) associated with the input key-address and/or the output key-address of the transaction. The user directory data 104 may include a crypto bank profile 240 of the user of interest that organizes the set of public key-addresses of one or more cryptographic currencies believed to be under the suspected control of the user of interest.
The transaction identification module 210 may identify the propagation packet as being a transaction of the cryptographic currency as described in conjunction with
In
The transaction 304 is comprised of an input 306 of one or more instances of a public key-addresses 300. In
The one or more instances of the input key-addresses referenced by the transactional hash 302 may be under the control of the user of interest 118 when the directory server 100 includes a known association between the IP address 303 and the user of interest 118. For example, the directory server 100 may have a recorded information that the user of interest 118 may subscribe to a particular instance of the ISP 109 with a limited number of dynamically assigned instances of the IP address 303. A propagation packet 301 that has the IP address 303 within the limited number of dynamically assigned instances of the IP address 303 may therefore be indicative of having been propagated by the user of interest 118.
The transaction 304 may also include a public key-address 300 of the output 308 that is under the control of the user of interest 118. For example, due to the design of the cryptographic currency that utilizes the peer-verification ledger, the change key-address 312 may be required to return a portion of the input 306 of the transaction 304 back to the user of interest 118 to avoid overpayment. It is sometimes impossible to recognize the change key-address within the output 308. However, as people often think in integers, it may be possible to determine the change key-address 312 as a public key-address 300 of the output 308 that did not receive an integer value portion of the value transfer 314.
The transaction identification module 210 may also identify the propagation packet based upon a magic number value within a field header of the application layer of the propagation packet. The magic number value may indicate an origin of a message on a network. For example the magic number value may be the first four bytes of the protocol specification 400. In one or more alternate embodiments, the magic number value may be a version field (e.g., having the raw transaction data 404 of ‘01 00 00 00’ in
Operation 508 may extract the input key-address of the input of the transaction, for example by extracting the input key-address from the peer-verification ledger. In some instances of the cryptographic currency, however, the input key-address may be extracted directly from propagation packet 301. Operation 510 may link the internet protocol address (e.g., IP address 303) from the TCP/IP layer of the internet protocol packet with the input key-address of the input of the transaction. Operation 512 may determine that the input key-address of the input of the transaction 304 is under a suspected control of a user of interest based upon an association between the user of interest and the IP address. Operation 512, for example, may be conducted by the control verification module 212.
In
The key-bearing communication 606, in addition to the email, may be a text message, an SMS message, an internet chat message, and/or a social media message. The key-bearing communication 606 may also be any other form of an electronic communication that comprises a set of characters and is sent from one point to another over the wide area network 101. The key-bearing communication 606 may additionally be a voice call, which the collection server 106 may translate into text (e.g., VoIP). Although
In
After the user 118 posts to and/or creates the web content 801, the exhibition scanning module 214 may scrape the web content 801 using a “web scraper” may determine that the web content 801 is the key-bearing content 806. The web scraper, for example, may operate by a grep command and/or a regular expression matching function. The web scraper may recognize the public key-address of the cryptographic currency by a hash format of the cryptographic currency. For example, the exhibited key-address 800 may be identified by the exhibition scanning module 214 by being a string of twenty-seven to thirty-four base-58 alphanumeric characters. The particular instance of the cryptographic currency to which the exhibited key-address 800 may belong may occur by analyzing the beginning character of the string. For example, either a numeral “1” and or numeral “3” may stand for the public key-address of the Bitcoin cryptographic currency. The Exhibition scanning module 214 may also reference the peer-verification ledger of one or more instances of the cryptographic currency to verify that a string of characters is the exhibited key-address 800. In addition to character recognition, the web scraper may have a semantic notation recognition that recognizes a semantics within the web content 801, the semantics commonly associated with and/or placed in conjunction with display of the public key-address (that may be the exhibited key-address 800).
In
The block number 1000 may be a sequential order of the blocks of the block chain going back to a first transaction of the cryptographic currency. A block having the highest number may be a forming unit of the peer-verification ledger, specifically, a forming block. A block having any other number may be a confirmed unit of the peer-verification ledger, specifically, a confirmed block. A common property of one or more instances of the cryptographic currency may be that a new block forms at approximately equal intervals of time (e.g., about 10 minutes). The block hash 1002 may be a unique identifier of each block that prevents a data comprising the block from being altered without drastically changing the identifier. The time 1004 may be a time in which the cryptographic node 112 received the block in a complete (e.g., solidified) form. The number of transactions 1006 may show the total instances of the transaction 304 that occur within the block, and the total BTC 1008 may show the total number of Bitcoins transferred from a set of input key-addresses to a set of output key-addresses within the block (e.g., a sum total of the value transfer 314 of each instance of the transaction within the block). The size 1010 may be the size of the block in kilobytes.
The user activity 1012 may show one or more instances of the user of interest 118 that may have transacted within the block. For example, as shown in
The analyst 122 may examine the enhanced ledger data in real-time to determine useful information about, execute surveillance on and/or gather intelligence about one or more instances of the user of interest 118. The analyst 122 may also set a condition for the alerts 1014, such as requesting the alert 1014 when a public key-address under the suspected control of a specific user of interest 118 transfers and/or receives over a certain value of the cryptographic currency. When one of the alerts 1014 set by the user is displayed, the analyst 122 may choose to inspect the block giving rise to the user activity 1012. For example, in the embodiment of
In
The from (name) field 1106 and the from to (name) field 1110 may contain the name of the user of interest believed to have the suspected control of one or more instances of the public key-address 300 that comprise one or more instances of the input key-address and one or more instances of the output key-address.
Each user of interest 118 placed on the enhanced ledger data 102 may have a suspected control over one or more of the public key-addresses 300 that comprise the peer-verification ledger and/or the enhanced ledger data 102. The suspected control designation may be assigned and/or managed by the control verification module 212 of
In another example, an internal analysis of the peer-verification ledger may determine that an output key-address is a change key-address returning a portion of the transfer of value of the transaction 304 to the controller the input key-address of the transaction 304. This determination may occur, for example, when within the transaction 304 an integer value of the cryptographic currency is transferred to a first output key-address and a decimal value of the cryptographic currency is transferred to a second key-address. Because the user of interest 118 may tend to think and/or transact with integers (and/or common fractions, such as 5.25, 3.125, 0.3333), the second key-address may tend to be an excess of the transfer of value 314 transferred back to the public key-address 300 controlled by the user of interest 118. Therefore, the suspected control may attach to the change key-address 312. For example, in
A specific public key-address 300 may be designated as under the suspected control of more than one instance of the user of interest 118 at a given time. However, due to the ease of generating a new public key-address, it may be unlikely that the specific public key-address 300 would be under the actual control of more than one instance of the user of interest 118. The actual control of the public key-address 300 may never be able to be fully determined. Rather, the suspected control may be stratified by the level of certainty into a set of provisional control levels and/or a verified control that may represent the highest level of certainty of the association between the user of interest 118 and the public key-address 300. In one embodiment, the enhanced ledger data 102, the user directory data 104 and/or the crypto bank profile 240 may only display to the analyst 122 a sub-set of public key-addresses under the suspected control of the user of interest 118 within a certain radius of the verified control. For example, the analyst may specify to apply a filter that only allows the from (name) field 1106 and/or the to (name) 1110 to display users of interest 118 with a suspected control of a verified state or a provisional certainty up to two levels below the verified state.
The control verification module 212 may also apply an algorithm that may adjust the designation of the suspected control of the public key-address 300 based upon its relationship to one or more additional instances of the public key-address 300. For example, where three instances of the public key-address 300 with a low certainty of association to the user of interest are used together as the input of the transaction, the control verification module may elevate the low certainty to a high certainty, which may be reflected as raising the provisional control designation from a ‘2’ to a to and/or the verified control. As will be explained in conjunction with
In
Within the name field 1200 may be placed the true name of the user of interest 118 (e.g., “William Smith,” “Organization X”) and/or an online identity (e.g., a handle such as “User_259” or an email address such as “xyz@gmail.com”). The currency field 1202 may display the particular instance of the currency associated with the public key-address 300 of the public key-address field 1204. The suspected control value field 1206 may contain the suspected control of the user of interest 118 over the public key-address 300, and the balance field 1208 may contain a remaining balance of the cryptographic currency remaining on the public key-address 300 shown in public key-address field 1204. The remaining balance may ordinarily be able to be determined from examination of the peer-verification ledger.
The last block field 1210 may show the last block that the public key-address 300 uses used in (e.g., used as an input key-address and/or an output key-address) and may allow the analyst to click on a link within the GUI displaying the user directory data to allow the user to view the block (e.g., the block 1100 of
Finally, the private key field 1214 may contain the private key corresponding to the public key-address 300. In many instances, the private key will not be known. However, in some cases, the private key may form part of a communication between the user of interest 118 and the correspondent 120, for example when the user of interest 118 relays the private key through the point-to-point packet 601 so that both the user of interest 118 and the correspondent 120 may have a joint control over the corresponding instance of the public key-address 300. Configuring the set of collection servers 106A through 106N to find and extract the private key may have an additional utility. In some cases, the public key-address 300 may be stored in a “wallet” file on the device 113 of the user of interest 118 to manage a corresponding private key. A hacker may attempt to export files associated with the wallet quickly and in an unencrypted format to effectuate a value transfer from a set of public key-addresses 300 within the wallet and thus steal the cryptographic currency. In such case, the transaction identification module 210 may be able to spot the private key within a wallet .DAT file format (and/or an additional format suitable to export the private key), along with the IP address 303 of the TCP/IP layer of the internet protocol packet carrying the wallet .DAT file format, to help catch the thief. Identification of the private key for a user of interest 118 may also allow the analyst 122 to “seize” the value associated with the corresponding public key-address 300 by effectuating the value transfer 314 from the corresponding public key-address 300 to a different public key-address 300 under the actual control of the analyst 122.
A penultimate entry of
In
At a second time ‘t=2’, the unknown user 1318, who may be located in Cape Town, South Africa, may propagate a later transaction using the second output key-address as the next key-address of a new input of the later transaction. When the average travel distance between Vancouver, B.C., and Cape Town, South Africa may take approximately 23 hours by a commercial airliner, and an elapse time between the first time and the second time is less than 12 hours, the directory server 100 may determine that the first output key-address is the change key-address of the transaction 304 and place the first output key-address under the suspected control of the user of interest 118.
In one embodiment, a method for multimodal cryptographic key-address mapping includes using a computer processor 103 and a volatile memory 105 to determine that a propagation packet 301 is a transaction 304 of a cryptographic currency propagating across a network 101 for integration into a peer-verification ledger 200. The transaction 304 includes a value transfer 314 of the cryptographic currency between an input key-address of an input 306 of the transaction 304 and an output key-address of an output 308 of the transaction 304. The method also extracts an IP address 303 from a TCP/IP layer of the propagation packet 301 associated with the transaction 304, and additionally extracts from the transaction 304 a transactional hash 302 associated with the input 306 of the transaction 304. The transactional hash 302 references a previous output 308 of a previous transaction 304.
Further, the method analyzes the peer-verification ledger 200 to determine the input key-address associated with the transactional hash 302 referencing the previous output. The input key-address of the input 306 of the transaction 304 of the cryptographic currency propagating across the network 101 for integration into the peer-verification ledger 200 is then extracted. Next, the IP address 303 from the TCP/IP layer of the propagation packet 301 is linked with the input key-address of the input 306 of the transaction 304. The method also determines that the input key-address of the input 306 of the transaction 304 is under a suspected control of a user of interest 118 based upon an association between the user of interest 118 and the IP address 303 extracted from the TCP/IP layer of the propagation packet 301 of the transaction 304.
The method may further include stratifying, within a user directory data 104, a designation of the suspected control of the input key-address of the input 306 of the transaction 304 into one or more designations of a provisional control and a designation of a verified control. This designation may be based upon a predetermined certainty of the association between the user of interest 118 and the IP address 303 extracted from the TCP/IP layer of the propagation packet 301 of the transaction 304.
The propagation packet 301 may be determined to be the transaction 304 of the cryptographic currency based upon the identification, within an application layer protocol 305 of the propagation packet 301, of a magic number associated with a specific cryptographic currency and/or the magic number located in a header field of the application layer protocol 305. A byte size of the propagation packet 301 and a hash format associated with the specific cryptographic currency may also be used to determine the presence of the propagation packet 301. The method may also determine that a point-to-point packet 601 relayed between the user of interest 118 and a correspondent 120 of the user of interest 118 is a key-bearing communication 606 that includes a relayed key-address 606 of the key-bearing communication 606. The key-bearing communication 606 may be a chat note, a social media message, a text message, and/or a voice call. The relayed key-address 606 of the key-bearing communication 606 may be extracted from the key-bearing communication 606, and it may be determined that the user directory data 104 includes the relayed key-address 606 of the key-bearing communication 606.
When the user directory data 104 does not include the relayed key-address 606 of the key-bearing communication 606, the method may create a new entry for the relayed key-address 606 within the user directory data 104. Similarly, it may be designated, within the user directory data 104, that the relayed key-address 606 of the key-bearing communication 606 as under the suspected control of the user of interest 118.
The method may also stratify, within the user directory data 104, the designation of the suspected control of the relayed key-address 606 of the key-bearing communication 606 into one or more designations of the provisional control and the designation of the verified control. The stratification may be based upon a predetermined certainty of the association between the user of interest 118 and an IP address 303 of the key-bearing communication 606 extracted from the TCP/IP layer of the peer-to-peer packet and/or an online identity associated with a transmission of the key-bearing communication 606. The point-to-point packet 601 may be identified as associated with the key-bearing communication 606 based on a length of a character string of the relayed key-address 606 of the key-bearing communication 606, a leading character of the character string of the relayed key-address 606 of the key-bearing communication 606, and/or the character string of the relayed key-address 606 of the key-bearing communication 606 being a base-58 alpha-numeric format.
The method may also determine that a web content 801 comprises a key-bearing content 806 having an exhibited key-address 800 of the key-bearing content 806. The key-bearing content 806 may be a markup language page, a forum post, an online cryptographic key directory entry, and/or a social media data. Additionally, using a web-scraper, the exhibited key-address 800 of the key-bearing content 806 may be extracted from the key-bearing content 806. Following this process, and within the user directory data 104, the exhibited key-address 800 of the key-bearing content 806 may be designated as under the suspected control of the user of interest 118 based upon an association between the online identity responsible for creating the key-bearing content 806 and the user of interest 118.
The method may consolidate a set of key-addresses within a control radius of the verified control of the user of interest 118 into a crypto bank profile 240 corresponding to the user of interest 118, and additionally verify that the transaction 304 has been incorporated into a forming unit of the peer-verification ledger 200 and/or a confirmed unit of the peer-verification ledger 200. A majority of a set of prepopulated key-addresses within the user directory data 104 may be derived from a set of previous transactions of the peer-verification ledger 200.
Also, when a first key-address of a specific stratum of the provisional control of the user of interest 118 and a second key-address of an unknown control are both used as the input 306 of the transaction 304, the method may designate, within the user directory data 104, the second key-address of the input 306 of the transaction 304 as under the specific stratum of the provisional control of the user of interest 118. Similarly, when a third key-address under a first stratum of provisional control of the user of interest 118 and a fourth key-address under a second stratum of provisional control of the user of interest 118 are both used as the input 306 of the transaction 304, the method may elevate the designation of the third key-address and the designation of the fourth key-address to be under the verified control or a third stratum of provisional control closer in certainty to the verified control as measured by the control radius.
It may also be determined, when the transaction 304 has a first key-address of the output 308 of the transaction 304 and a second key-address of the output 308 of the transaction 304, that the first key-address of the output 308 of the transaction 304 is a change key-address 312 returning a portion of the value transfer 314 of the transaction 304 back to the user of interest 118 associated with the input key-address of the input 306 of the transaction 304. The first key-address of the output 308 of the transaction 304 may be identified as the change key-address 312. This identification may occur by determining that the transfer of the value to the second key-address of the output 308 of the transaction 304 is an approximate integer multiple of a unit of the cryptographic currency. The identification may also occur by determining, when the second key-address of the output 308 of the transaction 304 is used as a next key-address of a new input 306 of a later transaction, that traveling a distance between a geographic origin of the transaction 304 and the later transaction 304 would be physically impracticable for a suspected controller of both the second key-address of the output 308 of the transaction 304 and the next key-address of the new input 306 of the later transaction 304 within an elapse time of the transaction 304 and the later transaction 304. The method may designate, within the user directory data 104, the change key-address 312 as under the suspected control of the user of interest 118.
The method also applies to specific mechanisms of the cryptographic currency. For example, the peer-verification ledger 200 may be a block chain data with the forming unit being a forming block of the block chain data and the confirmed unit being a confirmed block of the block chain data. The method also applies to specific types of the cryptographic currency. For example, the cryptographic currency may be a bitcoin currency, and the hash format may be a string of twenty-seven to thirty-four base-58 alphanumeric characters beginning with a numeral “1” or a numeral “3”.
In another embodiment, a method includes determining that a propagation packet 301 is a transaction 304 of a cryptographic currency propagating across a network 101 for integration into a peer-verification ledger 200, the transaction 304 including a value transfer 314 of the cryptographic currency between an input key-address of an input 306 of the transaction 304 and an output key-address of an output 308 of the transaction 304. Next, an IP address 303 from a TCP/IP layer of the propagation packet 301 associated with the transaction 304 is extracted. Similarly extracted from the transaction 304 is a transactional hash 302 associated with the input 306 of the transaction 304. The transactional hash 302 referencing a previous output 308 of a previous transaction 304.
The peer-verification ledger 200 is then analyzed to determine the input key-address associated with the transactional hash 302 referencing the previous output. The input key-address of the input 306 of the transaction 304 of the cryptographic currency propagating across the network 101 for integration into the peer-verification ledger 200 is then extracted, allowing for the linking of the IP address 303 from the TCP/IP layer of the propagation packet 301 with the input key-address of the input 306 of the transaction 304. Within an enhanced ledger data 102 it is then designated that the input key-address of the input 306 of the transaction 304 as under a suspected control of a user of interest 118 based upon an association between the user of interest 118 and the IP address 303 extracted from the TCP/IP layer of the propagation packet 301 of the transaction 304.
In yet another embodiment, a system includes a collection server 106 associated with an access point 108 and having a computer processor 103 and physical memory. The collection server 106 intercepts an internet protocol packet determined by the collection server 106 to have an association with a transaction 304 of a cryptographic currency propagating across a network 101 for integration into a peer-verification ledger 200 and/or a key-bearing communication 606 between a user of interest 118 and a correspondent 120 of the user of interest 118.
The system also includes an IP extraction module 208 to extract an IP address 303 from a TCP/IP layer of the propagation packet 301 associated with the transaction 304 and/or the key-bearing communication 606. A key extraction module 206 extracts a transactional hash 302 of an input 306 of the transaction 304 of the cryptographic currency propagating across the network 101 for integration into the peer-verification ledger 200 and/or extracts a relayed key-address 606 of the key-bearing communication 606 between the user of interest 118 and the correspondent 120 of the user of interest 118. Finally, the system includes a network 101, a cryptocurrency network 110, and a directory server 100 that houses a ledger copy data, a user directory data 104, and/or an enhanced ledger data.
Although the present embodiments have been described with reference to specific example embodiments, it will be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the various embodiments. For example, the various devices and modules described herein may be enabled and operated using hardware circuitry (e.g., CMOS based logic circuitry), firmware, software or any combination of hardware, firmware, and software (e.g., embodied in a non-transitory machine-readable medium). For example, the various electrical structure and methods may be embodied using transistors, logic gates, and electrical circuits (e.g., application specific integrated (ASIC) circuitry and/or Digital Signal Processor (DSP) circuitry).
In addition, it will be appreciated that the various operations, processes and methods disclosed herein may be embodied in a non-transitory machine-readable medium and/or a machine-accessible medium compatible with a data processing system (e.g., the set of collection servers 106A through 106N, the directory server 100). Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.
The structures and modules in the figures may be shown as distinct and communicating with only a few specific structures and not others. The structures may be merged with each other, may perform overlapping functions, and may communicate with other structures not shown to be connected in the figures. Accordingly, the specification and/or drawings may be regarded in an illustrative rather than a restrictive sense.
In addition, the logic flows depicted in the figures do not require the particular order shown, or sequential order, to achieve desirable results. In addition, other steps may be provided, or steps may be eliminated, from the described flows, and other components may be added to, or removed from, the described systems. Accordingly, other embodiments are within the scope of the preceding disclosure.
Number | Name | Date | Kind |
---|---|---|---|
5185860 | Wu | Feb 1993 | A |
5444850 | Chang | Aug 1995 | A |
5475819 | Miller et al. | Dec 1995 | A |
5675741 | Aggarwal et al. | Oct 1997 | A |
5796952 | Davis et al. | Aug 1998 | A |
5835580 | Fraser | Nov 1998 | A |
5835720 | Nelson et al. | Nov 1998 | A |
5862223 | Walker et al. | Jan 1999 | A |
5878384 | Johnson et al. | Mar 1999 | A |
5894311 | Jackson | Apr 1999 | A |
5944790 | Levy | Aug 1999 | A |
5954797 | Sidey | Sep 1999 | A |
5958010 | Agarwal et al. | Sep 1999 | A |
5987430 | Van Horne et al. | Nov 1999 | A |
5996011 | Humes | Nov 1999 | A |
6006260 | Barrick, Jr. et al. | Dec 1999 | A |
6012088 | Li et al. | Jan 2000 | A |
6055542 | Nielsen et al. | Apr 2000 | A |
6055573 | Gardenswartz et al. | Apr 2000 | A |
6078956 | Bryant et al. | Jun 2000 | A |
6112240 | Pogue et al. | Aug 2000 | A |
6115742 | Franklin et al. | Sep 2000 | A |
6119164 | Basche | Sep 2000 | A |
6134592 | Montulli | Oct 2000 | A |
6148342 | Ho | Nov 2000 | A |
6151631 | Ansell et al. | Nov 2000 | A |
6182075 | Hsu | Jan 2001 | B1 |
6289341 | Barney | Sep 2001 | B1 |
6314460 | Knight et al. | Nov 2001 | B1 |
6317792 | Mundy et al. | Nov 2001 | B1 |
6321256 | Himmel et al. | Nov 2001 | B1 |
6321336 | Applegate et al. | Nov 2001 | B1 |
6321338 | Porras et al. | Nov 2001 | B1 |
6327619 | Blumenau | Dec 2001 | B1 |
6359557 | Bilder | Mar 2002 | B2 |
6373838 | Law et al. | Apr 2002 | B1 |
6377987 | Kracht | Apr 2002 | B1 |
6385024 | Olson | May 2002 | B1 |
6393460 | Gruen et al. | May 2002 | B1 |
6393461 | Okada et al. | May 2002 | B1 |
6393479 | Glommen et al. | May 2002 | B1 |
6404860 | Casellini | Jun 2002 | B1 |
6425007 | Messinger | Jul 2002 | B1 |
6442590 | Inala et al. | Aug 2002 | B1 |
6449604 | Hansen et al. | Sep 2002 | B1 |
6466981 | Levy | Oct 2002 | B1 |
6466984 | Naveh et al. | Oct 2002 | B1 |
6470386 | Combar et al. | Oct 2002 | B1 |
6487538 | Gupta et al. | Nov 2002 | B1 |
6507869 | Franke et al. | Jan 2003 | B1 |
6516345 | Kracht | Feb 2003 | B1 |
6564261 | Gudjonsson et al. | May 2003 | B1 |
6591251 | Leon et al. | Jul 2003 | B1 |
6606657 | Zilberstein et al. | Aug 2003 | B1 |
6658465 | Touboul | Dec 2003 | B1 |
6665715 | Houri | Dec 2003 | B1 |
6678720 | Matsumoto et al. | Jan 2004 | B1 |
6714977 | Fowler et al. | Mar 2004 | B1 |
6721726 | Swaminathan et al. | Apr 2004 | B1 |
6725377 | Kouznetsov | Apr 2004 | B1 |
6760761 | Sciacca | Jul 2004 | B1 |
6782421 | Soles et al. | Aug 2004 | B1 |
6792458 | Muret et al. | Sep 2004 | B1 |
6795856 | Bunch | Sep 2004 | B1 |
6804701 | Muret et al. | Oct 2004 | B2 |
6892226 | Tso et al. | May 2005 | B1 |
6925454 | Lam et al. | Aug 2005 | B2 |
6941321 | Schuetze et al. | Sep 2005 | B2 |
6957229 | Dyor | Oct 2005 | B1 |
6973577 | Kouznetsov | Dec 2005 | B1 |
6981047 | Hanson et al. | Dec 2005 | B2 |
6983317 | Bishop et al. | Jan 2006 | B1 |
6985901 | Sachse et al. | Jan 2006 | B1 |
7006508 | Bondy et al. | Feb 2006 | B2 |
7027398 | Fang | Apr 2006 | B2 |
7027416 | Kriz | Apr 2006 | B1 |
7031941 | Garrow et al. | Apr 2006 | B2 |
7039699 | Narin et al. | May 2006 | B1 |
7046247 | Hao et al. | May 2006 | B2 |
7047294 | Johnson et al. | May 2006 | B2 |
7050396 | Cohen et al. | May 2006 | B1 |
7055174 | Cope et al. | May 2006 | B1 |
7058704 | Mangipudi et al. | Jun 2006 | B1 |
7058976 | Dark | Jun 2006 | B1 |
7076275 | Karstens et al. | Jul 2006 | B1 |
7083095 | Hendrick | Aug 2006 | B2 |
7093020 | McCarty et al. | Aug 2006 | B1 |
7143151 | Kayashima et al. | Nov 2006 | B1 |
7152103 | Ryan et al. | Dec 2006 | B1 |
7152108 | Khan et al. | Dec 2006 | B1 |
7152242 | Douglas | Dec 2006 | B2 |
7171681 | Duncan et al. | Jan 2007 | B1 |
7203674 | Cohen | Apr 2007 | B2 |
7206835 | Kusumoto et al. | Apr 2007 | B2 |
7212491 | Koga | May 2007 | B2 |
7216110 | Ogg et al. | May 2007 | B1 |
7228566 | Caceres et al. | Jun 2007 | B2 |
7231448 | O'Steen et al. | Jun 2007 | B1 |
7246162 | Tindal | Jul 2007 | B2 |
7257722 | Sone | Aug 2007 | B2 |
7277938 | Duimovich et al. | Oct 2007 | B2 |
7277941 | Ignatius et al. | Oct 2007 | B2 |
7278037 | Sone | Oct 2007 | B2 |
7313625 | Tindal et al. | Dec 2007 | B2 |
7328242 | McCarthy et al. | Feb 2008 | B1 |
7346658 | Simpson | Mar 2008 | B2 |
7356576 | Rabe | Apr 2008 | B2 |
7359967 | Synnestvedt et al. | Apr 2008 | B1 |
7373399 | Steele et al. | May 2008 | B2 |
7376722 | Sim et al. | May 2008 | B1 |
7386613 | Piccirilli et al. | Jun 2008 | B2 |
7386883 | Bardsley et al. | Jun 2008 | B2 |
7406516 | Davis et al. | Jul 2008 | B2 |
7437444 | Houri | Oct 2008 | B2 |
7437761 | Takahashi | Oct 2008 | B2 |
7447909 | Reith | Nov 2008 | B2 |
7466690 | Schrodi | Dec 2008 | B2 |
7472412 | Wolf et al. | Dec 2008 | B2 |
7474617 | Molen et al. | Jan 2009 | B2 |
7478161 | Bernet et al. | Jan 2009 | B2 |
7490065 | Ogg et al. | Feb 2009 | B1 |
7496049 | Estrada et al. | Feb 2009 | B2 |
7506072 | Waldorf et al. | Mar 2009 | B2 |
7523191 | Thomas et al. | Apr 2009 | B1 |
7526541 | Roese et al. | Apr 2009 | B2 |
7535993 | Cai et al. | May 2009 | B2 |
7536459 | Johnson et al. | May 2009 | B2 |
7570743 | Barclay et al. | Aug 2009 | B2 |
7571237 | Pfitzmann | Aug 2009 | B2 |
7580356 | Mishra et al. | Aug 2009 | B1 |
7587453 | Bhrara et al. | Sep 2009 | B2 |
7587757 | Scoggins et al. | Sep 2009 | B2 |
7617160 | Grove et al. | Nov 2009 | B1 |
7624144 | Mitrov | Nov 2009 | B1 |
7627664 | Sutou et al. | Dec 2009 | B2 |
7631007 | Morris | Dec 2009 | B2 |
7636680 | Gatto | Dec 2009 | B2 |
7639613 | Ghannadian et al. | Dec 2009 | B1 |
7647406 | Liu | Jan 2010 | B2 |
7657540 | Bayliss | Feb 2010 | B1 |
7664974 | Sone | Feb 2010 | B2 |
7676570 | Levy et al. | Mar 2010 | B2 |
7698457 | Ghetie et al. | Apr 2010 | B2 |
7730120 | Singh et al. | Jun 2010 | B2 |
7747737 | Apte et al. | Jun 2010 | B1 |
7769851 | Guruswamy et al. | Aug 2010 | B1 |
7779073 | Hoile et al. | Aug 2010 | B2 |
7809826 | Guruswamy | Oct 2010 | B1 |
7835406 | Oran et al. | Nov 2010 | B2 |
7852849 | Davidson et al. | Dec 2010 | B2 |
7873719 | Bishop et al. | Jan 2011 | B2 |
7885194 | Narin et al. | Feb 2011 | B1 |
7886049 | Adelstein et al. | Feb 2011 | B2 |
7904478 | Yu et al. | Mar 2011 | B2 |
7904554 | Lu et al. | Mar 2011 | B1 |
7933926 | Ebert | Apr 2011 | B2 |
7941507 | Murphy, Jr. et al. | May 2011 | B1 |
7953851 | Britton et al. | May 2011 | B2 |
7958233 | Fernández Gutierrez | Jun 2011 | B2 |
7958267 | Eiras et al. | Jun 2011 | B1 |
7975046 | Sheppard | Jul 2011 | B2 |
7979521 | Greaves et al. | Jul 2011 | B2 |
7979529 | Kreusch et al. | Jul 2011 | B2 |
7984138 | Bantz et al. | Jul 2011 | B2 |
7996493 | Hill | Aug 2011 | B2 |
8001246 | Lu et al. | Aug 2011 | B2 |
8010085 | Apte et al. | Aug 2011 | B2 |
8010602 | Shen et al. | Aug 2011 | B2 |
8010689 | Deninger et al. | Aug 2011 | B2 |
8014303 | Narin et al. | Sep 2011 | B2 |
8015277 | Brown et al. | Sep 2011 | B2 |
8032701 | Glade et al. | Oct 2011 | B1 |
8041022 | Andreasen et al. | Oct 2011 | B1 |
8051130 | Logan et al. | Nov 2011 | B2 |
8051168 | Boysko et al. | Nov 2011 | B1 |
8055709 | Singh et al. | Nov 2011 | B2 |
8059790 | Paterik et al. | Nov 2011 | B1 |
8065247 | Schlottmann | Nov 2011 | B2 |
8077704 | Yin et al. | Dec 2011 | B2 |
8078679 | Kajekar et al. | Dec 2011 | B2 |
8090852 | Ianchici et al. | Jan 2012 | B2 |
8099500 | Deason | Jan 2012 | B2 |
8117314 | Croft et al. | Feb 2012 | B2 |
8127005 | Fernández Gutierrez | Feb 2012 | B2 |
8135134 | Orsini et al. | Mar 2012 | B2 |
8135833 | Cancel et al. | Mar 2012 | B2 |
8140319 | Wasser | Mar 2012 | B2 |
8145753 | Inoue et al. | Mar 2012 | B2 |
8156155 | Yu et al. | Apr 2012 | B1 |
8200809 | Sheppard | Jun 2012 | B2 |
8204884 | Freedman et al. | Jun 2012 | B2 |
8230056 | Bishop et al. | Jul 2012 | B2 |
8234368 | Nielsen et al. | Jul 2012 | B1 |
8244859 | Ramakrishnan et al. | Aug 2012 | B2 |
8281027 | Martinez et al. | Oct 2012 | B2 |
8281175 | Blackburn et al. | Oct 2012 | B2 |
8281360 | Flewallen et al. | Oct 2012 | B2 |
8316134 | Tanimoto | Nov 2012 | B2 |
8321515 | Gailloux et al. | Nov 2012 | B1 |
8327012 | Nguyen et al. | Dec 2012 | B1 |
8332477 | Kaiserlian et al. | Dec 2012 | B1 |
8332507 | Wagh et al. | Dec 2012 | B2 |
8352590 | Sankaran et al. | Jan 2013 | B2 |
8375118 | Hao et al. | Feb 2013 | B2 |
8380234 | Kronander et al. | Feb 2013 | B2 |
8380863 | Natarajan et al. | Feb 2013 | B2 |
8396075 | Skoczkowski et al. | Mar 2013 | B2 |
8407038 | Bizzarri et al. | Mar 2013 | B2 |
8407340 | Zamora Cura | Mar 2013 | B2 |
8416695 | Liu et al. | Apr 2013 | B2 |
8438089 | Wasserblat et al. | May 2013 | B1 |
8443041 | Krantz et al. | May 2013 | B1 |
8462160 | Lindsay et al. | Jun 2013 | B2 |
8468241 | Raizen et al. | Jun 2013 | B1 |
8468244 | Redlich et al. | Jun 2013 | B2 |
8478879 | Brown et al. | Jul 2013 | B2 |
8479212 | Jamjoom et al. | Jul 2013 | B2 |
8527577 | Lu et al. | Sep 2013 | B2 |
8542592 | Moisand et al. | Sep 2013 | B2 |
8542676 | Lakhani et al. | Sep 2013 | B2 |
8544023 | Sim-Tang et al. | Sep 2013 | B2 |
8572252 | Ahuja et al. | Oct 2013 | B2 |
8589516 | Wheeler et al. | Nov 2013 | B2 |
8595490 | Von Mueller et al. | Nov 2013 | B2 |
8599747 | Saleem et al. | Dec 2013 | B1 |
8620353 | Kahn et al. | Dec 2013 | B1 |
8621090 | Bustamente | Dec 2013 | B2 |
8626860 | Gailloux et al. | Jan 2014 | B1 |
8626901 | Pugh et al. | Jan 2014 | B2 |
8627479 | Wittenstein et al. | Jan 2014 | B2 |
8630836 | Wasser | Jan 2014 | B2 |
8630854 | Marvit | Jan 2014 | B2 |
8634423 | Olding et al. | Jan 2014 | B1 |
8645453 | Cheng et al. | Feb 2014 | B2 |
8655939 | Redlich et al. | Feb 2014 | B2 |
8661125 | Avner et al. | Feb 2014 | B2 |
8698872 | Begeja et al. | Apr 2014 | B2 |
8712019 | Anchan et al. | Apr 2014 | B2 |
8713453 | Shahine et al. | Apr 2014 | B2 |
8719896 | Poulsen et al. | May 2014 | B2 |
8725869 | Reiner et al. | May 2014 | B1 |
8756312 | Malloy et al. | Jun 2014 | B2 |
8769059 | Chheda et al. | Jul 2014 | B1 |
8782283 | Attanasio | Jul 2014 | B2 |
8793395 | Cadiou et al. | Jul 2014 | B2 |
8810577 | De Pauw et al. | Aug 2014 | B2 |
8812740 | Li et al. | Aug 2014 | B2 |
8813090 | Jamjoom et al. | Aug 2014 | B2 |
20010052081 | McKibben et al. | Dec 2001 | A1 |
20020026505 | Terry | Feb 2002 | A1 |
20020042821 | Muret et al. | Apr 2002 | A1 |
20020078382 | Sheikh et al. | Jun 2002 | A1 |
20020099818 | Russell et al. | Jul 2002 | A1 |
20020174235 | Likourezos | Nov 2002 | A1 |
20030023715 | Reiner et al. | Jan 2003 | A1 |
20030043820 | Goringe et al. | Mar 2003 | A1 |
20030059017 | Cugalj et al. | Mar 2003 | A1 |
20030065605 | Gatto | Apr 2003 | A1 |
20030074369 | Schuetze et al. | Apr 2003 | A1 |
20030120822 | Langrind et al. | Jun 2003 | A1 |
20030140131 | Chandrashekhar et al. | Jul 2003 | A1 |
20030214504 | Hao et al. | Nov 2003 | A1 |
20040022191 | Bernet et al. | Feb 2004 | A1 |
20040049693 | Douglas | Mar 2004 | A1 |
20040105424 | Skoczkowski et al. | Jun 2004 | A1 |
20040181599 | Kreusch et al. | Sep 2004 | A1 |
20040199623 | Houri | Oct 2004 | A1 |
20040202295 | Shen et al. | Oct 2004 | A1 |
20040215770 | Maher, III et al. | Oct 2004 | A1 |
20040243704 | Botelho et al. | Dec 2004 | A1 |
20040249938 | Bunch | Dec 2004 | A1 |
20040255126 | Reith | Dec 2004 | A1 |
20040267729 | Swaminathan et al. | Dec 2004 | A1 |
20050013259 | Papoushado et al. | Jan 2005 | A1 |
20050060102 | O'Reilly et al. | Mar 2005 | A1 |
20050076117 | Hou et al. | Apr 2005 | A1 |
20050174937 | Scoggins et al. | Aug 2005 | A1 |
20050210409 | Jou | Sep 2005 | A1 |
20050246419 | Jaatinen | Nov 2005 | A1 |
20060015613 | Greaves | Jan 2006 | A1 |
20060026268 | Sanda | Feb 2006 | A1 |
20060041660 | Bishop et al. | Feb 2006 | A1 |
20060064391 | Petrov et al. | Mar 2006 | A1 |
20060168332 | Pfitzmann | Jul 2006 | A1 |
20060230037 | Sugiyama et al. | Oct 2006 | A1 |
20070005713 | LeVasseur et al. | Jan 2007 | A1 |
20070055766 | Petropoulakis et al. | Mar 2007 | A1 |
20070118640 | Subramanian et al. | May 2007 | A1 |
20070156889 | Bhrara et al. | Jul 2007 | A1 |
20070203991 | Fisher et al. | Aug 2007 | A1 |
20070266145 | Nesbitt et al. | Nov 2007 | A1 |
20070299964 | Wong et al. | Dec 2007 | A1 |
20080028031 | Bailey et al. | Jan 2008 | A1 |
20080036767 | Janzen | Feb 2008 | A1 |
20080052392 | Webster et al. | Feb 2008 | A1 |
20080147623 | Swaminathan et al. | Jun 2008 | A1 |
20080162397 | Zaltzman | Jul 2008 | A1 |
20080183867 | Singh et al. | Jul 2008 | A1 |
20090077623 | Baum et al. | Mar 2009 | A1 |
20090132450 | Schlottmann | May 2009 | A1 |
20090150472 | Devarakonda et al. | Jun 2009 | A1 |
20090164629 | Klein et al. | Jun 2009 | A1 |
20090165142 | Adelstein et al. | Jun 2009 | A1 |
20090171960 | Katzir | Jul 2009 | A1 |
20090193037 | Yu et al. | Jul 2009 | A1 |
20090254572 | Redlich et al. | Oct 2009 | A1 |
20090254653 | Kowa et al. | Oct 2009 | A1 |
20100042545 | Ogg et al. | Feb 2010 | A1 |
20100057858 | Shen et al. | Mar 2010 | A1 |
20100071053 | Ansari et al. | Mar 2010 | A1 |
20100079464 | Matsumura | Apr 2010 | A1 |
20100086119 | De Luca et al. | Apr 2010 | A1 |
20100094910 | Bayliss | Apr 2010 | A1 |
20100095017 | Ghetie et al. | Apr 2010 | A1 |
20100115018 | Yoon et al. | May 2010 | A1 |
20100150138 | Bjorsell et al. | Jun 2010 | A1 |
20100169234 | Metzger et al. | Jul 2010 | A1 |
20100169479 | Jeong et al. | Jul 2010 | A1 |
20100180029 | Fourman | Jul 2010 | A1 |
20100182320 | Cartan | Jul 2010 | A1 |
20100199189 | Ben-Aroya et al. | Aug 2010 | A1 |
20100211672 | Brown et al. | Aug 2010 | A1 |
20100217837 | Ansari et al. | Aug 2010 | A1 |
20100228854 | Morrison et al. | Sep 2010 | A1 |
20100250497 | Redlich et al. | Sep 2010 | A1 |
20100281161 | Cohn et al. | Nov 2010 | A1 |
20100287286 | Bustamente | Nov 2010 | A1 |
20100309786 | Moisand et al. | Dec 2010 | A1 |
20100312884 | Nandy et al. | Dec 2010 | A1 |
20100312903 | Miyata | Dec 2010 | A1 |
20100318647 | Savoor et al. | Dec 2010 | A1 |
20100321183 | Donovan et al. | Dec 2010 | A1 |
20100333116 | Prahlad et al. | Dec 2010 | A1 |
20110010449 | Andrews et al. | Jan 2011 | A1 |
20110029667 | Imbimbo et al. | Feb 2011 | A1 |
20110030067 | Wilson | Feb 2011 | A1 |
20110047273 | Young, Jr. et al. | Feb 2011 | A1 |
20110161507 | O'Sullivan et al. | Jun 2011 | A1 |
20110173330 | Gong et al. | Jul 2011 | A1 |
20110182205 | Gerdes et al. | Jul 2011 | A1 |
20110206198 | Freedman et al. | Aug 2011 | A1 |
20110208859 | Fernández Gutierrez | Aug 2011 | A1 |
20110214187 | Wittenstein et al. | Sep 2011 | A1 |
20110252032 | Fitzgerald et al. | Oct 2011 | A1 |
20110252138 | Ahuja et al. | Oct 2011 | A1 |
20110270977 | Ansiaux et al. | Nov 2011 | A1 |
20110282981 | Cutler et al. | Nov 2011 | A1 |
20110283343 | Jaeger et al. | Nov 2011 | A1 |
20110289134 | De Los Reyes et al. | Nov 2011 | A1 |
20110296014 | Cancel et al. | Dec 2011 | A1 |
20120005331 | Beattie, Jr. et al. | Jan 2012 | A1 |
20120016715 | Brown et al. | Jan 2012 | A1 |
20120030729 | Schwartz et al. | Feb 2012 | A1 |
20120078708 | Taylor et al. | Mar 2012 | A1 |
20120084081 | Melamed et al. | Apr 2012 | A1 |
20120084288 | Abdul-Razzak et al. | Apr 2012 | A1 |
20120096145 | Le et al. | Apr 2012 | A1 |
20120110062 | Savage et al. | May 2012 | A1 |
20120117236 | Fukuda et al. | May 2012 | A1 |
20120131474 | Panchadsaram et al. | May 2012 | A1 |
20120143972 | Malik et al. | Jun 2012 | A1 |
20120143973 | Niewerth | Jun 2012 | A1 |
20120150955 | Tseng | Jun 2012 | A1 |
20120158955 | Kim et al. | Jun 2012 | A1 |
20120191854 | Bharatia et al. | Jul 2012 | A1 |
20120197976 | Welingkar et al. | Aug 2012 | A1 |
20120203847 | Kendall et al. | Aug 2012 | A1 |
20120210120 | Irvine | Aug 2012 | A1 |
20120210427 | Bronner et al. | Aug 2012 | A1 |
20120224021 | Begeja et al. | Sep 2012 | A1 |
20120239805 | Savoor et al. | Sep 2012 | A1 |
20120239809 | Mazumdar et al. | Sep 2012 | A1 |
20120254403 | Imbimbo et al. | Oct 2012 | A1 |
20120259975 | Le et al. | Oct 2012 | A1 |
20120265824 | Lawbaugh | Oct 2012 | A1 |
20120266081 | Kao | Oct 2012 | A1 |
20120317196 | Schigel et al. | Dec 2012 | A1 |
20120324470 | Jamjoom et al. | Dec 2012 | A1 |
20120331126 | Abdul-Razzak et al. | Dec 2012 | A1 |
20130007129 | German et al. | Jan 2013 | A1 |
20130024506 | Setton | Jan 2013 | A1 |
20130054749 | Yao et al. | Feb 2013 | A1 |
20130061049 | Irvine | Mar 2013 | A1 |
20130091241 | Goetz et al. | Apr 2013 | A1 |
20130097308 | Le et al. | Apr 2013 | A1 |
20130145289 | Abdul-Razzak et al. | Jun 2013 | A1 |
20130155068 | Bier et al. | Jun 2013 | A1 |
20130159234 | Xing et al. | Jun 2013 | A1 |
20130162648 | Abdul-Razzak et al. | Jun 2013 | A1 |
20130191493 | Le et al. | Jul 2013 | A1 |
20130207980 | Ankisettipalli et al. | Aug 2013 | A1 |
20130262622 | Li et al. | Oct 2013 | A1 |
20130268443 | Petrov et al. | Oct 2013 | A1 |
20130275306 | Ignatchenko et al. | Oct 2013 | A1 |
20130293551 | Erez et al. | Nov 2013 | A1 |
20130304761 | Redlich et al. | Nov 2013 | A1 |
20130311557 | Aston Motes et al. | Nov 2013 | A1 |
20140032170 | Pauw et al. | Jan 2014 | A1 |
20140059024 | Le et al. | Feb 2014 | A1 |
20140082087 | Bustamente | Mar 2014 | A1 |
20140086102 | Doddapaneni | Mar 2014 | A1 |
20140149487 | Dikmen et al. | May 2014 | A1 |
20140150077 | Roy et al. | May 2014 | A1 |
20140201057 | Shuster | Jul 2014 | A1 |
20140222522 | Chait | Aug 2014 | A1 |
20140244506 | Gramling | Aug 2014 | A1 |
20140310243 | McGee | Oct 2014 | A1 |
20150205929 | Brama | Jul 2015 | A1 |
20150220918 | Davis | Aug 2015 | A1 |
20150220928 | Allen | Aug 2015 | A1 |
20150227890 | Bednarek | Aug 2015 | A1 |
20150228004 | Bednarek | Aug 2015 | A1 |
20150269539 | MacGregor | Sep 2015 | A1 |
20150287026 | Yang | Oct 2015 | A1 |
20150294308 | Pauker | Oct 2015 | A1 |
20150302401 | Metral | Oct 2015 | A1 |
Entry |
---|
An Analysis of Anonymity in the Bitcoin System, by Fergal Reid and Martin Harrigan, May 7, 2012, (pp. 30) http://arxiv.org/pdf/1107.4524.pdf?origin=publication—detail. |
“Visualizing criminal relationships: comparison of a hyperbolic tree and a hierarchical list”, by Yang Xiang et al., Jul. 14, 2005 (pp. 15) http://ai.arizona.edu/intranet/papers/VisualizingCriminalRelationships.pdf. |
“Securing Public Instant Messaging (IM) At Work”, by Nigel Williams, Joanne Ly, Jul. 2004 (pp. 43) http://caia.swin.edu.au/reports/040726A/CAIA-TR-040726A.pdf. |
“Network Element Service Specification Template”, by S. Shenker et al., Sep. 1997 (pp. 22) http://tools.ietf.org/pdf/rfc2216.pdf. |
“RSVP+: An Extension to RSVP”, by Silvano Gai et al., Jun. 1999 (pp. 18) http://tools.ietf.org/pdf/draft-sgai-rsvp-plus-00.pdf. |
“Cellular access control and charging for mobile operator wireless local area networks”, by H. Haverinen et al., Jan. 14, 2003 (p. 1) http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=1160081. |
“An Analysis of Anonymity in the Bitcoin System”, by Reid Fergal et al., May 7, 2012 (pp. 30) http://arxiv.org/pdf/1107.4524.pdf?origin=publication—detail. |
Number | Date | Country | |
---|---|---|---|
20150310424 A1 | Oct 2015 | US |