Sciweavers

5476 search results - page 109 / 1096
» Resettably Secure Computation
Sort
View
117
Voted
ASIACRYPT
2005
Springer
15 years 9 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
SP
2010
IEEE
178views Security Privacy» more  SP 2010»
15 years 8 months ago
Overcoming an Untrusted Computing Base: Detecting and Removing Malicious Hardware Automatically
The computer systems security arms race between attackers and defenders has largely taken place in the domain of software systems, but as hardware complexity and design processes ...
Matthew Hicks, Murph Finnicum, Samuel T. King, Mil...
PERCOM
2006
ACM
16 years 3 months ago
Introducing History-Enriched Security Context Transfer to Enhance the Security of Subsequent Handover
Many solutions for securing inter-provider handover proposed to date make use of the concept of security context transfer. However, none of these solutions addresses problems aris...
Ulrike Meyer, Susanne Wetzel
ISW
1997
Springer
15 years 8 months ago
A Framework for the Management of Information Security
Information security is based on access control models and cryptographic techniques. These are well established areas of research in computer security, but are not capable of supp...
Jussipekka Leiwo, Yuliang Zheng
ACSW
2007
15 years 5 months ago
Securing Grid Data Using Mandatory Access Controls
The main contribution of this paper is to investigate issues in using Mandatory Access Controls (MACs), namely those provided by SELinux, to secure application-level data. Particu...
Matthew Henricksen, William J. Caelli, Peter R. Cr...