Sciweavers

121 search results - page 1 / 25
» Breaking Fully-Homomorphic-Encryption Challenges
Sort
View
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
12 years 11 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
IACR
2011
196views more  IACR 2011»
12 years 10 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs
TCC
2012
Springer
240views Cryptology» more  TCC 2012»
12 years 6 months ago
Computing on Authenticated Data
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slight...
Jae Hyun Ahn, Dan Boneh, Jan Camenisch, Susan Hohe...
ENVSOFT
2006
102views more  ENVSOFT 2006»
13 years 11 months ago
Gas exploration beyond the shelf break: An oceanographic challenge
Norway's second largest gas field, Ormen Lange, is located 140 km west off Kristiansund at an unprecedented depth when it comes to exploration. It will be the first Norwegian...
Ø. Thiem, J. Berntsen, T. Eldevik, G. Alend...
NOCS
2010
IEEE
13 years 8 months ago
Addressing Manufacturing Challenges with Cost-Efficient Fault Tolerant Routing
Abstract--The high-performance computing domain is enriching with the inclusion of Networks-on-chip (NoCs) as a key component of many-core (CMPs or MPSoCs) architectures. NoCs face...
Samuel Rodrigo, Jose Flich, Antoni Roca, Simone Me...