551 search results - page 100 / 111 » Natural proofs |
CRYPTO
2005
Springer
14 years 2 months ago
2005
Springer
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
CRYPTO
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
PATAT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Within the field of software agents, there has been increasing interest in automating the process of calendar scheduling in recent years. Calendar (or meeting) schedulin...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...