Ntt Research, Inc.

Princeton University

Mark Zhandry

Brent Waters

Jiaxin Guan

Venkata Koppula

Daniel Wichs

The disclosure relates to generating a ciphertext of arbitrary and flexibly large size and ensures that an adversary learns little about the encrypted data, even if the decryption key later leaks, unless substantially the entire ciphertext is stored. Given that communication will be inconveniently large for the adversary to store, the incompressible ciphertexts and signatures can be sent and received with low storage requirements for the honest users. In such a setting, the honest users would not store the entire ciphertext or signature, but instead generate, send, and process the communication bit-by-bit in a streaming fashion.

Cryptographic data message expansion for increasing adversarial storage requirements

Systems, methods, and computer-readable media for creating a quantum-secure hash of an m-bit input are disclosed. The disclosure relates to the first statistically hiding post-quantum commitments and post-quantum succinct arguments (of knowledge) under the same assumptions. Results are obtained by a general theorem which shows how to construct a collapsing hash H' from a post-quantum collision-resistant hash function H, regardless of whether or not H itself is collapsing, assuming H satisfies a certain regularity condition we call 'semi-regularity'.

Post-quantum collision resistant Hash function

Disclosed is an adaptively secure multiparty non-interactive key exchange (NIKE) from polynomially hard indistinguishability obfuscation and other standard assumptions. This improves on all prior such protocols, which required sub-exponential hardness. Several compilers are established which simplify the task of constructing new multiparty NIKE protocols, and also establish a close connection with a particular type of constrained PRF.

Adaptive multiparty non-interactive key exchange

A public key cryptosystem has enhanced security based on the use of an augmented random oracle model (AROM). The system includes corresponding encryption and decryption functionality.

Growing community of inventors

Princeton, NJ, United States of America

Mark Zhandry