Sciweavers

469 search results - page 55 / 94
» On Adversary Models and Compositional Security
Sort
View
ISADS
1999
IEEE
13 years 12 months ago
A Secure Key Registration System based on Proactive Secret-Sharing Scheme
We designed a secure key registration system based on the proactive secret-sharing scheme. A user can register important data such as a session key to a distributed system in a (t...
Masayuki Numao
COMPLEXITY
2007
151views more  COMPLEXITY 2007»
13 years 7 months ago
From complex conflicts to stable cooperation: Cases in environment and security
: Conflict is a dynamic and complex form of human interaction, often emerging from incompatible actions, values and goals, and consuming a considerable amount of resources. Conflic...
Jürgen Scheffran, Bruce Hannon
NDSS
2008
IEEE
14 years 2 months ago
A New Privacy-Enhanced Matchmaking Protocol
Although several wide-spread internet applications (e.g., job-referral services, dating services) can benefit from online matchmaking, protocols defined over the past two decade...
Ji Sun Shin, Virgil D. Gligor
CSFW
2012
IEEE
11 years 10 months ago
Measuring Information Leakage Using Generalized Gain Functions
Abstract—This paper introduces g-leakage, a rich generalization of the min-entropy model of quantitative information flow. In g-leakage, the benefit that an adversary derives f...
Mário S. Alvim, Konstantinos Chatzikokolaki...
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
12 years 7 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...