First interactive protocol for Davis-Putnam resolution that is competitive with BDD methods for certifying UNSAT.
The knowledge complexity of interactive proof-systems (extended abstract)
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
verdicts
UNVERDICTED 5representative citing papers
Mixed-methods study finds AI assistance linked to higher textual overlap with suggestions in writing tasks, and a reflective interface prototype increases user awareness of AI incorporation.
A survey providing a taxonomy of ZKP applications, evaluation criteria, and comparative tables focused on zkSNARKs and alternatives like zkSTARKs and Bulletproofs.
Evaluates ECDSA-based threshold signatures on the Filia CBDC platform and reports that they improve security with acceptable computational and communication overhead for real deployments.
Applies Plonky2 (PLONK + FRI) to produce ZK proofs for SHA-256 integrity on random and NEAR blockchain data, reporting manageable proof sizes and runtimes.
citing papers explorer
-
A Resolution-Based Interactive Proof System for UNSAT
First interactive protocol for Davis-Putnam resolution that is competitive with BDD methods for certifying UNSAT.
-
Overreliance in Writing Tasks: Exploring Similarity-Based Measures of AI Influence on Writing and Proposing a Reflective Writing Interface Intervention
Mixed-methods study finds AI assistance linked to higher textual overlap with suggestions in writing tasks, and a reflective interface prototype increases user awareness of AI incorporation.
-
A Survey on the Applications of Zero-Knowledge Proofs
A survey providing a taxonomy of ZKP applications, evaluation criteria, and comparative tables focused on zkSNARKs and alternatives like zkSTARKs and Bulletproofs.
-
Threshold Signatures for Central Bank Digital Currencies
Evaluates ECDSA-based threshold signatures on the Filia CBDC platform and reports that they improve security with acceptable computational and communication overhead for real deployments.
-
Scalable Zero-Knowledge Proofs for Verifying Cryptographic Hashing in Blockchain Applications
Applies Plonky2 (PLONK + FRI) to produce ZK proofs for SHA-256 integrity on random and NEAR blockchain data, reporting manageable proof sizes and runtimes.