Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SIAMCOMP
2000

favoriteEmaildiscussreport

106views more SIAMCOMP 2000»

Computationally Sound Proofs

13 years 4 months ago

Computationally Sound Proofs

Download people.csail.mit.edu

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

Silvio Micali

Real-time Traffic

Complexity Theory | Computational Complexity | Meaningful Framework | SIAMCOMP 2000 |

claim paper

Related Content

» CoSP a general framework for computational soundness proofs

» Computational soundness of symbolic zeroknowledge proofs

» Computationally Sound Automated Proofs for Security Protocols

» A Semantic Foundation for Hidden State

» Computationally Sound Mechanized Proofs of Correspondence Assertions

» Computationally sound mechanized proofs for basic and publickey Kerberos

» Computationally sound secrecy proofs by mechanized flow analysis

» Computationally Sound Compositional Logic for Key Exchange Protocols

» A Machine Checked Soundness Proof for an Intermediate Verification Language

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	SIAMCOMP
Authors	Silvio Micali

Comments (0)