Now showing items 1-2 of 2

    • Constant-Round Concurrent Zero-Knowledge From Falsifiable Assumptions 

      Chung, Kai-Min; Lin, Huijia; Pass, Rafael (2012-10-02)
      We present a constant-round concurrent zero-knowledge protocol for $\NP$. Our protocol is sound against uniform polynomial-time attackers, and relies on the existence of families of collision-resistant hash functions, and ...
    • Settling the Round-Complexity of Non-Malleable Commitments 

      Lin, Huijia; Pass, Rafael (2010-09-03)
      We show \emph{unconditionally} that the existence of commitment schemes implies the existence of \emph{constant-round} non-malleable commitments; earlier protocol required additional assumptions such as collision resistant ...