NTT Research, Inc.

A computing system may be provided. The computing system may include a ring cavity configured to circulate optical pulses with continuously distributed phases encoding a combination of states corresponding to a current step of a combinatorial optimization. The computing system may also include a plurality of delay lines configured to implement couplings between the optical pulses to compute a next step of the combinatorial optimization.

A coherent Ising machine may include a process cavity configured to maintain a system state in a low photon regime. The coherent Ising machine may further include a controller configured to estimate the system state based on a previous iteration, measure the system state, determine a quantum noise in the process cavity based on comparing the estimated system state and the measured system state, calculate a feedback based on the estimated system state and the quantum noise, and provide the feedback to the process cavity for a next iteration.

Embodiments disclosed herein are directed computing systems for solving Boolean satisfiability (SAT). In some embodiments, the computing systems may be all-optical computing systems. Operations within the computing systems may be based on an optical encoding of a Boolean SAT problem, particularly for performing matrix-vector or vector-vector multiplication in an optical domain. An optical random access memory may include a plurality to individually addressable optical cavities, each cavity storing a corresponding variable as resonating optical pulses. The optical domain computations may be performed by offset circuits that provide an offset to variables loaded from the optical random access memory, multiply and accumulate circuits that generate products of the offset variables, and feedback circuits that feed back the products to the optical random access memory.

The present disclosure relates to a computerized method and system for message encryption in a multi-user setting. The method involves receiving a message of arbitrary length for each user, storing the message in a computerized data store, and executing a setup to generate a master secret and public keys. A random variable is generated, and a function is defined based on this variable. A second secret is derived using a functional encryption scheme, resulting in a derived secret. The message is encrypted by generating a first random string, a second partially random string, and a ciphertext. The system also includes a method for decrypting the encrypted message, processing the derived secret and ciphertext to derive a string, and deriving a plaintext message from this string.

A method and system for verifying distributed computations across multiple untrusted computing nodes. A setup entity generates cryptographic reference strings including succinct non-interactive arguments (SNARGs) and batch arguments (seBARGs) for multiple proof hierarchy levels. Prover entities compute state transitions using nondeterministic inputs, generate proofs for individual computation steps, and merge proofs hierarchically to create compact proofs whose size grows logarithmically with computation length rather than linearly. A verifier entity validates the merged proofs at each level. In a zero-knowledge variant, the setup entity additionally generates encryption keys and zero-knowledge proof parameters. Prover entities encrypt all computation states and wrap proofs in zero-knowledge layers, hiding sensitive intermediate values and witnesses while maintaining verifiability.

The present disclosure provides a method for randomized multi-input functional encryption. A setup processor generates, for each input, a component for generating a proof, public-private key pairs, an obfuscated program for verifying ciphertexts and outputting a proof, and an encryption key. The setup processor generates a master secret key and transmits encryption keys to an encryption processor and the master secret key to a key generation processor. The encryption processor computes ciphertexts, generates proofs, and produces final ciphertexts. The key generation processor receives the master secret key and a randomized function, samples a PRF key, generates an obfuscated program, and transmits a function key to a decryption processor. The decryption processor receives the function key and ciphertexts, calculates a decryption result, and electronically stores the result.

The present disclosure provides a method for secure attribute-based encryption with function hiding properties. The method comprises generating encryption parameters by sampling a hash function from a pairwise-independent hash family as a public parameter, generating trapdoor function pairs for each position and binary value, setting a public key as the set of trapdoor functions, generating a secret key comprising a binary string of specified length and trapdoor function inverses, and storing remaining trapdoor function inverses as a master secret key. The method further comprises receiving a message and attribute, encrypting the message under the attribute by sampling a random secret, generating shares using a share generating algorithm, computing ciphertext components for each position and binary value, computing a final ciphertext component using bitwise exclusive OR operation, assembling a complete ciphertext, and transmitting the complete ciphertext.

The present disclosure provides a method for secure message encryption and decryption using witness encryption. The method includes generating a master public key and a master secret key, generating common reference strings for a non-interactive zero-knowledge (NIZK) proof system and a commitment scheme, creating commitments using random values, and setting the master public and secret keys. A function key is generated by creating a dummy function tag and a NIZK proof. Message encryption involves generating a dummy input tag and creating a witness encryption ciphertext. The encrypted output includes attributes, the dummy input tag, and the witness encryption ciphertext. Decryption is performed using the function key and a witness decryption algorithm. The method enables secure message transmission with confidentiality and integrity throughout the encryption and decryption phases.

The disclosed technology pertains to a method and system for generating a common reference string for use by multiple parties in cryptographic operations. The method involves executing a generation algorithm that creates encryption and decryption codes, generates non-interactive zero-knowledge proofs, and outputs a message for each party. These messages are published to a public domain and accessed by all parties. A derivation algorithm is then executed at each party to derive a common reference string from the set of messages by combining them. The system comprises a computerized processor configured to execute these algorithms. The common reference string is stored in a computerized storage device.

Embodiments include a fully non-interactive publicly-verifiable delegation scheme for committed programs, specifically, a setting where Alice is a trusted author who delegates to an untrusted worker the task of hosting a program P, represented as a Boolean circuit. Alice also commits to a succinct value based on P. Disclosed methods allow an arbitrary user/verifier without knowledge of P to be convinced that they are receiving from the worker an actual computation of Alice's program on a given input x.