Multi-Factor User Authentication
US-2024394695-A1 · Nov 28, 2024 · US
US2015310426A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2015310426-A1 |
| Application number | US-201514737924-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jun 12, 2015 |
| Priority date | Apr 5, 2002 |
| Publication date | Oct 29, 2015 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Systems and methods are provided for utilizing a digital coin in conjunction with Internet transported media so that digital money may real-time, counter-parallel flow relative to the media flow, to enable the recipient to pay the source for its media goods, and also digital money may parallel-flow with the media to pay off hubs and nodes on its way, in order to prioritize its throughput.
Opening claim text (preview).
What is claimed is: 1 . A method for providing payment at a node of peer-to-peer communications network for using a digital coin that can be split into two or more digital coins, comprising: receiving a first digital coin attached to a digitized message or good using a computer of a node of a peer-to-peer communications network, wherein the first digital coin comprises a first binary bit string that includes one or more bits, wherein a number of bits in the first binary bit string is used to represent a coin value of the first digital coin, and wherein bit values of bits of the first binary bit string are used to determine an identity of the first digital coin; splitting the first digital coin into at least a second digital coin and a third digital coin using the computer of the node, wherein the first digital coin is split by dividing the first binary bit string into a second binary bit string and a third binary bit string without disturbing the bit order of the first binary bit string; attaching the second digital coin to the digitized message or good using the computer of the node; and storing the third digital coin on the node as payment using the computer of the node. 2 . The method of claim 1 , wherein the node comprises a servicing node and the third digital coin represents payment for service resources of the servicing node. 3 . The method of claim 1 , wherein the digitized message or good comprises a digitized good, the node comprises an originating node, and the third digital coin represents payment for a seller of the digitized good. 4 . A method as in claim 1 wherein media can be pushed through the Internet at a prime speed by attaching to the pushed media a size-measured digital coin such that any encountered hub or node will be able to get paid by slicing a size-measured cut of that digital coin and in return prioritize the passing media through.
using e-cash · CPC title
insuring higher security of transaction · CPC title
based on the use of peer-to-peer networks · CPC title
Business processing using cryptography · CPC title
characterised by micropayments · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.