Interactive proof system
id:
interactive-proof-system-188-5091714
title:
Interactive proof system
text:
In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier. The parties interact by exchanging messages in order to ascertain whether a given string belongs to a language or not. The prover possesses unlimited computational resources but cannot be trusted, while the verifier has bounded computation power but is assumed to be always honest. Messages are sent between the ver
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Interactive_proof_system
date created:
2002-12-21T17:31:00Z
date modified:
2024-09-08T22:48:04Z
main entity:
{"identifier":"Q1665886","url":"https://www.wikidata.org/entity/Q1665886"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/b0/Interactive_proof_%28complexity%29.svg","width":248,"height":164}
fields total:
13
integrity:
15