Computationally Sound Proofs

This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a novel and meaningful framework, answers to old and new questions in complexity theory. In particular, given a random oracle or a new complexity assumption, they enable us to

• Type: Journal
• Year: 2000
• Where: SIAMCOMP
• Authors: Silvio Micali
• Keywords: Complexity Theory, Computational Complexity, Meaningful Framework, SIAMCOMP 2000