Abstract: This invention allows merchants to mint store credit as a secure physical coin, resisting fraud and counterfeiting. It is based a technology that marks the physical coupons with a large number of features, the reading of which is a signature of the coupon, verifiable through blockchain technology.

Abstract: This invention amounts to tools and procedures designed to use randomness sources to establish a secure communication between two nodes in cyber space, and then building on these bilateral trust elements to spread trust throughout the network. Applications include online identity management, and secure payment platforms. This trust build-up from bilateral connections may serve as a blockchain alternative. The bilateral trust solution is not based on mathematical complexity, as the prevailing solutions, but rather on the perfect unpredictability of quantum grade randomness, and as such it is well positioned to withstand cryptanalytic attacks based on quantum computing capability now secretly developed by powerful adversaries.

Abstract: A super polyalphabetic cipher where both the alphabet size, and the key size are user controlled and secret, and where computation is kept simple—reading, comparing, and sorting bits, to minimize battery consumption for Internet of Things, and where the users can decide how much randomness to use to match their security needs, and face, when necessary, a quantum computer cryptanalytic assault.

Abstract: This invention is a system and a method to encode an arbitrary digital string, as a sequence of q-bits subsections thereto, and expressing the possible 2{circumflex over (?)}q strings with an alphabet A, comprised of 2{circumflex over (?)}t letters where t<q, using letter repetition. This encoding makes it possible to build any desired security level (up to perfect secrecy) through a single round of transposition. Vulnerability is credibly appraised through probability calculus; computational complexity is avoided, and the user assumes control over the measure of security associated with their transmission.

Abstract: Capturing randomness in the chemical structure of a lump of matter, which then can be easily and quickly measured to read that randomness and thereby recapture it as bit-wise randomness, applicable as (i) a source of randomness, and as (ii) a means to verify the claimed identity of a material article.

Abstract: This invention, called LiDo (Live Documents) describes writing textual documents by building them as a sequence of textual units of size ranging from a single word, to a phrase, a sentence, a paragraph and beyond, where each textual unit carries the displayed message of the textual unit as well as assorted attributes thereto, like time stamp, validity, author identity, links, and cryptographic factors. A single bit string carries all the information described above. This method of document writing constructs a file that reflects the textual document as it is stored and communicated, and it allows the user of this method to extract useful insight from the document, much beyond what is evident through the current state of the displayed words.

Abstract: Exploiting the wealth of information in the intricate structure of a network where vertices are interconnected through edges—to insure data integrity between communication partners, where the partners gauge the projected security through the size and complexity of the deployed shared network.

Abstract: A method for implementing Live Documentation (LiDo) systems to incorporate and authenticate metadata of electronic documents. An electronic document received at a first LiDo system is partitioned into textual units. Each textual unit has a payload with a printable message and metadata that is not visible to the consumer, wherein the metadata includes one or more attributes. A second LiDo system uses the one or more attributes of a textual unit to authenticate the writer of the textual unit and filter textual units to display only printable messages with a validity above a designated threshold.

Abstract: A transmitter encodes information with randomly flipped bits. A cipher key that includes for each letter of an alphabet a unique string of binary bits of length N and a total amount of bits M to be randomly flipped where M<N are stored using a secure memory. An information message that includes a series of one or more letters is received using a transmitter. The cipher key is read from the secure memory and at least one letter of the series is converted to a corresponding unique string of binary bits of length N. The total amount of bits M to flip are read from the secure memory, the M bits of the unique string are randomly selected, and the M bits are flipped to the opposite binary value. The string with M flipped bits is transmitted through a communications channel.

Abstract: This invention establishes a protocol designed to mask the communication pattern that prevails within a group or a community, such that an outside observer has no knowledge as to who talks to whom within the protocol protected group, not how often, nor how much, or whether any communication takes place. Thereby an external observer is denied the intelligence borne in the very pattern of group communication.

Abstract: This invention establishes a protocol designed to mask the communication pattern that prevails within a group or a community, such that an outside observer has no knowledge as to who talks to whom within the protocol protected group, not how often, nor how much, or whether any communication takes place. Thereby an external observer is denied the intelligence borne in the very pattern of group communication.

