Sciweavers

978 search results - page 27 / 196
» Knowledge, Probability, and Adversaries
Sort
View
CSDA
2006
71views more  CSDA 2006»
14 years 9 months ago
Practical representations of incomplete probabilistic knowledge
This article deals with the compact representation of incomplete probabilistic knowledge which can be encountered in risk evaluation problems, for instance in environmental studie...
Cédric Baudrit, Didier Dubois
AI
2008
Springer
14 years 8 months ago
MEBN: A language for first-order Bayesian knowledge bases
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Kathryn B. Laskey
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca T...
INDOCRYPT
2003
Springer
15 years 2 months ago
Stronger Security Bounds for OMAC, TMAC, and XCBC
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length. In this paper, we present a more tight upper bound on Advmac for each scheme, w...
Tetsu Iwata, Kaoru Kurosawa
IJNSEC
2006
84views more  IJNSEC 2006»
14 years 9 months ago
Security on Generalized Feistel Scheme with SP Round Function
This paper studies the security against differential/linear cryptanalysis and the pseudorandomness for a class of generalized Feistel scheme with SP round function called GFSP. We ...
Wenling Wu, Wentao Zhang, Dongdai Lin