Now showing items 1-2 of 2

    • Composition of Zero-Knowledge Proofs with Efficient Provers 

      Birrell, Eleanor; Vadhan, Salil P. (Springer Verlag, 2010)
      We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input). Our results are: 1.) When restricted to ...
    • Unconditional Relationships within Zero Knowledge 

      Ong, Shien Jin (2011-09-09)
      Zero-knowledge protocols enable one party, called a prover, to "convince" another party, called a verifier, the validity of a mathematical statement such that the verifier "learns nothing" other than the fact that the ...