Sciweavers

6861 search results - page 125 / 1373
» Security for Ubiquitous Computing
Sort
View
171
Voted
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 7 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
ACSAC
2005
IEEE
15 years 9 months ago
Looking Back at the Bell-La Padula Model
The Bell-La Padula security model produced conceptual tools for the analysis and design of secure computer systems. Together with its sibling engineering initiatives, it identifi...
David Elliott Bell
CTRSA
2008
Springer
197views Cryptology» more  CTRSA 2008»
15 years 5 months ago
Legally-Enforceable Fairness in Secure Two-Party Computation
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 computation should...
Andrew Y. Lindell
FOCS
2006
IEEE
15 years 10 months ago
Input-Indistinguishable Computation
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
Silvio Micali, Rafael Pass, Alon Rosen