3228 search results - page 89 / 646 » Computationally Sound Proofs |
ASIACRYPT
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
CCS
2010
ACM
13 years 9 months ago
2010
ACM
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
BIRTHDAY
2005
Springer
14 years 2 months ago
2005
Springer
