Sciweavers

3228 search results - page 618 / 646
» Computationally Sound Proofs
Sort
View
STACS
2001
Springer
14 years 1 months ago
A Toolkit for First Order Extensions of Monadic Games
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
David Janin, Jerzy Marcinkowski
ECOOPW
1999
Springer
14 years 28 days ago
The Role of Trust Management in Distributed Systems Security
Existing authorization mechanisms fail to provide powerful and robust tools for handling security at the scale necessary for today's Internet. These mechanisms are coming unde...
Matt Blaze, Joan Feigenbaum, Angelos D. Keromytis
ICS
2010
Tsinghua U.
14 years 22 days ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 22 days ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
ACISP
2006
Springer
14 years 12 days ago
Online/Offline Signatures and Multisignatures for AODV and DSR Routing Security
Efficient authentication is one of important security requirements in mobile ad hoc network (MANET) routing systems. The techniques of digital signatures are generally considered a...
Shidi Xu, Yi Mu, Willy Susilo