Sciweavers

1058 search results - page 70 / 212
» It's Doomed; We Can Prove It
Sort
View
JAIR
2006
85views more  JAIR 2006»
15 years 6 months ago
Causes of Ineradicable Spurious Predictions in Qualitative Simulation
It was recently proved that a sound and complete qualitative simulator does not exist, that is, as long as the input-output vocabulary of the state-of-the-art QSIM algorithm is us...
Özgür Yilmaz, A. C. Cem Say
FSE
2004
Springer
130views Cryptology» more  FSE 2004»
16 years 6 days ago
Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan
A cryptanalysis is given of a MAC proposal presented at CRYPTO 2003 by Cary and Venkatesan. A nice feature of the CaryVenkatesan MAC is that a lower bound on its security can be pr...
Simon R. Blackburn, Kenneth G. Paterson
ERSHOV
2003
Springer
16 years 1 days ago
On the Possibility of Provably Secure Obfuscating Programs
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
Nikolay P. Varnovsky, Vladimir A. Zakharov
DLOG
2007
15 years 9 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza
ISICT
2004
15 years 8 months ago
Preventing type flaw attacks on security protocols with a simplified tagging scheme
A type flaw attack on a security protocol is an attack where a field in a message that was originally intended to have one type is subsequently interpreted as having another type. ...
Yafen Li, Wuu Yang, Ching-Wei Huang