860 search results - page 71 / 172 » Completeness in two-party secure computation: a computationa... |
151
click to vote
CRYPTO
2006
Springer
15 years 9 months ago
2006
Springer
In the last ten years, multivariate cryptography has emerged as a possible alternative to public key cryptosystems based on hard computational problems from number theory. Notably,...
150
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
156
click to vote
HPDC
2002
IEEE
15 years 11 months ago
2002
IEEE
A novel component-based, service-oriented framework for distributed metacomputing is described. Adopting a provider-centric view of resource sharing, this project emphasizes light...
169
click to vote
MSCS
2008
15 years 6 months ago
2008
Abstract. Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs c...
187
click to vote
WISEC
2010
ACM
15 years 6 months ago
2010
ACM
Data breaches due to stolen laptops are a major problem. Solutions exist to secure sensitive files on laptops, but are rarely deployed because users view them as inconvenient. Thi...