Direct construction of doubly efficient interactive proofs for PSPACE languages up to time bound T(n) = n^{O(log n)}.
An Injectivity Analysis of Crystals-Kyber and Implications on Quantum Secu- rity
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
BipBipCache achieves effective 3-cycle write latency for 6-cycle BipBip encryption by overlapping encryptor stages with tag decryption and hit detection in an embedded cache controller.
Derives pass bounds for confirmation-code-augmented FO KEM tests and proves α+β≥1 lower bound on certifier errors under honest-support harnesses that factor through final-key targets.
citing papers explorer
-
Towards a Doubly Efficient IP=PSPACE
Direct construction of doubly efficient interactive proofs for PSPACE languages up to time bound T(n) = n^{O(log n)}.
-
BipBipCache: Pipeline-Aware Integration of Low-Latency Tweakable Encryption in an Embedded Cache Controller
BipBipCache achieves effective 3-cycle write latency for 6-cycle BipBip encryption by overlapping encryptor stages with tag decryption and hit detection in an embedded cache controller.
-
What Can Verifiable Decapsulation Tests Certify? Pass Bounds and Fault-Recognition Limits for FO-Based KEMs
Derives pass bounds for confirmation-code-augmented FO KEM tests and proves α+β≥1 lower bound on certifier errors under honest-support harnesses that factor through final-key targets.