86 search results - page 16 / 18 » Impossibility Results for Secret Establishment |
288
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
183
click to vote
ATAL
2007
Springer
16 years 26 days ago
2007
Springer
We develop a Belief-Desire-Intention (BDI) style agent-oriented programming language with special emphasis on the semantics of goals in the presence of the typical BDI failure han...
159
click to vote
CSR
2007
Springer
16 years 25 days ago
2007
Springer
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...
162
click to vote
ACNS
2006
Springer
16 years 20 days ago
2006
Springer
We study the influence of collision-finding attacks on the security of time-stamping schemes. We distinguish between client-side hash functions used to shorten the documents befo...
176
click to vote
EUROCRYPT
2005
Springer
16 years 6 days ago
2005
Springer
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...