522 search results - page 56 / 105 » On the Hardness of the Noncommutative Determinant |
CTRSA
2011
Springer
12 years 11 months ago
2011
Springer
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
Although graphical user interfaces (GUIs) constitute a large part of the software being developed today and are typically created using rapid prototyping, there are no effective r...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...