Taype: A Policy-Agnostic Language for Oblivious Computation
summary
Taype provides a policy-agnostic language and a compiler that implements oblivious algebraic data types and tape semantics, translating λOADT+ concepts into a conventional language and compiling to EMP2-based crypto backends (emp2 kit / okamo libraries). Implementation includes a typechecker, section/retraction (encrypt/decrypt) hooks, and four public-view policies; evaluated on decision-tree classifiers and a secure calculator across varying tree sizes/densities, showing more permissive public views give noticeably better performance.
AI-written summary · about
chapters (11)
- 0:00Taype intro and oblivious computation
- 1:47Motivation for policy-agnostic design
- 3:52Complex privacy policy challenges
- 6:19Taype's oblivious algebraic types
- 8:29Decision tree classification example
- 11:22Privacy with tape semantics
- 12:44Performance vs privacy trade-offs
- 14:52Conclusion and benefits
- 15:12Q&A: Differences from theory
- 17:18Q&A: Multi-structure policies
- 18:48Q&A: Relation to differential privacy
related talks
12mLessons from years of building privacy-preserving technologies
50mUsing OP-TEE as a Cryptography Engine
27mDifferentially Oblivious Turing Machines
25mPolicy as Code Meets OpenTelemetry: The Next Frontier of Observability
27mHasTEE: Programming Trusted Execution Environments with Haskell
21mOP-TEE: Shared memory between TAs
21mWhen Obfuscations Preserve Cryptographic Constant-Time
45mOpen Policy Agent Deep Dive