756 search results - page 105 / 152 » Modeling Computational Security in Long-Lived Systems |
FOSSACS
2005
Springer
14 years 3 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
ACISP
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
MOBILITY
2009
ACM
14 years 2 months ago
2009
ACM
Main requirement of recent computing environments, like mobile and then ubiquitous computing, is to adapt applications to context. On the other hand, access control generally trus...
AINA
2009
IEEE
14 years 3 months ago
2009
IEEE
—The paper first discusses motivations why taking into account location information in authentication and access control is important. The paper then surveys current approaches t...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...