Copyright © Philip M. Parker, INSEAD. Terms of Use.

INTERACTIVE PROOF SYSTEM

Specialty Definition: INTERACTIVE PROOF SYSTEM

DomainDefinition

Math

A protocol in which one or more provers try to convince another party, called the verifier, that the prover(s) possess certain true knowledge, such as the membership of a string x in a given language, often with the goal of revealing no further details about this knowledge. The prover(s) and verifier are formally defined as probabilistic Turing machines with special "interaction tapes" for exchanging messages. (references)

Source: compiled by the editor from various references; see credits.

Top     

Specialty Definition: Interactive proof system

(From Wikipedia, the free Encyclopedia)

The interactive proof system is a concept in computational complexity theory that models computation as the exchange of messages between two parties. The parties, the verifier and the prover, interact by exchanging messages in order to ascertain whether a given string belongs to a language or not. The prover is all-powerful, with unlimited computational resources while the verifier has bounded computation power. The verifier queries the prover a limited number of times and finds out whether the string belongs to the specified language or not.

This concept of computation as interaction between parties was suggested by Babai et al and Goldwasser et al. It has also been proven that the set of all languages recognizable by interaction (which is called IP) is equivalent to the set of all languages recognizable by a Turing machine using polynomial space.

Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "Interactive proof system."

Top     

Crosswords: INTERACTIVE PROOF SYSTEM

Specialty definitions using "INTERACTIVE PROOF SYSTEM": probabilistically checkable proof. (references)

Top     

Alternative Orthography: INTERACTIVE PROOF SYSTEM


Hexadecimal (or equivalents, 770AD-1900s) (references)

49 4E 54 45 52 41 43 54 49 56 45      50 52 4F 4F 46      53 59 53 54 45 4D

Leonardo da Vinci (1452-1519; backwards) (references)

        

Binary Code (1918-1938, probably earlier) (references)

01001001 01001110 01010100 01000101 01010010 01000001 01000011 01010100 01001001 01010110 01000101 00100000 01010000 01010010 01001111 01001111 01000110 00100000 01010011 01011001 01010011 01010100 01000101 01001101

HTML Code (1990) (references)

&#73 &#78 &#84 &#69 &#82 &#65 &#67 &#84 &#73 &#86 &#69 &#32 &#80 &#82 &#79 &#79 &#70 &#32 &#83 &#89 &#83 &#84 &#69 &#77

ISO 10646 (1991-1993) (references)

0049 004E 0054 0045 0052 0041 0043 0054 0049 0056 0045      0050 0052 004F 004F 0046      0053 0059 0053 0054 0045 004D

Encryption (beginner's substitution cypher): (references)

4348543952353754435639250524949402535953543947

Top     



INDEX

1. Crosswords
2. Orthography
3. Bibliography


  

Copyright © Philip M. Parker, INSEAD. Terms of Use.