Computer Science – Information Theory
Scientific paper
2010-07-17
Computer Science
Information Theory
Scientific paper
A subset of a set of terminals that observe correlated signals seek to compute a given function of the signals using public communication. It is required that the value of the function be kept secret from an eavesdropper with access to the communication. We show that the function is securely computable if and only if its entropy is less than the "aided secret key" capacity of an associated secrecy generation model, for which a single-letter characterization is provided.
Gupta Piyush
Narayan Prakash
Tyagi Himanshu
No associations
LandOfFree
When is a Function Securely Computable? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with When is a Function Securely Computable?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and When is a Function Securely Computable? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-659275