165 search results - page 24 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
101
click to vote
TCS
2008
14 years 11 months ago
2008
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
JALC
2007
14 years 11 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
119
click to vote
IWCIA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
115
click to vote
APCSAC
2004
IEEE
15 years 3 months ago
2004
IEEE
We examine secure computing paradigms to identify any new architectural challenges for future general-purpose processors. Some essential security functions can be provided by diffe...
87
Voted
DC
2010
14 years 11 months ago
2010
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...