University of South Florida

Attila Altay Yavuz

Rouzbeh Behnia

Muslum Ozgur Ozmen

Minh Thang Hoang

Efe Ulas Akay Seyitoglu

Thang Hoang

The disclosure provides systems and methods for an improved Proof of Work (PoW) technique that enforces the creation of cryptographic tokens while solving the PoW puzzle. The systems and methods disclosed herein more efficiently utilize the high computational and energy consumption in attempts to solve PoW puzzles, by combining the computations necessary for several types of cryptographic functions (e.g., public-key cryptographic methods). For example, systems and methods disclosed herein may reuse pre-computed commitments, while still preserving the traditional and accepted PoW protocols.

Systems and methods for energy efficient and useful blockchain proof of work

A method, system, or apparatus for generating and/or verifying a signature on a message is provided. The method, system, or apparatus at a signer may include receiving a message, generating a security parameter, generating at least two seeds corresponding to at least two servers based on the security parameter, transmitting the at least two seeds to each server of the at least two servers, determine a private key based on the security parameter or the at least two seeds, and generating, on the message, a signature based on the private key. The method, system, or apparatus at a verifier may include receiving, from a signer, a signature on a message, obtaining at least two partial public keys, determining a full public key based on the at least two partial public keys, and authenticating the signature on the message based on the full public key. Other aspects, embodiments, and features are also claimed and described.

Lightweight post-quantum authentication

A method for publicly verifiable symmetric cryptography is disclosed. The method includes: obtaining an initial encrypted key and a homomorphic public key; obtaining a first message and an initial signature; calculating an initial hashed value of the first message; setting a cryptographic function of the initial hashed value of the first message and an initial private key; generating an evaluated value based on the cryptographic function, the homomorphic public key, the initial encrypted key, and the initial hashed value of the first message; and transmitting, at the verifier, a verification result based on a hashed value of the initial signature and the evaluated value. Other aspects, embodiments, and features are also claimed and described.

Publicly verifiable and resilient symmetric authentication and privacy systems and related methods

An algebraic proof-of-work algorithm is provided that can be used as part of the consensus algorithm used by cryptocurrencies such as Bitcoin. Instead of solving blocks using a hash puzzle, the present algorithm uses an algebraic puzzle such as a lattice-based puzzle based on the shortest vector problem and/or the knapsack problem. A cryptocurrency using the proposed proof-of-work algorithm has only a small quantum advantage when compared with existing proof-of-work algorithms.

Algebraic proof-of-work algorithm for blockchains

A new compromise-resilient and compact cryptographic tool is provided that ensures a breach-resilient authentication and integrity of system measurements in computer systems. The described methods are forward-secure digital signatures with signature and partial public key aggregation capabilities. The methods reduce the total space overhead of signature and public key storage. The methods offer a high space efficiency for systems who has relatively low state transitions, wherein the same message is continuously signed and then followed by different messages.

Systems and methods for compromise resilient and compact authentication for digital forensics

A method of searching encrypted files includes a client computing device selecting a specific keyword to search a plurality of encrypted files stored at a server computing device and if the specific keyword has not been previously used to search the plurality of encrypted files, the method further includes using an encrypted keyword index stored at the server computing device to identify one or more encrypted files of the plurality of encrypted files that contain the specific keyword based upon keyword-file relationships stored in the encrypted keyword index. The method also includes, storing the keyword-file relationship for each of the one or more encrypted files that are identified as containing the specific keyword in an encrypted dictionary at the server and during a subsequent search, if the specific keyword has previously been used to search the plurality of encrypted files, the method includes using the encrypted dictionary and the encrypted keyword index stored at the server to identify one or more encrypted files of the plurality of encrypted files that contain the specific keyword based upon the keyword-file relationships for the specific keyword previously stored in the encrypted dictionary.

Forward-private dynamic searchable symmetric encryption (DSSE) with efficient search

Disclosed are various embodiments for certificate-free cryptosystems that achieve significant computational and communication efficiency as compared to prior systems. A private key generator (PKG) generates a master public key and a master private key unique to the PKG; receives identifying information for at least one client device; generates a public key for the at least one client device; generates a private key for the at least one client device by: performing a hash of the identifying information using the public key generated for the at least one client device to generate a plurality of indices; identifying values corresponding to the indices from the master private key; and deriving the private key based at least in part on a summation of the values corresponding to the indices; and sends the public key and the private key to the at least one client device.

Efficient identity-based and certificateless cryptosystems

Cryptographic techniques referred to as Sender Optimal, Breach-resilient Auditing with Post-Quantum security (SOBAP) are described. Optimal efficiency and post-quantum security of symmetric key based techniques are achieved, while providing compromise-resiliency, conditional non-repudiation, and fault-tolerance verification in a distributed setting. SOBAP relies on any choice of a symmetric key based primitive with extended features (e.g., forward-security, append-only authentication), which can be optimally efficient. The verification is done via the execution of symmetric primitive F with a secure multi-party computation (SMPC) technique, wherein an honest majority guarantees a conditional non-repudiation and fault-tolerance. SOBAP offers an architecture that uses authenticated access control data structures to ensure policy enforcement. SOBAP also offers a post-quantum security via symmetric primitives and SMPC. Extensions of SOBAP offer oblivious access and enhancements with secure hardware support.

Sender optimal, breach-resilient, and post-quantum secure cryptographic methods and systems for digital auditing

A computer data security system, useful in protecting audit logs, includes symmetric key based techniques, requires only a small-constant number of cryptographic hash operations at the signer side sending a prospective audit log or other computer record data to a primary repository to achieve forward-secure and append-only authentication. The verification is performed by independent parties sharing parts of the symmetric key, wherein the presence of single honest party among all verifier parties ensures a conditional non-repudiation. It also ensures that an active adversary cannot generate authentication tags on behalf of the signer, unless it compromises all verification parties.

System and method of audit log protection

A digital signature protocol achieves the least energy consumption, the fastest signature generation, and the smallest signature among its ECC-based counterparts. The method of authenticating is also immune to side channel attacks aiming elliptical curve operations/exponentiations as well as to weak pseudo random number generators at the signer's side. A security system for authenticating the updating of computer records includes a network of member computers in data communication with each other and calculating an assigned portion of a commitment code used for the authenticating the secure data at the verifier device by completing, among the server computers, a plurality of discrete verification tasks for a single authentication code (R) associated with an aggregated commitment code (R), aggregating at the verifier device, the aggregated commitment code (R), and verifying the secure data at the verifier device.

Growing community of inventors

Tampa, FL, United States of America

Attila Altay Yavuz