Sciweavers

16 search results - page 3 / 4
» Decidability and Computability of Certain Torsion-Free Abeli...
Sort
View
MFCS
2010
Springer
13 years 3 months ago
A dexptime-Complete Dolev-Yao Theory with Distributive Encryption
In the context of modelling cryptographic tools like blind signatures and homomorphic encryption, the DolevYao model is typically extended with an operator over which encryption i...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh
STACS
2007
Springer
13 years 11 months ago
On the Automatic Analysis of Recursive Security Protocols with XOR
Abstract. In many security protocols, such as group protocols, principals have to perform iterative or recursive computations. We call such protocols recursive protocols. Recently,...
Ralf Küsters, Tomasz Truderung
JSYML
2010
107views more  JSYML 2010»
13 years 3 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
COMPUTER
1999
69views more  COMPUTER 1999»
13 years 5 months ago
Scientific Components Are Coming
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
Paul F. Dubois
ATAL
2007
Springer
13 years 11 months ago
Coalition formation under uncertainty: bargaining equilibria and the Bayesian core stability concept
Coalition formation is a problem of great interest in AI, allowing groups of autonomous, rational agents to form stable teams. Furthermore, the study of coalitional stability conc...
Georgios Chalkiadakis, Evangelos Markakis, Craig B...