Sciweavers

264 search results - page 11 / 53
» Minimal-Latency Secure Function Evaluation
Sort
View
ACSAC
2009
IEEE
14 years 4 months ago
FPValidator: Validating Type Equivalence of Function Pointers on the Fly
—Validating function pointers dynamically is very useful for intrusion detection since many runtime attacks exploit function pointer vulnerabilities. Most current solutions tackl...
Hua Wang, Yao Guo, Xiangqun Chen
PODC
2004
ACM
14 years 3 months ago
Completely fair SFE and coalition-safe cheap talk
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...
PKC
2010
Springer
119views Cryptology» more  PKC 2010»
13 years 11 months ago
Efficient Set Operations in the Presence of Malicious Adversaries
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
Carmit Hazay, Kobbi Nissim
CRYPTO
2006
Springer
88views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
Let H1, H2 be two hash functions. We wish to construct a new hash function H that is collision resistant if at least one of H1 or H2 is collision resistant. Concatenating the outpu...
Dan Boneh, Xavier Boyen
CRYPTO
2008
Springer
93views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
Distributed Private Data Analysis: Simultaneously Solving How and What
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs
Amos Beimel, Kobbi Nissim, Eran Omri