An Independence Relation for Sets of Secrets

DOI10.1007/978-3-642-02261-6_24MaRDI QIDQ3638291zbMATH OpenOpenAlexFDO

Authors Sara Miner More, Pavel Naumov

Publication date 2 July 2009

Published in Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02261-6_24

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• An independence relation for sets of secrets
• Independence in information spaces
• Hypergraphs of multiparty secrets
• Concurrency semantics for the Geiger-Paz-Pearl axioms of independence
• The functional dependence relation on hypergraphs of secrets

Cites work

• A logic for information flow analysis with an application to forward slicing of simple imperative programs
• scientific article; zbMATH DE number 2127501 (Why is no real title available?)

Cited in

(12)

• Independence in information spaces
• Secrecy logic: S-secrecy structures
• Secret sets and applications
• On secret set schemes
• Information flow on directed acyclic graphs
• The functional dependence relation on hypergraphs of secrets
• Game Semantics for the Geiger-Paz-Pearl Axioms of Independence
• Hypergraphs of multiparty secrets
• Symmetry in information flow
• Hypergraphs of multiparty secrets
• Logic of secrets in collaboration networks
• An independence relation for sets of secrets

This page was built for publication: An Independence Relation for Sets of Secrets

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