10 search results - page 1 / 2 » Efficient Identification Schemes Using Two Prover Interactiv... |
CRYPTO
1989
Springer
13 years 9 months ago
1989
Springer
CRYPTO
1994
Springer
13 years 9 months ago
1994
Springer
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
JOC
2006
13 years 5 months ago
2006
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...