Abstract: A method used by two strangers subject to comprehensive eavesdropping, and in need for establishing privacy and secrecy, or more generally, an entropic advantage. Unlike the prevailing one-way functions, like RSA, and ECC which are subject to a breach via advanced mathematical insight, the method herein is based on durable probability considerations which is vulnerable to faster computing, but not to new mathematical insight, and as such provide more security against powerful eavesdropping adversaries. The method includes an equivocation-based one-way function Y=f(X) where X and Y are any positive integers and where there are infinite values X1, X2, . . . Xi such that Y=f(Xi).

Abstract: Systems and methods are provided for constructing a digital money from concatenated or otherwise linked bit strings. Several applications of digital coins include (i) means to secure the use of money according to the prevailing understanding between payer and payee, (ii) a method by which a mint entity that mints and redeems digital money collaborates with traders to jointly earn interest, or jointly gamble in the stock market, or other markets, (iii) a method by which a mint entity that mints and redeems digital money collaborates with merchants, their customers, and credit-extending entities (CEE) to allow the CEE to extend credit to selected group of customers, so that these customers can shop with any participating merchant, and (iv) a method for utility consumption on a real-time basis by splitting digital coins at a rate that pays exactly for the utility measure being consumed.

Abstract: This application described methods and means to construct a viable trading ecosystem for digital currency, gradually rising to local, and global prominence as the modern way to represent money. The application regards various media options to express the digital bit sequence which reflects the monetary value and the identity of the digital coin, including hard copies, and electronic variety. It Describes the ways to fuse a digital coin with any well defined terms of payments, and how to manage such coins as they are forwarded for redemption. The application describes various security means to insure the integrity of the digital mint. It also describes how to construct a hierarchy of authentication nodes such that each node has sufficient information to authenticate a digital coin, but not sufficient information to defraud a higher-up node.

Abstract: Systems and methods are provided for utilizing a digital coin. A bit string is received. The number of bits in the bit string represents a coin value of the digital coin. The individual bit values of the bits of the bit string are used to determine an identity of the digital coin. The identity of the digital coin is validated by a node of an authentication hierarchy. The validation includes comparing bit values of at least a portion of the bits of the bit string to bit values of corresponding bits of known bit strings that represent known issued digital coins. The validation also includes checking that a matching known issued digital coin was not previously redeemed. A digital coin can also be split into multiple digital coins that are each a continuous sequence of bits of the bit string of the original digital coin.

Abstract: Systems and methods are provided for utilizing a digital coin. A bit string is received. The number of bits in the bit string represents a coin value of the digital coin. The individual bit values of the bits of the bit string are used to determine an identity of the digital coin. The identity of the digital coin is validated by a node of an authentication hierarchy. The validation includes comparing bit values of at least a portion of the bits of the bit string to bit values of corresponding bits of known bit strings that represent known issued digital coins. The validation also includes checking that a matching known issued digital coin was not previously redeemed. A digital coin can also be split into multiple digital coins that are each a continuous sequence of bits of the bit string of the original digital coin.

Abstract: Bit-currency Transactional Trust Tools (T3) is a set of tools and procedures based on expressing value through a bit string where the size of the string (bit count) reflects its value, and the identity of the bits is used to distinguish one such digital coin from the other, and for enabling an authentication hierarchy that alleviates the bottleneck of having a single source coin authentication for all transactions in coins issued (minted) by that mint; also enabling an instant split of a coin by simply splitting off a portion of the string of the coin, such that the bit count of the split-off string reflects its value. Each coin is comprised of that body string as described above, and a header that contains information regarding coin identifier, payment conditions, and suchlike. Such bit currency can be carried around everywhere bits are handled, and may be encrypted as necessary.

Abstract: MIXFIX is an mixing apparatus featuring fine tuned mixing applicable as efficient and inexpensive in-line process mixing that also doubles as a regulatory valve. The controlled mixing degree allows for creating an alphabet where the degree of mixing (entropy) indicates different letters so that a computer controlled MIXFIX will generate any desired message that can be painted on surfaces and be readily interpreted by computers fed by regular digital cameras. Such entropic alphabet is read more reliably than normal English letters and even more reliably than bar codes, creating an opportunity for efficient labeling of anything that can then be camera captured and computer recognized including traffic control, industrial control, retail aid (replacing RFID), and military applications (preventing friendly fire).

Abstract: BiPSA is a novel inferential methodology characterized by: (1) breaking down all issues of unknown and uncertainty to a cascade of binary questions, (2) identifying all available sources of knowledge, and polling each source individually with respect to each binary question in its turn. Each binary answer is associated with a measure of confidence, and is expressed in a range {N:?N}, where N is a natural number. These answers are integrated through a novel minimum-arbitrariness mathematical operation to an output of the same format, that can be treated as input to a subsequent integration thereby allowing for a construction of a network that is capable of re-configuration, responding to feedback, and hence improving the merit and the credibility of the integrated answer. Useful for various situations challenged by uncertainty and partial knowledge, e.g.: R&D, pattern-recognition, inferential image and data technology, human/machine decision-making, and management procedures.

Abstract: A game-formatted trade environment where unlimited number of sellers and unlimited number of buyers interact for the purpose of exchanging goods for money in a format that presents a limited (known) risk to both buyers and sellers, along with the opportunity for unlimited high-price for sellers, and the opportunity for buyers to buy auction-style unlimited expensive goods against their fixed admission fee, and where the trade is transacted with game-currency that is given to buyers against their game admission fee, and is losing its value at game's end, so that buyers walk-away with the goods they purchased against the game currency, and the sellers divide among them the aggregate admission fee minus the profits of the game operator, and his cost, such that each seller receives a cut proportional to the purchase price of his or her goods as transacted with the game currency.

Abstract: Daniel (alternatively written as DNL) is a cryptographic paradigm, featuring ease of matching: many plaintexts of choice to any give cipher (the deniability property). Consequently, the cipher itself cannot betray the specific plaintext that generated it, as it is “lost” in the large list of candidate plaintexts, all of which are decryption-generated from the ciphertext.

Abstract: The encryption method disclosed is based on charting a path on a graph, where the graph is the encryption key. The plaintext expresses that path through a sequence of graph vertices, and the ciphertext expresses the same through a sequence of edges between these vertices. There are numerous ways to construct the graph to match a choice of plaintexts with a single ciphertext.