Challenging epistemology: Interactive proofs and zero knowledge

DOI10.1016/J.JAL.2008.09.002MaRDI QIDQ959048zbMATH OpenOpenAlexFDO

Authors Justin Bledin

Publication date 11 December 2008

Published in Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jal.2008.09.002

zbMATH Keywords

zero knowledgeepistemology of mathematicsinteractive proofsphilosophy of computer science

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Philosophy of mathematics (00A30) General topics in the theory of computing (68Q01)

Recommendations

• The knowledge complexity of interactive proof-systems
• scientific article; zbMATH DE number 4087662
• scientific article; zbMATH DE number 994841
• Logic of non-monotonic interactive proofs
• scientific article; zbMATH DE number 4106274

Cites work

• scientific article; zbMATH DE number 5505771 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1007358 (Why is no real title available?)
• scientific article; zbMATH DE number 1754603 (Why is no real title available?)
• scientific article; zbMATH DE number 2196514 (Why is no real title available?)
• scientific article; zbMATH DE number 3042480 (Why is no real title available?)
• BPP and the polynomial hierarchy
• Computational Complexity
• From data to semantic information
• Mathematical method and proof
• On the provability, veracity, and AI-relevance of the Church-Turing thesis
• Probabilistic Proof Systems: A Primer
• The Knowledge Complexity of Interactive Proof Systems
• The PCP theorem by gap amplification

Cited in

(2)

• The epistemology of computer-mediated proofs
• Observation and interaction. Invited paper

This page was built for publication: Challenging epistemology: Interactive proofs and zero knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q959048)