3 papers
quant-ph2026
Efficient Unclonable Encryption from Pauli Eigenstates
Seyoon Ragavan
We give, to our knowledge, the first plain-model, one-time information-theoretically secure, efficient unclonable encryption scheme for one classical bit. Previous work by Bhattach…
cs.CC2026
Exponentially Fewer-Server PIR from Sparser -Decoding Polynomials
Aparna Gupte, Seyoon Ragavan
We show that under a plausible number-theoretic conjecture, for any constant there exists an -server private information retrieval (PIR) protocol that on an -bit database…
cs.DS2026
Catalytic Tree Evaluation From Matching Vectors
Alexandra Henzinger, Edward Pyne, Seyoon Ragavan
We give new algorithms for tree evaluation (S. Cook et al. TOCT 2012) in the catalytic-computing model (Buhrman et al. STOC 2014). Two existing approaches aim to solve tree evaluat…