54 search results - page 2 / 11 » On the Concurrent Composition of Zero-Knowledge Proofs |
STOC
1998
ACM
13 years 11 months ago
1998
ACM
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
TCC
2010
Springer
13 years 5 months ago
2010
Springer
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)...
FOCS
2002
IEEE
14 years 13 days ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
IACR
2011
12 years 7 months ago
2011
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
FC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This work introduces a new tool for a fund manager to verifiably communicate portfolio risk characteristics to an investor. We address the classic dilemma: How can an in...