In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
Florian Mendel, Christian Rechberger, Martin Schl&...
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
: In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability ...
Background: Finding relevant articles from PubMed is challenging because it is hard to express the user’s specific intention in the given query interface, and a keyword query ty...
Hwanjo Yu, Taehoon Kim, Jinoh Oh, Ilhwan Ko, Sungc...