2687 search results - page 465 / 538 » Formal Analysis of PKCS |
163
click to vote
ISARCS
2010
15 years 10 months ago
2010
Abstract. Software designs equipped with specification of dependability techniques can help engineers to develop critical systems. In this work, we start to envision how a softwar...
160
click to vote
DBPL
2007
Springer
15 years 10 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
128
click to vote
CSFW
2010
IEEE
15 years 10 months ago
2010
IEEE
—Anonymous communication protocols must achieve two seemingly contradictory goals: privacy (informally, they must guarantee the anonymity of the parties that send/receive informa...
162
click to vote
ISSTA
2010
ACM
15 years 10 months ago
2010
ACM
Real production code contains lots of knowledge—on the domain, on the architecture, and on the environment. How can we leverage this knowledge in new projects? Using a novel lig...
170
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
In this paper, we present a framework for achieving anonymity and trust, two seemingly contradictory properties, in distributed systems. Our approach builds on webs of trust, a we...