612 search results - page 64 / 123 » Hardness assumptions in the foundations of theoretical compu... |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We construct a stream-cipher SC whose implementation is secure even if a bounded amount of arbitrary (adaptively, adversarially chosen) information about the internal state of SC ...
AISB
2008
Springer
13 years 9 months ago
2008
Springer
According to the traditional conception of the mind, semantical content is perhaps the most important feature distinguishing mental from non-mental systems. And this traditional co...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
ADHOCNETS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Wireless sensor networks are vulnerable to the node clone attack because of low-cost, resource-constrained sensor nodes, and uncontrolled environments where they are left...
CSR
2007
Springer
14 years 2 months ago
2007
Springer
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence ...