Questions tagged [quantum-cryptography]

Question 1

Suppose there is an oracle to which a random sequence is given. This sequence is either from a classical source or a quantum source. Assume that $n$ distinct random sequences are given to the oracle, ...

Question 2

I am a novice quantum cryptography enthusiast writing on the topic for a short dissertation, so please forgive me if I make any incorrect assumptions or ask ignorant questions. I recently came across ...

Question 3

I was studying the paper "One Shot Signatures and Applications to Hybrid Quantum/Classical Authentication." In it, the authors define "equivocal hashing" and provide a construction ...

Question 4

I am trying to understand how BFV leveled scheme is different from BGV leveled scheme? Is the difference in the noise management techniques? Do we have modulus chain for BFV as well? how do we do ...

Question 5

Current memory hard key derivation techniques rely on functions that allow for serialisation on tiny memory, except for requiring a quadratic time penalty. But, with Quantum's light-speed defying ...

Question 6

It is well-known that unconditional quantum bit commitment is impossible [1, 2, 3]. So I wonder if there is a direct proof for the classical case. Note that any classical protocol can be treated as a ...

Question 7

For a practical QKD implementation where OTP has been chosen for encrypting, how are key sizes determined? Say, for example, Alice wishes to exchange xGB to Bob, then a key management system should ...

Question 8

I don't understand why discrete logarithm is not quantum proof. I understand that quantum computer can quickly compute the exponent, but there is a modulo in the equation. Doesn't it mean, that there ...

Question 9

In the Quantum One Time Pad, an $n$-qubit quantum state can be perfectly encrypted (as in the classical OTP) using $2n$ classical bits. In the classical OTP, I'm allowed to send many times the ...

Question 10

The usual hybrid argument tells us that if two efficiently sampled ensembles are computationally indistinguishable based on a single sample, then, computational indistinguishability holds even for ...

Question 11

What are the theoretical usage limits of Kyber and Dilithium? Are there any sources to back this up? Maximum number of encryptions/signatures allowed per key, etc.?

Question 12

I am reading the paper Pseudorandom Quantum States,where the following candidate was shown to be a Pseudorandom state, called the complex random phase state: $\mathrm{PRF}_k:X → X$ be a keyed ...

Question 13

I am reviewing the ZKP course, represented by the university of Berkley (https://zk-learning.org/). In pages 41 and 42 of lecture 6 that is attached below (https://zk-learning.org/assets/lecture6.pdf),...

Question 14

I am working with lossy ID-schemes and their security in the QROM. Following the article of Kiltz et al. , I am at a loss of the number 8 appearing in most reductions throughout the article. I know it ...

Question 15

Bilinear Pairings are widely used in many new schemes like Group Signature and Aggregate Signature. The problem is whether it is post-quantum secure. In other words, does Bilinear Diffie-Hellman ...

Stack Exchange Network

Questions tagged [quantum-cryptography]

Distinguishing between a random sequence generated from a classical source and a quantum one

Does the use of trusted components align with the strict definition of device-independent quantum key distribution?

One Shot Signatures Equivocal Hash Security Proof

BFV bootstrapping vs leveled scheme

Is there any quantum memory hard key derivation?

Why is unconditional classical bit commitment impossible?

Key size for One Time Pad use with QKD

Why is discrete logarithm not quantum proof?

Quantum many time pad

Hybrid argument for quantum states

Kyber and Dilithium usage limits?

Tensor product of Pseudorandom States

Poly-commitment based on Bulletproofs

Where does the 8 come from? Generic Search Problem with Bounded Probabilities

Is pairing-based crypto post-quantum secure?

Hot Network Questions