Interactive proof system

Known as: Multiprover Interactive Proofs, Interactive proof systems, Multi-prover interactive proof

In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

If difficulty level of a game does not match player's skills, the game could be frustrating or disappointing. In this paper we…

2013

We introduce online interactive proofs (OIP), which are a hierarchy of communication complexity models that involve both…

2011

Traditionally, the definition of zero-knowledge states that an interactive proof of x ∈ L provides zero (additional) knowledge if…

2004

We outline the linguistic problem of word-sense ambiguity and demonstrate its relevance to current computer security applications…

2002

We present an incremental proof of the producer/consumer property for the PCI protocol. In the incremental proof, a corrected…

2001

We discuss the general concept of calculational reasoning within Isabelle/Isar, which provides a framework for high-level natural…

2000

Abstract This article discusses the specifics of liaison interpreting as a new profession which is quickly getting recognised…

1997

We study interactive arguments, in particular their error probability under sequential iteration. This problem is more complex…

1990

Bounded round multiprover interactive proof systems (MIPs) are compared with unbounded round interactive proof systems (IPSs). It…

1990

In zero-knowledge interactive proofs, a lot of randomized information is exchanged between the prover and the verifier, and the…