All Questions
Tagged with interactive-proofs provable-security
2 questions
2
votes
1
answer
93
views
Deterministic vs probabilistic adversaries in a proof-of-knowledge context
In several security games, it is safe to replace probabilistic polynomial-time adversaries with deterministic ones without reducing the adversarial advantage. The relevant argument can be found here.
...
- 23
1
vote
1
answer
275
views
Can we achieve statistical Completeness, Soundness and Zero Knowledge in an Interactive Proof?
The question is mainly stated in the title, sorry for it being a bit small of a question. I was reading about ZK proofs and I was wondering what do we know about their limits only their properties. Do ...
- 992