Developments in Secure Computing and Distributed Function Computation

The field of secure computing and distributed function computation is moving towards more efficient and secure methods for protecting data and computations. Researchers are focusing on developing new techniques for secure network function computation, distributed compression, and authentication mechanisms. One of the key areas of innovation is in the development of secure coding schemes that can protect against various types of attacks, such as masquerading attacks. Another important direction is the investigation of bounds on optimal rates for distributed computation, which can help to improve the efficiency of these systems. Notable papers include:

  • Distributed Compression for Computation and Bounds on the Optimal Rate, which establishes bounds on the optimal rate for distributed computation of arbitrary functions.
  • CAIBA: Multicast Source Authentication for CAN Through Reactive Bit Flipping, which presents a novel multicast source authentication scheme for communication buses like CAN.

Sources

Distributed Compression for Computation and Bounds on the Optimal Rate

Paths Not Taken: A Secure Computing Tutorial

Adaptive and Efficient Dynamic Memory Management for Hardware Enclaves

Tight Exponential Strong Converses for Lossy Source Coding with Side-Information and Distributed Function Computation

Security Science (SecSci), Basic Concepts and Mathematical Foundations

CAIBA: Multicast Source Authentication for CAN Through Reactive Bit Flipping

Secure Network Function Computation for Linear Functions, Part II: Target-Function Security

Built with on top of