CSL Communications Group Calendar

CSL Communications Group Calendar

skip to events

calendar tabs

  •  All 
  • Grid
  • Month
  • Week
  • Day
  • (Selected tab) Detail

Event Detail Information

Event Detail Information

When is a Function Securely Computable?

Speaker

Professor Prakash Narayan

Date Mar 11, 2013
Time 3:00 pm - 4:00 pm  
Location 141 Coordinated Science Lab
Sponsor CSL Communications Seminar
Contact Peggy Wells
Phone 217-244-2646
Views 683
A set of terminals that observe correlated data seek to compute a function of the data using public communication. It is required that the value of the function be not revealed by the communication. When is this possible? We show that the function is securely computable if and only if its entropy is less than the capacity of an associated secrecy generation model, for which a single-letter formula is provided. This talk is based on joint work with Himanshu Tyagi and Piyush Gupta.
link for robots only