Communication‑Efficient Secret Sharing

Technology Overview: This innovation introduces secret‑sharing codes that minimize decoding bandwidth (communication cost) when reconstructing data from distributed storage. Instead of downloading from only the minimum threshold of nodes, the scheme strategically contacts more nodes but downloads less from each, reducing total communication while preserving threshold security and reliability guarantees.

Industry Pain Point: Conventional secret‑sharing and many erasure‑coded storage systems incur high network overhead during recovery or audit, inflating latency and cloud egress costs in geo‑distributed environments.

NJIT Solution: Employ communication‑efficient secret‑sharing constructions (e.g., RS‑based designs) that achieve recovery with minimum decoding bandwidth while maintaining information‑theoretic security.

Key Features & Advantages

• Lower recovery bandwidth vs. classic schemes by spreading small downloads over more parties.
• Threshold security—unqualified subsets reveal no information about the secret.
• Improved disk I/O efficiency during decoding—beneficial for large, distributed clusters.

Development Stage: TRL 3–4 – Algorithm/prototype validation.

Target Markets

• Cloud & multi‑cloud storage platforms (object/block)
• Secure archives, regulated data retention (finance, healthcare)
• Edge/fog storage and content distribution