Efficient Dependency Resolution in IFC-aware Decentralized Programming
summary
Prototype implements an information‑flow aware cache inside the Troupe runtime as a separate trusted thread, using SHA hash keys for dependency references and sending miss/reply messages by value to preserve confidentiality and availability. The cache thread and hashmap require only about 20 lines of code for the manager plus simple serialization hooks; hashing and closure introspection live in the TCB. A timing mitigator pads operations to 1 ms timing pad, and the prototype demonstrates the approach works end‑to‑end.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 2:15Decentralized IFC programming
- 4:41Troop language and TCB
- 6:26Prototype cache in Troop
- 9:15IFC-aware hashmap design
- 12:05Trusted computing base requirements
- 13:10Conclusion
- 13:30Q&A
related talks
11mScaling Infrastructure With Confidence in the Age of AI
18mCocoon: Static Information Flow Control in Rust
32mStatic Information Flow Control Made Simple
20mEfficient, Portable, Census-Polymorphic Choreographic Programming
01h 01mSmarter Cpp Atomic Smart Pointers - Efficient Concurrent Memory Management
52mWhy today, more then ever you need Dependency Isolation in Distributed Systems
14mSecure Caches for Compartmentalized Software
23mTileLink: A Free And Open Source, High Performance Scalable Cache Coherent Fabric Designed...