163 search results - page 6 / 33 » Computationally Convincing Proofs of Knowledge |
STOC
2002
ACM
14 years 8 months ago
2002
ACM
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
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...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
LPAR
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
ICA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Renyi’s entropy-based criterion has been proposed as an objective function for independent component analysis because of its relationship with Shannon’s entropy and i...