4099 search results - page 26 / 820 » A Framework for Interactive Proof |
ISSAC
1990
Springer
15 years 1 months ago
1990
Springer
In the previous papers [7-101we defined and explored a formal methodological framework on the basis of which resolution proof systems for strongly-finite logics can be introduced ...
SIAMCOMP
2000
14 years 9 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
CSL
2005
Springer
15 years 3 months ago
2005
Springer
We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying...
115
click to vote
SERP
2007
14 years 11 months ago
2007
- Modern tools have simplified the development of the enterprise applications by bridging gaps across various technologies like file systems, relational databases, messaging, and w...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...