Sciweavers

686 search results - page 15 / 138
» Secure Two-Party Computation Is Practical
Sort
View
SP
2008
IEEE
100views Security Privacy» more  SP 2008»
14 years 4 months ago
Towards Practical Privacy for Genomic Computation
Many basic tasks in computational biology involve operations on individual DNA and protein sequences. These sequences, even when anonymized, are vulnerable to re-identification a...
Somesh Jha, Louis Kruger, Vitaly Shmatikov
JIPS
2007
131views more  JIPS 2007»
13 years 9 months ago
A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations
: We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equa...
Ju-Sung Kang, Dowon Hong
EUROCRYPT
2004
Springer
14 years 1 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
POLICY
2007
Springer
14 years 3 months ago
Towards Practical Security Monitors of UML Policies for Mobile Applications
—There is increasing demand for running interacting applications in a secure and controllable way on mobile devices. Such demand is not fully supported by the Java/.NET security ...
Fabio Massacci, Katsiaryna Naliuka
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 2 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain