Systems and methods for practical near-term position verification from certified randomness

Patent metadata

Field	Value
Publication number	US-2026095313-A1
Application number	US-202418903860-A
Country	US
Kind code	A1
Filing date	Oct 1, 2024
Priority date	Oct 1, 2024
Publication date	Apr 2, 2026
Grant date	—

Abstract

A first verifier and second verifier may share a secret string, a first and second random input; may generate a challenge according to a certified randomness protocol and may encrypt the challenge using a keyed cryptographic hash function. The first verifier may send the encrypted challenge, the first random input, and the random hash key to a prover. The second verifier may send second random input to the prover. The prover may decrypt the encrypted challenge and may execute a random quantum computation based on the certified randomness protocol and the challenge and may send a result of the random quantum computation to both the first verifier and the second verifier. The first and second verifiers may determine the results were received within a time threshold, may compare the results to ensure that they match, and may determine the result passes the certified randomness protocol.

First claim

What is claimed is:

1 . A method, comprising:
sharing, by a first classical verifier and a second classical verifier, a long secret string comprising a secret string, a first random input, a second random input, and a random hash key that identifies one of a plurality of keyed cryptographic hash functions; generating, by the first classical verifier and the second classical verifier, a challenge according to a certified randomness protocol using the secret string; sampling, by the first classical verifier and the second classical verifier, a keyed cryptographic hash function from the plurality of keyed cryptographic hash functions using the random hash key; encrypting, by each of the first classical verifier and the second classical verifier, the challenge using an output of the keyed cryptographic hash function on a combination of the first random input and the second random input; sending, by the first classical verifier, the encrypted challenge, the first random input, and the random hash key to a quantum prover; sending, by the second classical verifier, the second random input to the quantum prover; receiving, by the quantum prover, the encrypted challenge, the first random input and the second random input; decrypting, by the quantum prover, the encrypted challenge using the random hash key, the first random input, and the second random input; executing, by the quantum prover, a random quantum computation based on the certified randomness protocol and the challenge; sending, by the quantum prover, a result of the random quantum computation to both the first classical verifier and the second classical verifier; determining, by the first classical verifier and the second classical verifier, that the result of the random quantum computation was received within a time threshold; comparing, by the first classical verifier and the second classical verifier, the result received by the first classical verifier and the result received by the second classical verifier to ensure that they match; and determining, by the first classical verifier and the second classical verifier that the result passes the certified randomness protocol using the secret string.

2 . The method of claim 1 , wherein the challenge is generated using a randomness in the secret string, wherein the randomness comprises bits selected from the secret string.

3 . The method of claim 1 , wherein the challenge comprises a description of a quantum circuit.

4 . The method of claim 1 , wherein the keyed cryptographic hash function comprises a salted hash function or a hash-based message authentication code (HMAC).

5 . The method of claim 1 , wherein the time threshold is based on a physical distance between at least one of the first classical verifier and the second classical verifier, and the quantum prover.

6 . The method of claim 1 , wherein the certified randomness protocol comprises a process for generating the challenge, a process for proving certified randomness using the challenge to generate the result, and a process for verifying that the result passes the certified randomness protocol.

7 . The method of claim 1 , further comprising:
generating, by the first classical verifier and the second classical verifier, a second challenge according to the certified randomness protocol using the secret string; encrypting, by each of the first classical verifier and the second classical verifier, the second challenge using the output of the keyed cryptographic hash function on a combination of the first random input and the second random input; sending, by the first classical verifier, the second encrypted challenge to the quantum prover, wherein the second encrypted challenge is sent before the result is received; sending, by the second classical verifier, the second random input to the quantum prover; receiving, by the quantum prover, the second encrypted challenge and the second random input; computing, by the quantum prover, the second challenge using the random hash key, the first random input, and the second random input to decrypt the encrypted challenge; running, by the quantum prover, a certified randomness prover on the second challenge to obtain a second result; sending, by the quantum prover, the second result to both the first classical verifier and the second classical verifier; determining, by the first classical verifier and the second classical verifier, that the second result was received within the time threshold; comparing, by the first classical verifier and the second classical verifier, the second result received by the first classical verifier and the second result received by the second classical verifier to ensure that they match; and determining, by the first classical verifier and the second classical verifier that the second result passes the certified randomness protocol.

8 . The method of claim 1 , wherein the first classical verifier and the second classical verifier comprises classical electronic devices, and the quantum prover comprises a classical electronic device with access to a quantum computer.

9 . The method of claim 1 , further comprising:
agreeing, by the first classical verifier and the second classical verifier, to a selection of the certified randomness protocol; and publishing, by the first classical verifier or the second classical verifier, the selected certified randomness protocol to the quantum prover.

10 . The method of claim 1 , wherein the secret string comprises random bits and is known to only the first classical verifier and the second classical verifier.

11 . A system, comprising:
a first classical verifier executing a first classical verifier computer program; a second classical verifier executing a second classical verifier computer program; and a quantum prover executing a quantum prover computer program, wherein the quantum prover has access to a quantum computer;
wherein:
the first classical verifier computer program and the second classical verifier computer program share a long secret string comprising a secret string, a first random input, a second random input, and a random hash key that identifies one of a plurality of keyed cryptographic hash functions;
the first classical verifier computer program and the second classical verifier computer program generate a challenge according to a certified randomness protocol using the secret string;
the first classical verifier computer program and the second classical verifier computer program sample a keyed cryptographic hash function from the plurality of keyed cryptographic hash functions using the random hash key;
the first classical verifier computer program and the second classical verifier computer program each encrypt the challenge using an output of the keyed cryptographic hash function on a combination of the first random input and the second random input;
the first classical verifier computer program sends the encrypted challenge, the first random input, and the random hash key to the quantum prover;
the second classical verifier computer program sends the second random input to the quantum prover computer program;
the quantum prover computer program receives the encrypted challenge, the first random input and the second random input;
the quantum prover computer program decrypts the encrypted challenge using the random hash key, the first random input, and the second random input;
the quantum prover computer program executes a random quantum computation based on the certified randomness protocol and the challenge using the quantum computer;
the quantum prover computer program sends, a result of the random quantum computation to both the first classica

Assignees

• Jpmorgan Chase Bank Na

Inventors

• Amer Omar
• Chakraborty Kaushik
• Kaleoglu Fatih
• Lim Charles
• Pistoia Marco
• Liu Minzhao
• Cui David

Classifications

• H04L9/3242

  involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC · CPC title

• H04L9/0869

  involving random numbers or seeds · CPC title

• H04L9/0852 Primary

  Quantum cryptography (transmission systems employing electromagnetic waves other than radio waves, e.g. light, infrared H04B10/00; wavelength-division multiplex systems H04J14/02; WDM arrangements H04J14/03) · CPC title