Sciweavers

570 search results - page 59 / 114
» Black-box constructions for secure computation
Sort
View
IACR
2011
212views more  IACR 2011»
12 years 7 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...
COMPSAC
2003
IEEE
14 years 1 months ago
PeAgent - A Mobile Agent System to Support Secure Internet and Web Applications
Many agent-based systems have been developed over the past decade; however, the security issues are usually not addressed adequately. In order to make the mobile agent paradigm mo...
Qingkai Ma, Wei Hao, Wei Li, Manghui Tu, I-Ling Ye...
INFOCOM
2011
IEEE
12 years 11 months ago
Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs
—We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys betwee...
Sushmita Ruj, Amiya Nayak, Ivan Stojmenovic
ICALP
2007
Springer
14 years 2 months ago
Private Locally Decodable Codes
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
Rafail Ostrovsky, Omkant Pandey, Amit Sahai
FPL
2008
Springer
153views Hardware» more  FPL 2008»
13 years 9 months ago
FPGA acceleration of quasi-Monte Carlo in finance
Today, quasi-Monte Carlo (QMC) methods are widely used in finance to price derivative securities. The QMC approach is popular because for many types of derivatives it yields an es...
Nathan A. Woods, Tom VanCourt