Synthesis with privacy against an observer

DOI10.1007/978-3-031-57228-9_13MaRDI QIDQ6629463FDOQ6629463

Ofer Leshkowitz, Orna Kupferman, Naama Shamash Halevy

Publication date: 30 October 2024

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites Work

• The temporal semantics of concurrent programs
• Algorithms for Omega-Regular Games with Imperfect Information
• The complexity of two-player games of incomplete information
• Reasoning about infinite computations
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Bounded Synthesis
• Supervisory Control for Opacity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Open Implication
• Synthesis of obfuscation policies to ensure privacy and utility
• Title not available (Why is that?)
• From linear time to branching time
• On the (im)possibility of obfuscating programs
• Synthesis from LTL Specifications with Mean-Payoff Objectives
• Graph Games and Reactive Synthesis
• Title not available (Why is that?)
• Deciding parity games in quasipolynomial time
• Energy Parity Games
• Synthesis from hyperproperties
• Why These Automata Types?
• Title not available (Why is that?)
• Synthesis of privacy-preserving systems

This page was built for publication: Synthesis with privacy against an observer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629463)