Sciweavers

36 search results - page 3 / 8
» Security Preserving Amplification of Hardness
Sort
View
WPES
2003
ACM
14 years 4 months ago
Analysis of privacy preserving random perturbation techniques: further explorations
Privacy is becoming an increasingly important issue in many data mining applications, particularly in the security and defense area. This has triggered the development of many pri...
Haimonti Dutta, Hillol Kargupta, Souptik Datta, Kr...
SIGMOD
2010
ACM
243views Database» more  SIGMOD 2010»
13 years 11 months ago
Non-homogeneous generalization in privacy preserving data publishing
Most previous research on privacy-preserving data publishing, based on the k-anonymity model, has followed the simplistic approach of homogeneously giving the same generalized val...
Wai Kit Wong, Nikos Mamoulis, David Wai-Lok Cheung
CODES
2007
IEEE
14 years 5 months ago
Secure FPGA circuits using controlled placement and routing
In current Field-Programmable-Logic Architecture (FPGA) design flows, it is very hard to control the routing of submodules. It is thus very hard to make an identical copy of an ex...
Pengyuan Yu, Patrick Schaumont
P2P
2008
IEEE
14 years 5 months ago
Peer-to-Peer Secure Multi-party Numerical Computation
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collabo...
Danny Bickson, Danny Dolev, Genia Bezman, Benny Pi...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 11 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass