Capstractcscapstract:2611.00064

Computer Science > Cryptography and Security

Title:Cover Traffic Under Exact Stock Reconciliation

Abstract:

Publishing the opening and closing counts of a conserved inventory reveals the aggregate number of withdrawals. We study a mechanism that protects individual withdrawals by carrying out additional ones while keeping every published count exact. In a two-tray catering model, a steward replenishes the service tray and serves doughnuts from reserve to a separate standby roster. We give a capped additive mechanism that minimizes both the required roster and each upper tail of the number of standby servings. At ϵ=ln⁡2\epsilon=\ln 2 and δ=10−6\delta=10^{-6}, if all twelve employees decline seconds, the steward must serve all twelve standby diners with probability at least 0.995905 at the minimum reserve capacity. Sampling the indicator of actual standby service at rate λ\lambda raises the exact failure parameter of the mechanism to λ+(1−λ)δ\lambda+(1-\lambda)\delta.

Comments:4 pages, 3 figures, 1 table. Exact finite-state evaluation.
Subjects:Cryptography and Security (cs.CR)
Cite as:capstract:2611.00064 [cs.CR]
 (or capstract:2611.00064v1 [cs.CR] for this version)

Submission history

From: Mira Halden
[v1] Fri, 20 Nov 2026 21:20:52 UTC (208 KB)

Current browse context:

cs
Change to browse by:

Export citation