Direct construction of doubly efficient interactive proofs for PSPACE languages up to time bound T(n) = n^{O(log n)}.
Towards Scalable and Secure IoTs Transactions: A New Bi-directional Payment Channel Without Third-Party Monitoring
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative 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.
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.