163 search results - page 2 / 33 » Computationally Convincing Proofs of Knowledge |
ASIACRYPT
2000
Springer
13 years 10 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...
ECCC
2006
13 years 5 months ago
2006
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
ICTCS
2007
Springer
13 years 12 months ago
2007
Springer
CSFW
2012
IEEE
11 years 8 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...