LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 55-57 of 486

    • Copmutationally Sound Proofs 

      Micali, Silvio (2000)
      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, answer ...

    • Proving Correctness of a Controller Algorithm for the RAID Level 5 System 

      Vazirir, Mandana; Lynch, Nancy A.; Wing, Jeannette
      Mos RAID controllers implemented in industry are complicated and difficult to reason about. This complexity has led to software and hardware systems that are difficult to debug and hard to modify. To overcome this problem ...

    • Signing with Partially Adversarial Hashing 

      Micali, Silvio; Reyzin, Leonid (1998-02)
      Digital signatures usually utilize one-way hash functions designed by other parties. It is thus possible that such hash functions are adverserially designed so as to enable forging signatures in otherwise secure schemes. ...