Abstract: Methods, systems, and computer readable media for providing Decentralized Finance (DeFi) are disclosed. According to one method, a method for providing digital property swap occurs at a computing platform executing a DeFi protocol, wherein the computing platform is acting as a digital property exchange center. The DeFi protocol method comprising: receiving one kind of digital property from a user; calculating an equivalent amount of another digital property; sending the said equivalent amount of the said other digital property to the said user. According to one system, a system for providing Decentralized Finance (DeFi) includes at least one computing platform, wherein the computing platform is executing a DeFi protocol and is acting as a swapping platform of the DeFi protocol. The DeFi platform is configured for: receiving digital properties as liquidity from liquidity providers; receiving one kind of digital properties from a user; and sending another kind of digital properties to the said user.

Abstract: Methods, systems, and computer readable media for providing Byzantine fault tolerance (BFT) are disclosed. According to one method, a method for providing BFT occurs at a computing platform executing a BFT protocol, wherein the computing platform is acting as a leader participant of a round of the BFT protocol. The method comprising: receiving signed round-change messages from multiple participants in the round; broadcasting a signed lock message indicating that signed round-change messages have been received from a predetermined number of the participants in the round voting for a same candidate block; receiving signed commit messages from multiple participants in the round; and broadcasting a signed decide message indicating the candidate block is a finalized block after the predetermined number of the participants in the round have sent signed commit messages indicating the candidate block.

Abstract: Certain embodiments relate to noise-free fully homomorphic symmetric key encryption (FHE) schemes without bootstrapping based on octonion algebra over finite fields and finite rings, this disclosure introduces. The FHE schemes may be secure in the ciphertext-only security model. Certain embodiments also relate to a method for a client to carry out privacy preserving computation in a server where the client upload her encrypted data and encrypted program to the server. The server may run the encrypted program on the encrypted data and return encrypted output to the client. The client may decrypt the encrypted output to get the actual output.

Abstract: This invention discloses a method and system for generating a private key and a corresponding public key. These keys can be used for encrypting a message into a cipher-text for transmission through an insecure communication channel, and for decrypting said ciphertext into a clear plaintext. The goal of the present invention is to provide encryption and decryption methods of the McEliece type which are capable of improving the security level of a post-quantum cryptosystem. In one embodiment, this object is achieved by three methods: a method for creating a public key from a private linear code generator matrix, a method for encrypting a message into a ciphertext and a method for decrypting the cipher-text into a plaintext. The key generation and encryption methods of the present invention comprises the following steps: selecting an [n, k] linear code generator matrix Gs=[g0 , . . . , gn] over GF(q) as the private key, where k, w, n and q are positive integers and where g0 , . . .

Abstract: This invention discloses a method and system for generating a private key and a corresponding public key. These keys can be used for encrypting a message into a ciphertext for transmission through an insecure communication channel, and for decrypting said ciphertext into a clear plaintext. The goal of the present invention is to provide encryption and decryption methods of the McEliece type which are capable of improving the security level of a post-quantum cryptosystem. In one embodiment, this object is achieved by three methods: a method for creating a public key from a private linear code generator matrix, a method for encrypting a message into a ciphertext and a method for decrypting the ciphertext into a plaintext. The key generation and encryption methods of the present invention comprises the following steps: selecting an [n, k] linear code generator matrix Gs=[g0, . . . , gn] over GF(q) as the private key, where k, r, n and q are positive integers and where g0, . . .

Abstract: Random numbers have been one of the most useful objects in statistics, computer science, cryptography, modeling, simulation, and other applications though it is very difficult to construct true randomness. In 2010, National Institute of Science and Technologies (NIST) publishes the SP800-22 Revision 1A test suite. However, this suite has inherent limitations with straightforward Type II errors. This invention concerns statistical distance based testing techniques for evaluating the quality of pseudorandom and random sources that are used in many applications such as cryptographic systems. This invention also concerns statistical testing techniques based on the common statistical laws such as the law of the iterated logarithms. The statistical distance based approach in this invention is more accurate in deviation detection and avoids afore mentioned type II errors in NIST SP800-22.