The University of Southampton
University of Southampton Institutional Repository

The functional dependence relation on hypergraphs of secrets

The functional dependence relation on hypergraphs of secrets
The functional dependence relation on hypergraphs of secrets
The paper considers interdependencies between secrets in a multiparty system. Each secret is assumed to be known only to a certain fixed set of parties. These sets can be viewed as edges of a hypergraph whose vertices are the parties of the system. In previous work, the authors investigated properties of interdependencies that are expressible through a multi-argument relation called independence, which is a generalization of a binary relation also known as nondeducibility. This work studies properties expressible through functional dependence. The main result is a complete and decidable logical system that describes interdependencies on a fixed hypergraph.
0302-9743
29-40
Springer Berlin, Heidelberg
More, Sara Miner
979b2749-1732-4a36-abda-64b4f6899ea9
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
More, Sara Miner
979b2749-1732-4a36-abda-64b4f6899ea9
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0

More, Sara Miner and Naumov, Pavel (2011) The functional dependence relation on hypergraphs of secrets. In Computational Logic in Multi-Agent Systems - 12th International Workshop, CLIMA XII, Proceedings. vol. 6814 LNAI, Springer Berlin, Heidelberg. pp. 29-40 . (doi:10.1007/978-3-642-22359-4_3).

Record type: Conference or Workshop Item (Paper)

Abstract

The paper considers interdependencies between secrets in a multiparty system. Each secret is assumed to be known only to a certain fixed set of parties. These sets can be viewed as edges of a hypergraph whose vertices are the parties of the system. In previous work, the authors investigated properties of interdependencies that are expressible through a multi-argument relation called independence, which is a generalization of a binary relation also known as nondeducibility. This work studies properties expressible through functional dependence. The main result is a complete and decidable logical system that describes interdependencies on a fixed hypergraph.

This record has no associated files available for download.

More information

Published date: 18 July 2011
Venue - Dates: 12th International Workshop on Computational Logic in Multi-Agent Systems, CLIMA XII, Co-located with the 22nd International Joint Conference on Artificial Intelligence, , Barcelona, Spain, 2010-07-17 - 2010-07-18

Identifiers

Local EPrints ID: 475867
URI: http://eprints.soton.ac.uk/id/eprint/475867
ISSN: 0302-9743
PURE UUID: ca3f8b98-645a-4dcf-b596-35496e58ce32
ORCID for Pavel Naumov: ORCID iD orcid.org/0000-0003-1687-045X

Catalogue record

Date deposited: 29 Mar 2023 16:46
Last modified: 06 Jun 2024 02:12

Export record

Altmetrics

Contributors

Author: Sara Miner More
Author: Pavel Naumov ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×