Abstract: Equivoe-T complements its erosive cryptographic intractability with durable cryptographic equivocation. The captured ciphertext C generated through plaintext P using key K, may also be generated via a ‘fake plaintext’ P??P using a different key, K??K, presenting the cryptanalyst with a conclusive doubt as to the identity of the true plaintext. Prospectively there will be numerous plausible non-overlapping plaintext candidates, all guarding the identity of the true plaintext.

Abstract: This invention establishes means and protocols to secure data, and practice online authentication, using large undisclosed amounts of randomness, replacing the algorithmic complexity paradigm. Computation is limited to basic primitives like transposition, and bit-flipping. Security is credibly appraised through combinatorics calculus, and this transfers the security responsibility to the user who determines how much randomness to use.

Abstract: Using Unary alphabet to express a cyber message, the identities of the message bits can be used to carry a companion message. The P (prime) message, and the C (companion) message can be related or unrelated. The C message may be used to authenticate, or to invalidate the P message and its writer. While the P message may be in the open, the C message may be limited to key-holding readers. The C message may be modified by successive readers while leaving the P message unchanged. A wide range of applications is available on account of the simple idea of writing the primary message via bit-count (ignoring bit identities), leaving the identity assignments to carry the companion message. Alice and Bob may exchange a large number of primary messages, where for most of them the companion message says: “ignore the primary message”.

Abstract: Capturing randomness in the chemical structure of a lump of matter, which then can be easily and quickly measured to read that randomness and thereby recapture it as bit-wise randomness, applicable as (i) a source of randomness, and as (ii) a means to verify the claimed identity of a material article.

Abstract: Using Unary alphabet to express a cyber message, the identities of the message bits can be used to carry a companion message. The P (prime) message, and the C (companion) message can be related or unrelated. The C message may be used to authenticate, or to invalidate the P message and its writer. While the P message may be in the open, the C message may be limited to key-holding readers. The C message may be modified by successive readers while leaving the P message unchanged. A wide range of applications is available on account of the simple idea of writing the primary message via bit-count (ignoring bit identities), leaving the identity assignments to carry the companion message. Alice and Bob may exchange a large number of primary messages, where for most of them the companion message says: “ignore the primary message”.

Abstract: Generally ciphers project a fixed measure of security, defined by the complexity of their algorithms. Alas, threat is variable, and should be met with matching security. It is useless to project insufficient security, and it is wasteful and burdensome to over-secure data. Advanced BitFlip comes with threat-adjustable flexibility, established via: (i) smart decoy strategy, (ii) parallel encryption, (iii) uniform letter frequency adjustment—tools which enable the BitFlip user to (a) adjust its ciphertexts to match the appraised threat, and (b) sustain security levels for aging keys. The use of these threat-adjusting tools may be automated to allow (1) AI engines to enhance the security service of the cipher, and (2) to enable remote hard-to-access IoT devices to keep aging keys useful, and preserve precious energy by matching security to the ad-hoc threat level. BitFlip may also be operated in a zero-leakage mode where no attributes of a conversation are disclosed, up to full steganographic levels.

Abstract: This invention establishes a physical corner stone to build upon it a towering cyber space—creating a baseline which is out of bounds for remote hackers, and is tamper resistant to hands on attackers—intended to survive even a catastrophic breach of the host network, and subsequently serve as a leverage to recover from the attack. Foundational security for critical infrastructure.

Abstract: A system that efficiently packs indefinitely large quantities of random data in sufficiently identical physical entities (“Random Rocks”, “Rocks”) so that all holders of a matching Rock will extract from it the same data, in response to the same data request, (“query”); the packed random data is inherently analog, not digital, in form; the Rock always responds with the same data to the same data request, which must be presented one request at a time.

Abstract: This invention establishes a physical corner stone to build upon it a towering cyber space—creating a baseline which is out of bounds for remote hackers, and is tamper resistant to hands on attackers—intended to survive even a catastrophic breach of the host network, and subsequently serve as a leverage to recover from the attack. Foundational security for critical infrastructure.