The functional dependence relation on hypergraphs of secrets
From MaRDI portal
Publication:3092291
DOI10.1007/978-3-642-22359-4_3zbMATH Open1348.68265OpenAlexW31863633MaRDI QIDQ3092291FDOQ3092291
Authors: Sara Miner More, Pavel Naumov
Publication date: 16 September 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22359-4_3
Recommendations
Applications of graph theory (05C90) Hypergraphs (05C65) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42)
Cites Work
Cited In (13)
- Symmetry in information flow
- An Independence Relation for Sets of Secrets
- Hypergraphs of multiparty secrets
- Information flow on directed acyclic graphs
- The Ryōan-ji axiom for common knowledge on hypergraphs
- Introduction to secret-sharing
- Fault tolerance in belief formation networks
- Rationally functional dependence
- An independence relation for sets of secrets
- Logic of secrets in collaboration networks
- Independence in information spaces
- Percolation in the secrecy graph
- Hypergraphs of multiparty secrets
This page was built for publication: The functional dependence relation on hypergraphs of secrets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092291)