Direct construction of doubly efficient interactive proofs for PSPACE languages up to time bound T(n) = n^{O(log n)}.
Strong Federated Authentication With Password-Based Credential Against Identity Server Corruption
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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)}.