Sciweavers

340 search results - page 7 / 68
» Two-Party Computing with Encrypted Data
Sort
View
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
14 years 2 months ago
Fully homomorphic encryption using ideal lattices
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
Craig Gentry
PKC
2007
Springer
124views Cryptology» more  PKC 2007»
14 years 1 months ago
Practical and Secure Solutions for Integer Comparison
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
Juan A. Garay, Berry Schoenmakers, José Vil...
DKE
2008
98views more  DKE 2008»
13 years 7 months ago
Privacy-preserving imputation of missing data
Handling missing data is a critical step to ensuring good results in data mining. Like most data mining algorithms, existing privacy-preserving data mining algorithms assume data ...
Geetha Jagannathan, Rebecca N. Wright
CCS
2004
ACM
14 years 1 months ago
Attacking and repairing the winZip encryption scheme
WinZip is a popular compression utility for Microsoft Windows computers, the latest version of which is advertised as having “easy-to-use AES encryption to protect your sensitiv...
Tadayoshi Kohno
INFOCOM
2012
IEEE
11 years 10 months ago
Towards temporal access control in cloud computing
—Access control is one of the most important security mechanisms in cloud computing. Attribute-based access control provides a flexible approach that allows data owners to integ...
Yan Zhu, Hongxin Hu, Gail-Joon Ahn, Dijiang Huang,...