Abstract: 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.

Abstract: A new series of secure logging schemes that are referred to as Optimal Signatures for secure Logging (OSLO) are created. OSLO schemes are the first AS-based secure logging schemes that achieve small-constant tag and public key sizes with near-optimal signing and batch verification via various granularities. These features make them ideal for IoT-STaaS applications, wherein efficient signing and batch verification are critical for the resource-limited IoTs and cold storage servers, respectively.

Abstract: 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.

Abstract: An oblivious encrypted search and update method includes transmitting encrypted search queries and encrypted file update requests from a trusted client to at least two different untrusted servers, receiving encrypted search entries and encrypted file entries from the untrusted servers, and decrypting the encrypted search entries and encrypted file entries with the trusted client. The trusted client re-encrypts the decrypted entries and transmits re-encrypted entries that were received from a first untrusted server to a second untrusted server and vice versa to provide obliviousness for encrypted keyword searches and encrypted file updates from the trusted client.

Abstract: An apparatus is provided which comprises: logic to privately compare one or more received Order Preserving Encrypted (OPE) signal strength (RSS) values, from a plurality of secondary users (SUs), with a OPE threshold value; a transmitter to send the comparison result to a fusion center (FC); and a receiver to receive the OPE threshold value from the FC.

Abstract: An oblivious encrypted search and update method includes transmitting encrypted search queries and encrypted file update requests from a trusted client to at least two different untrusted servers, receiving encrypted search entries and encrypted file entries from the untrusted servers, and decrypting the encrypted search entries and encrypted file entries with the trusted client. The trusted client re-encrypts the decrypted entries and transmits re-encrypted entries that were received from a first untrusted server to a second untrusted server and vice versa to provide obliviousness for encrypted keyword searches and encrypted file updates from the trusted client.

Abstract: An apparatus is provided which comprises: logic to privately compare one or more received Order Preserving Encrypted (OPE) signal strength (RSS) values, from a plurality of secondary users (SUs), with a OPE threshold value; a transmitter to send the comparison result to a fusion center (FC); and a receiver to receive the OPE threshold value from the FC.

Abstract: In a counter mode encryption scheme, a sending device sends a first message including first cipher text and a first counter used to generate the first cipher text to a receiving device for decryption. The sending device subsequently generates a second counter for generating second cipher text. The sending device sends a second message including the second cipher text and intermediate state data corresponding to a change between the first counter second counter to the receiving device for decryption. The intermediate state data are represented by a smaller number of bits than the first counter. The method enables improved counter mode encrypted communication in networks that lose one or more intermediate messages between the first message and the second message.

Abstract: In a counter mode encryption scheme, a sending device sends a first message including first cipher text and a first counter used to generate the first cipher text to a receiving device for decryption. The sending device subsequently generates a second counter for generating second cipher text. The sending device sends a second message including the second cipher text and intermediate state data corresponding to a change between the first counter second counter to the receiving device for decryption. The intermediate state data are represented by a smaller number of bits than the first counter. The method enables improved counter mode encrypted communication in networks that lose one or more intermediate messages between the first message and the second message.