1923 search results - page 27 / 385 » Modeling Complexity in Secure Distributed Computing |
VLDB
2006
ACM
14 years 8 months ago
2006
ACM
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous...
MOBIQUITOUS
2005
IEEE
14 years 2 months ago
2005
IEEE
A significant deterrent to the ability to connect in a spontaneous manner in cross-enterprise collaborative applications is the difficulty in users from different domains being ab...
IPCCC
2005
IEEE
14 years 2 months ago
2005
IEEE
The Double Authentication (DA) scheme presented in [1] is designed to provide security against impersonation attack to link state routing protocol at a lower computational cost as...
CCS
2010
ACM
13 years 8 months ago
2010
ACM
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...
EDOC
2004
IEEE
2004
IEEE
Security Patterns: A Method for Constructing Secure and Efficient Inter-Company Coordination Systems
14 years 6 days ago
As the Internet, intranets and other wide-area open networks grow, novel techniques for building distributed systems, notably mobile agents, are attracting increasing attention. T...