1411 search results - page 29 / 283 » Interactive Coding for Interactive Proofs |
UIC
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Devices like PDAs, mobile phones and Smartcards can communicate with each other and to exchange information and they should be made mutually aware of each other. For priv...
ESAS
2006
Springer
14 years 2 months ago
2006
Springer
In the context of ambient networks, this article describes a cryptographic protocol called Common History Extraction (CHE) protocol implementing a trust management framework. All t...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
CORR
1999
Springer
13 years 10 months ago
1999
Springer
This paper introduces a logical system, called BV , which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challe...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...