New PIR schemes store n+1 bits and answer queries in sublinear time
For two servers, query time is n^0.82, matching prior EUROCRYPT 2026 schemes with far less storage.
Stories per day · 30 days
1 RSS
Relatedcryptography2extraction1modular-forms1private-information-retrieval1randomness1secret-sharing1tcc1
4 stories, newest first · one card per story
Stories tagged #information-theoretic
Secret Sharing from Non-Extractable Randomness
Researchers show two-of-two secret sharing of long secrets does not need extractable randomness.
Rate 1/5 Non-Malleable Codes against Entangled Split-State Tampering
New non-malleable codes reach rate nearly 1/5 against entangled quantum split-state tampering.
Zero Knowledge Proofs in Quantum Networks
Researchers propose information-theoretic zero-knowledge proofs for multiparty quantum networks.