80 search results - page 6 / 16 » General Secure Multi-party Computation from any Linear Secre... |
CCS
2008
ACM
13 years 8 months ago
2008
ACM
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
COMCOM
2008
13 years 6 months ago
2008
People enjoy the convenience of on-line services, Automated Teller Machines (ATMs), and pervasive computing, but online environments, ATMs, and pervasive computing may bring many r...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver n packets from s...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
—People enjoy the convenience of on-line services, but online environments may bring many risks. In this paper, we discuss how to prevent users’ passwords from being stolen by ...
ASIACRYPT
2007
Springer
14 years 27 days ago
2007
Springer
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...