Sciweavers

1627 search results - page 34 / 326
» High Security Smartcards
Sort
View
CAI
2007
Springer
14 years 11 months ago
On High-Rate Cryptographic Compression Functions
Abstract. The security of iterated hash functions relies on the properties of underlying compression functions. We study highly efficient compression functions based on block ciphe...
Richard Ostertág, Martin Stanek
CCS
2004
ACM
15 years 5 months ago
Lessons learned using alloy to formally specify MLS-PCA trusted security architecture
In order to solve future Multi Level Security (MLS) problems, we have developed a solution based on the DARPA Polymorphous Computing Architecture (PCA). MLS-PCA uses a novel distr...
Brant Hashii
ESORICS
1994
Springer
15 years 3 months ago
A Calculus for Secure Channel Establishment in Open Networks
This paper presents a calculus of channel security properties which allows to analyze and compare protocols for establishing secure in an insecure open network at a high level of a...
Ueli M. Maurer, Pierre E. Schmid
ACSAC
1998
IEEE
15 years 4 months ago
A Practical Approach to Measuring Assurance
1 Assurance has been defined as "the degree of confidence that security needs are satisfied"[2]. The problem with this definition is that, unless one has a way to specify...
G. F. Jelen, J. R. Williams
JOC
2010
123views more  JOC 2010»
14 years 6 months ago
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
Yonatan Aumann, Yehuda Lindell