1888 search results - page 80 / 378 » Proof theory and computational analysis |
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
139
Voted
AAAI
2012
13 years 2 months ago
2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...
CCR
2000
15 years 9 days ago
2000
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
123
Voted
CSFW
1999
IEEE
15 years 4 months ago
1999
IEEE
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
129
Voted
Lecture Notes
These lecture notes have been developed over several semesters with the assistance of students in the course. For many (most) results, only incomplete proofs are given. Gaps in the...