Sciweavers

1923 search results - page 6 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
11 years 11 months ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
IPPS
2007
IEEE
14 years 2 months ago
Security Threat Prediction in a Local Area Network Using Statistical Model
In today’s large and complex network scenario vulnerability scanners play a major role from security perspective by proactively identifying the known security problems or vulner...
Somak Bhattacharya, S. K. Ghosh
ESORICS
2006
Springer
14 years 3 days ago
TrustedPals: Secure Multiparty Computation Implemented with Smart Cards
We study the problem of Secure Multi-party Computation (SMC) in a model where individual processes contain a tamper-proof security module, and introduce the TrustedPals framework, ...
Milan Fort, Felix C. Freiling, Lucia Draque Penso,...
ACSD
2003
IEEE
125views Hardware» more  ACSD 2003»
14 years 1 months ago
Modelling a Secure, Mobile, and Transactional System with CO-OPN
Modelling complex concurrent systems is often difficult and error-prone, in particular when new concepts coming from advanced practical applications are considered. These new appl...
Didier Buchs, Stanislav Chachkov, David Hurzeler
EUROMICRO
1999
IEEE
14 years 22 days ago
JFS: A Secure Distributed File System for Network Computers
Network-centric computing aims to solve the problems associated with traditional client/server systems, namely the high performance requirements, and costly maintenance of, the co...
Marcus O'Connell, Paddy Nixon