Challenging epistemology: Interactive proofs and zero knowledge

DOI10.1016/J.JAL.2008.09.002zbMath1162.00006OpenAlexW2001459335MaRDI QIDQ959048

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

interactive proofszero knowledgeepistemology of mathematicsphilosophy of computer science

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical method and proof
• BPP and the polynomial hierarchy
• From data to semantic information
• Probabilistic Proof Systems: A Primer
• The Knowledge Complexity of Interactive Proof Systems
• The PCP theorem by gap amplification
• Computational Complexity

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