{"id":"33e395c0-245b-4aa3-b262-b086c4213084","arxiv_id":"2506.10028","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":1.0,"correctness_risk":"high","formal_verification":"none","parameter_count":4,"one_line_summary":"A proposal to combine BB84 QKD with one-time pad encryption for cloud data, presented without novel protocol design or reproducible evidence.","lead":"This paper proposes using quantum key distribution (BB84) and a one-time pad to secure cloud data access. It provides no testable implementation, and its security claims rest on asserted simulation percentages rather than shared data or code.","discovery_kind":"incremental","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Even with ideal QKD hardware, the scheme fails: BB84 needs an authenticated classical channel, and §§3.1/3.6–3.9 provide none, so a MITM can make separate keys with user and cloud and read all OTP traffic.","rationale":"The reader correctly identifies high correctness risk and recommends rejection. My stress-test focuses on a more decisive failure than hardware feasibility: even if the physical QKD infrastructure were perfect, the described protocol would not provide the claimed security because it lacks authenticated classical communication. BB84's security proof, and all subsequent QKD security proofs, assumes the public-discussion channel is authenticated; otherwise an adversary can mount a man-in-the-middle attack by running separate QKD sessions. The paper's §3.1 says an authentication component exists, but §§3.6–3.9 do not specify one; username/password and a generic public/private key pair do not authenticate the basis-sifting messages unless a concrete quantum-safe signature or MAC is defined and bound to those messages. If the public-key method is RSA/ECC, the 'quantum-resistant' claim fails by Shor's algorithm; if it is an unspecified MAC, the bootstrap problem of the pre-shared key is unaddressed. Thus the central claim is not merely unproven; it is unsupported by the protocol as written. The simulated percentages in §4.2–4.4 cannot compensate because no implementation, data, or formal argument is supplied. The paper does correctly restate the textbook BB84 and OTP definitions, and the OTP ciphertext equation is standard; that supports the underlying primitives, not the proposed cloud-security system. Because the reader's verdict is REJECT and this stress-test reinforces it, I recommend no change.","tokens_in":9817,"tokens_out":8229,"duration_ms":111675,"concrete_test":"Implement a simulator for §§3.4–3.10 with Alice, Bob, and an active Eve who performs two independent BB84 sessions and relays basis announcements without authentication. If Alice and Bob accept keys (QBER below threshold in each leg) while Eve knows both keys and can decrypt the ciphertext C = M ⊕ K_final, then the central security claim fails exactly where §4.3 claims 98.7% MITM detection. Alternatively, formally check whether any pre-shared secret or certified signature authenticates the §3.9 public basis comparison; the absence of such binding in §§3.6–3.9 is itself the failure.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The most load-bearing weakness is not hardware loss but the absence of authenticated classical-channel processing, which is required by BB84 and all QKD security proofs. Section 3.1 admits the classical channel can be 'any conventional network link, such as the internet or a phone network'; Section 3.9 has Alice and Bob exchange bases 'over an open channel'. Section 3.1 mentions 'an authentication component to ensure the prevention of man-in-the-middle attacks', but no mechanism is described. Sections 3.6–3.7 provide only username/password login and an unspecified public/private key pair, and nothing binds that pair to the basis-reconciliation messages. Without a pre-shared secret or a certified quantum-safe signature on the sifting/error-correction messages, an attacker can run two independent BB84 sessions—one with the user, one with the cloud—and relay traffic between them. Each victim sees a normal QKD session with low QBER, so the protocol's eavesdropping detection never triggers. This is not a practical implementation detail; it breaks the claimed confidentiality even if single-photon sources, low-loss channels, and perfect detectors are assumed. The §4.2/4.3 percentages (99.5% eavesdropping, 98.7% MITM detection) are unsupported by any simulation or proof and are inconsistent with the standard threat model here. The OTP encryption in §3.10 inherits this compromised key.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper proposes a cloud data-access security scheme that combines Quantum Key Distribution via the BB84 protocol (§3.1, §3.3–3.9) with a quantum one-time pad for XOR encryption (§3.2, §3.10–3.11), preceded by user registration and login steps (§3.6–3.7). The paper claims that the combination is unconditionally secure against classical and quantum adversaries (§1, §5) and reports experimental results: 99.5% eavesdropping-attack detection (§4.2), 98.7% MITM detection (§4.3), 100% brute-force resistance (§4.4), and millisecond-scale encryption/decryption times (§4.5–4.6). The manuscript contains no explicit threat model, no simulation or measurement methodology, and none of the cited figures appears in the text.","tokens_in":10101,"tokens_out":12627,"duration_ms":136633,"significance":"The underlying textbook components are, in isolation, real: the BB84 sifting procedure in Table 2 and §3.8–3.9 follows the standard protocol; the four one-time-pad conditions in §3.2 are the classical correctness conditions; and the no-cloning basis for eavesdropping detection (§3.1, [23]) is standard. These are the paper's genuine strengths, but they are imported from prior literature rather than developed. The stress-test concern lands: the paper is not circular, but the composition is missing a component it needs—authentication of the classical channel—and that is a protocol-level failure, not a hardware-practicality quibble; the distance/loss concerns are secondary. If the missing component were supplied and the headline numbers were backed by a reproducible experiment, this could be a useful applied demonstration. As written, the positive content is a correct restatement of textbook material and every quantitative claim in Section 4 is unverifiable: there is no machine-checked proof, no reproducible code, and no reported data.","major_comments":[{"comment":"The scheme's central confidentiality claim fails even under ideal quantum hardware because the BB84 classical channel is not authenticated. Section 3.1 states that the classical channel 'can be any conventional network link, such as the internet or a phone network' and lists 'an authentication component to ensure the prevention of man-in-the-middle attacks' as a generic QKD system requirement, but the proposed architecture never specifies or uses such a component: §3.6–3.7 provide only username/password login and a public/private key pair whose cryptosystem and usage are never described, and §3.9 has Alice and Bob compare bases 'over an open channel.' An adversary who intercepts the quantum channel and relays the classical channel can run two independent BB84 sessions, one with the user and one with the cloud, and can then sift positions so that each victim observes a zero-error session; the eavesdropping detection claimed in §4.2 and §4.3 therefore never triggers. The resulting 'final key' of §3.10 is known to the adversary, which defeats the QOTP encryption in §3.10–3.11. This is not a hardware-practicality issue: it is a protocol-level gap that must be closed with a pre-shared secret or a quantum-safe signature bound to the reconciliation messages.","section":"§3.1, §3.6–§3.9"},{"comment":"Sections 4.2–4.4 report detection rates of 99.5% for eavesdropping, 98.7% for MITM attacks, and 100% resistance to brute-force decryption, but the paper contains no simulation setup, no attack-generation method, no dataset, no measured values, and no error bars; Fig. 2, which is cited as the error-detection evidence, is absent from the manuscript. The numbers are therefore not checkable, and the 100% brute-force figure is especially problematic because, for a correctly used one-time pad (§3.2), this is the definition of information-theoretic security rather than an experimental finding; the comparison with AES and RSA claimed in §4.4 requires an actual brute-force experiment that is not described. As submitted, the headline experimental claims of the abstract and Section 4 are unsupported.","section":"§4.2–§4.4"},{"comment":"The performance and scalability claims in §4.5–4.6 are unverifiable: QOTP encryption/decryption times of 3.8 ms and 4.1 ms, AES-256 times of 2.1 ms and 2.3 ms, and key-generation times rising from 1.2 ms to 6.8 ms for user counts of 10 to 1000 are reported without any statement of hardware, message size, key length, measurement procedure, or number of trials. The unnumbered performance-metrics table in §4.5 also asserts a 100–400 km distance range, an 11% QBER tolerance, and Mbps key-generation rates without derivation or citation, and Fig. 5 ('Performances'), which is supposed to display these data, is absent. Because these figures carry the paper's stated contribution of a practical and scalable scheme (§1, §5), they need to be backed by a reproducible measurement.","section":"§4.5–§4.6"}],"minor_comments":[{"comment":"Section ordering and numbering are inconsistent: §3.2 ('Quantum One-time pad') appears before §3.1 ('The Quantum Key Distribution'), and there are two subsections numbered 4.6 ('Scalability Assessment' and 'Comparative Analysis with Classical Methods').","section":"§3, §4"},{"comment":"Table 1 contains empty cells: the polarization states for the rectilinear and diagonal bases are not filled in, and §3.8 describes the rectilinear basis with garbled glyphs ('Horizontal (|) represents 0 and vertical (-) represents 1'), contradicting Table 2 and §3.3, where horizontal is 0° and vertical is 90°.","section":"Table 1, §3.8"},{"comment":"Figures 1–5 are referenced throughout the manuscript but none appears in the text, so the claimed architecture (Fig. 1), the error-detection rate (Fig. 2), the processing time (Fig. 3), and the accuracy/performance comparisons (Figs. 4–5) cannot be inspected.","section":"Figs. 1–5"},{"comment":"The term 'Quantum One-Time Pad' (§3.2) is used for a classical XOR one-time pad keyed by QKD output; in the quantum-cryptography literature this name usually refers to a different primitive based on quantum gates or entanglement, so the terminology should be clarified to avoid confusion.","section":"§3.2"},{"comment":"Section 3.5 states that 'if even an attacker obtains the encryption key, they cannot decrypt the data since the key can never be reused,' which is backwards: a one-time pad is secure only while the key remains secret; key compromise enables decryption. The sentence should be corrected.","section":"§3.5"},{"comment":"The sentence in §4.6 ('AES–256 is fast, but RSA is faster than RSA') is incoherent, and the paragraph appears to compare key-exchange security (RSA) with symmetric encryption (AES) without distinguishing the roles.","section":"§4.6"},{"comment":"References [12], [26], and [27] are listed in the bibliography but never cited in the text, and several DOI strings in the reference list (e.g., [3], [5], [6]) are formatted inconsistently.","section":"References"}],"recommendation":"reject","confidential_remarks":"This manuscript is, at its core, a summary of textbook quantum cryptography wrapped in a cloud-access story, with unsupported quantitative claims (99.5%, 98.7%, 100%) and a protocol-level authentication gap that invalidates the central security statement. I would not invite a revision unless the authors can describe and integrate an authenticated classical channel, provide a reproducible experimental methodology with full data, and remove or justify every percentage. There is also a scope question: as presented, the contribution is an exposition rather than a research result, and the journal should assess whether this belongs at all. No concern about citation manipulation arises; the reference list is merely sloppy."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Honestly, this is a textbook restatement of BB84 and the one-time pad, wrapped in cloud jargon, with fabricated-looking simulation percentages. The good news: the authors correctly describe the basic BB84 sifting procedure, the XOR encryption/decryption mechanics, and the four conditions for OTP security. If all you need is a tutorial on why QKD+OTP is information-theoretically secure in the ideal model, sections 3.2–3.11 are mostly accurate.\n\nThe bad news: nothing here is new. The paper proposes no protocol, no proof, no system design beyond a generic 'cloud' box, and no data. The 'experimental results' in Section 4 report 99.5% eavesdropping detection, 98.7% MITM detection, and 100% brute-force resistance, but there is no simulation setup, no dataset, no error bars, and no way to reproduce any of it. These numbers appear to be invented.\n\nThe deeper problem is load-bearing: the scheme as described is insecure even with perfect quantum hardware. BB84 requires an authenticated classical channel for basis reconciliation and error correction. The paper mentions in passing that a QKD system includes 'an authentication component' (Sec. 3.1), but then in Sec. 3.9 has Alice and Bob exchange bases 'over an open channel,' and the user registration/login (Secs. 3.6–3.7) only provides username/password and an unspecified public/private key pair that is never bound to the sifting messages. Without a pre-shared secret or a certified signature on the classical messages, a MITM can run two independent BB84 sessions with the user and cloud, relay the traffic, and end up sharing two keys while each side sees a normal QBER. The OTP ciphertext then falls to the attacker. This isn't a practical detail; it breaks the claimed confidentiality outright.\n\nThe paper also has structural problems: an empty Table 1, duplicate section numbers (two 4.6s), and a reference list that is used as filler. The literature survey is a string of unrelated DNA-cryptography papers with no critical synthesis.\n\nWho is this for? Maybe a student who wants a gentle introduction to QKD basics, but not as a research contribution. It deserves a desk reject, not peer review.","headline":"A textbook BB84/OTP recap with unsupported simulation numbers; the missing authenticated classical channel is a fatal flaw that makes the claimed security false even in ideal conditions.","tokens_in":10656,"tokens_out":2627,"would_cite":false,"duration_ms":25645,"reading_group":"no","serious_thinker":"no","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P94","94A60"],"pacs":["03.67.Dd"],"model":"deepseek-v4-flash","headline":"The paper argues that combining quantum key distribution (QKD), the BB84 protocol, and the quantum one-time pad (QOTP) makes cloud data access secure against both classical attacks and future quantum computers, reporting 99.5 percent…","keywords":["quantum cryptography","cloud security","BB84 protocol","quantum key distribution","quantum one-time pad","eavesdropping detection","brute-force resistance","post-quantum security"],"falsifier":"Run the system on real hardware with an attacker performing intercept-and-resend on a controlled fraction of BB84 pulses, and check whether the induced quantum bit error rate exceeds the protocol's threshold in the claimed 99.5 percent of trials; separately audit the key store for any reuse, since if two ciphertexts ever share a pad bit their XOR yields $p_1 \\oplus p_2$, the exact break the paper's own Venona example describes.","tokens_in":9604,"feed_emoji":"🔐","tokens_out":12352,"duration_ms":131373,"temperature":0.7,"pith_summary":"This paper tries to establish that a cloud security system built from three quantum ingredients—QKD for key exchange, the BB84 protocol for that exchange, and the quantum one-time pad (QOTP) for encryption—can protect stored and shared data against classical attacks and against future quantum computers. Because measuring a photon disturbs its quantum state and cannot be done silently, BB84 makes any attempted eavesdropping detectable, while QOTP's XOR encryption with a random, same-length, single-use key leaves ciphertext with no statistical pattern and no brute-force route. If the claim holds, cloud users would get data confidentiality that rests on physical law rather than computational hardness, at a reported cost of roughly 3.8 milliseconds of encryption time and 4.1 milliseconds of decryption time per operation.","feed_headline":"Quantum keys plus one-time pads make cloud data unbreakable","feed_subtitle":"BB84 key exchange detects 99.5 percent of eavesdropping, and one-time-pad ciphertext leaves nothing to crack.","key_machinery":"The load-bearing pair is BB84 plus QOTP. BB84 is the first quantum key distribution protocol: Alice sends photons polarized in one of two randomly chosen bases, Bob measures in randomly chosen bases, the two publicly compare bases and keep only matching bits, and eavesdropping is detected because measurement disturbs quantum states—the no-cloning theorem rules out silent copying. QOTP is the one-time pad keyed by that quantum process: each plaintext bit is XORed with a key bit, with the key the same length as the message, random, single-use, and secret, so the ciphertext $C = M \\oplus K_{\\mathrm{final}}$ is statistically pattern-free and decryption $M = C \\oplus K_{\\mathrm{final}}$ recovers the message. The machinery's job is to make key exchange provably private (BB84) and encryption provably unbreakable (QOTP), converting cloud data security from a computational assumption into a physical guarantee.","core_discovery":"The central claim, on the paper's own terms, is that the combination of QKD, BB84, and QOTP “creates a safe and reliable way to keep data secure when it is stored or shared in the cloud.” The security story has two linked parts: BB84 lets the cloud and the user distill a shared secret key whose privacy is guaranteed by quantum mechanics, since any interception disturbs photon states and surfaces as errors, and QOTP then encrypts the data by XORing it with that key, so the ciphertext reveals nothing about the plaintext as long as the key is truly random, as long as the message, used exactly once, and kept secret. The paper reports simulation results of 99.5 percent eavesdropping detection, 98.7 percent man-in-the-middle detection, and 100 percent resistance to brute-force decryption attempts, with key-generation time growing from 1.2 to 6.8 milliseconds as users scale from 10 to 1000.","pith_inferences":["The 'quantum one-time pad' implemented here is the classical XOR one-time pad whose key is supplied by QKD; its unconditional security therefore inherits entirely from the four classical OTP conditions plus the secrecy of the exchanged key.","The 99.5 and 98.7 percent detection figures come from simulations, not field trials; on real hardware, detection is governed by the quantum bit error rate against the protocol's threshold, so those percentages are testable only once a loss budget and distance are specified.","A plausible deployment path is hybrid: use QKD to refresh symmetric keys such as AES-256 rather than encrypting every byte one-time-pad style, since pad bits must match message length and any reuse breaks the ciphertext—the failure mode the paper itself describes with the Venona example.","If practical quantum channels remain the bottleneck, the scheme's value concentrates on high-value short-range links such as data-center interconnects and satellite QKD for wide areas, which is the reach implied by the paper's own performance table rather than demonstrated by its experiments."],"forward_implications":["If the claim is right, cloud data becomes confidential against adversaries with unlimited computing power, including quantum computers running Shor's algorithm.","Eavesdropping changes from a hidden threat into a detectable event, because interception of the key exchange leaves a measurable disturbance in quantum states.","The architecture—registration, login, QKD key generation, basis comparison, OTP encryption and decryption—provides a concrete template for a quantum-secure cloud access service.","The reported overhead (encryption and decryption near 4 milliseconds, key generation reaching 6.8 milliseconds at 1000 users) suggests the security gain need not come at an unusable cost in latency.","The scheme's own four OTP conditions define the operational discipline a deployment would have to enforce: key length equal to message, random choice, single use, and secrecy of the key."],"supporting_citations":[{"why":"Defines the BB84 protocol, the key-distribution method the entire scheme is built on.","marker":"[25]"},{"why":"Supplies the no-cloning theorem, the physical basis for the claim that eavesdropping on the key exchange is always detectable.","marker":"[23]"},{"why":"Provides the QKD protocol framework, channel model, and security rationale the system adopts.","marker":"[22]"},{"why":"States the four one-time-pad conditions the paper repeats as the security criteria for QOTP.","marker":"[28]"},{"why":"Documents how reused one-time pad pages were broken historically, motivating the single-use requirement in QOTP.","marker":"[29]"},{"why":"Supplies the BB84 key-sifting and reconciliation example the paper adapts for its key-generation walkthrough.","marker":"[21]"},{"why":"The DNA-plus-AES cloud scheme the paper argues is weak, giving the comparison target for its security claims.","marker":"[4]"}],"fun_headline_variants":["Quantum cryptography locks cloud data with unbreakable keys","BB84 and quantum one-time pads shield cloud data","Quantum key distribution thwarts quantum hackers in cloud","Quantum encryption detects 99.5% eavesdropping in cloud"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The scheme presupposes that a practical quantum channel—single-photon sources and detectors over optical fiber or free-space links between the cloud and every user—can deliver keys as long as the messages at the required rate, yet the paper provides no loss budget, no dark-count analysis, and no measured distance to support the 100–400 kilometer figures in its own performance table.","fun_headline_variants_meta":{"raw":{"variants":["Quantum cryptography locks cloud data with unbreakable keys","BB84 and quantum one-time pads shield cloud data","Quantum key distribution thwarts quantum hackers in cloud","Quantum encryption detects 99.5% eavesdropping in cloud"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000854,"raw_usage":{"total_tokens":3711,"prompt_tokens":945,"completion_tokens":2766,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":561,"completion_tokens_details":{"reasoning_tokens":2701}},"tokens_in":561,"tokens_out":2766,"duration_ms":22001,"temperature":1.0,"reasoning_tokens":2701,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T05:09:16.178658+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the system on real hardware with an attacker performing intercept-and-resend on a controlled fraction of BB84 pulses, and check whether the induced quantum bit error rate exceeds the protocol's threshold in the claimed 99.5 percent of trials; separately audit the key store for any reuse, since if two ciphertexts ever share a pad bit their XOR yields $p_1 \\oplus p_2$, the exact break the paper's own Venona example describes.","supporting_citations":[{"cited_title":"Encryption Algorithm Based on DNA Strand Displacement and DNA Sequence Operation,","cited_arxiv_id":null,"evidence_quote":"Defines the BB84 protocol, the key-distribution method the entire scheme is built on."},{"cited_title":"A Novel Image Cryptosystem Inspired by the Generation of Biological Protein Sequences,","cited_arxiv_id":null,"evidence_quote":"Supplies the no-cloning theorem, the physical basis for the claim that eavesdropping on the key exchange is always detectable."},{"cited_title":"A Data Security Enhanced Access Control Mechanism in Mobile Edge Computing,","cited_arxiv_id":null,"evidence_quote":"Provides the QKD protocol framework, channel model, and security rationale the system adopts."},{"cited_title":"The plaintext's length and the key's length must match","cited_arxiv_id":null,"evidence_quote":"The DNA-plus-AES cloud scheme the paper argues is weak, giving the comparison target for its security claims."}],"review_version":1}