8196 search results - page 1275 / 1640 » Computational Modeling and Complexity Science |
142
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
144
click to vote
ESORICS
2004
Springer
15 years 11 months ago
2004
Springer
d Abstract) James Aspnes , Joan Feigenbaum , Aleksandr Yampolskiy † , and Sheng Zhong ‡ Department of Computer Science, Yale University, New Haven CT 06520-8285, USA Abstract. ...
153
Voted
ICDS
2010
IEEE
15 years 11 months ago
2010
IEEE
—Learning ontology from text is a challenge in knowledge engineering research and practice. Learning relations between concepts is even more difficult work. However, when conside...
162
click to vote
LICS
2003
IEEE
15 years 11 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
168
click to vote
ICFEM
2003
Springer
15 years 11 months ago
2003
Springer
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...