29908 search results - page 580 / 5982 » On the Complexity of |
206
click to vote
COCO
2000
Springer
15 years 11 months ago
2000
Springer
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
175
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
210
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...