Now showing items 1-4 of 4

    • Concurrent/Resettable Zero-Knowledge Protocols for NP in the Public Key Model 

      Micali, Silvio; Reyzin, Leonid (2000-08)
      We propose a four-round protocol for concurrent and resettable zero-knowledge arguments for any langauge in NP, assuming the verifier has a pre-registered public-key. We also propose a three-round protocol with an additional ...
    • Forward-Secure Signatures with Optimal Signing and Verifying 

      Itkis, Gene; Reyzin, Leonid (2001-04)
      Ordinary digital signatures have an inherent weakness: if the secret key is leaked, then all signatures, even the ones generated before the leak, are no longer trustworthy. Forward-secure digital signatures were recently ...
    • Mutually Independent Commitment 

      Liskov, Moses; Lysyanskeya, Anna; Micali, Silvio; Reyzin, Leonid; Smith, Adam (2001-04)
      We describe a new kind of commitment scheme in which two parties commit to values in a commitment stage, at the end of which we are assured that the values they have committed to cannot be correlated to one another. We ...
    • 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. ...