Pith. sign in

Title resolution pending

Guanqin Zhang, Feng Xu · Lecture notes in computer science · DOI 10.1007/978-981-96-9101-2_16

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
open at publisher browse 2 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.CC 1 cs.CR 1

years

2026 2

verdicts

ACCEPT 1 UNVERDICTED 1

representative citing papers

Towards a Doubly Efficient IP=PSPACE

cs.CC · 2026-06-19 · unverdicted · novelty 6.0

Direct construction of doubly efficient interactive proofs for PSPACE languages up to time bound T(n) = n^{O(log n)}.

citing papers explorer

Showing 2 of 2 citing papers.

  • Lower Bounds for PIR with Preprocessing from Blackbox Cryptography cs.CR · 2026-07-07 · accept · none · ref 51 · 2 links

    Any blackbox single-server PIR with s-bit client storage needs Ω(n/s) amortized online communication or server crypto ops across Ω(s) queries, and blackbox DEPIR with sublinear query time is impossible.

  • Towards a Doubly Efficient IP=PSPACE cs.CC · 2026-06-19 · unverdicted · none · ref 59

    Direct construction of doubly efficient interactive proofs for PSPACE languages up to time bound T(n) = n^{O(log n)}.