liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Stokes, Klara
Publications (10 of 23) Show all publications
Stokes, K. & Bras-Amorós, M. (2014). Linear non-homogenous patterns and prime power generators in numerical semigroups associated to combinatorial configurations. Semigroup Forum, 44(1), 11-20
Open this publication in new window or tab >>Linear non-homogenous patterns and prime power generators in numerical semigroups associated to combinatorial configurations
2014 (English)In: Semigroup Forum, ISSN 0037-1912, E-ISSN 1432-2137, Vol. 44, no 1, p. 11-20Article in journal (Refereed) Published
Abstract [en]

It is proved that the numerical semigroups associated to the combinatorial configurations satisfy a family of non-linear symmetric patterns. Also, these numerical semigroups are studied for two particular classes of combinatorial configurations.

Place, publisher, year, edition, pages
Springer, 2014
Keywords
numerical semigroup, configuration, partial linear space, prime power, affine plane
National Category
Discrete Mathematics Algebra and Logic
Identifiers
urn:nbn:se:liu:diva-91454 (URN)10.1007/s00233-013-9493-8 (DOI)000330987500002 ()
Available from: 2013-04-25 Created: 2013-04-25 Last updated: 2017-12-06
Stokes, K. & Bras-Amoros, M. (2014). Patterns in semigroups associated with combinatorial configurations. In: RIEMANN AND KLEIN SURFACES, AUTOMORPHISMS, SYMMETRIES AND MODULI SPACES: . Paper presented at Conference on Riemann and Klein Surfaces, Symmetries, and Moduli Spaces (pp. 323-333). AMER MATHEMATICAL SOC, 629
Open this publication in new window or tab >>Patterns in semigroups associated with combinatorial configurations
2014 (English)In: RIEMANN AND KLEIN SURFACES, AUTOMORPHISMS, SYMMETRIES AND MODULI SPACES, AMER MATHEMATICAL SOC , 2014, Vol. 629, p. 323-333Conference paper, Published paper (Refereed)
Abstract [en]

We extend the list of known linear patterns admitted by numerical semigroups associated with combinatorial configurations. This is done through the construction of configurations from combinations of several smaller configurations. These results may be used to construct configurations with certain parameters, and therefore contribute with answers to the existence question for these configurations.

Place, publisher, year, edition, pages
AMER MATHEMATICAL SOC, 2014
Series
Contemporary Mathematics, ISSN 0271-4132
Keywords
Numerical sernigroup; pattern; combinatorial configuration; partial linear space
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:liu:diva-122678 (URN)10.1090/conm/629/12583 (DOI)000363093100022 ()978-1-4704-1093-3 (ISBN)
Conference
Conference on Riemann and Klein Surfaces, Symmetries, and Moduli Spaces
Available from: 2015-11-16 Created: 2015-11-13 Last updated: 2018-01-10
Stokes, K. & Carlsson, N. (2013). A Peer-to-Peer Agent Community for Digital Oblivion in Online Social Networks. In: Privacy, Security and Trust (PST), 2013 Eleventh Annual International Conference: . Paper presented at Eleventh Annual International Conference on Privacy, Security and Trust (PST), 10-12 July 2013, Tarragona, Spain (pp. 103-110). Institute of Electrical and Electronics Engineers (IEEE)
Open this publication in new window or tab >>A Peer-to-Peer Agent Community for Digital Oblivion in Online Social Networks
2013 (English)In: Privacy, Security and Trust (PST), 2013 Eleventh Annual International Conference, Institute of Electrical and Electronics Engineers (IEEE), 2013, p. 103-110Conference paper, Published paper (Refereed)
Abstract [en]

A long list of personal tragedies, including teenage suicides, has raised the importance of managing the personal information available on the Internet. It has been argued that it should be allowed to make mistakes, and that there should be a right to be forgotten. Unfortunately, today's Internet architecture and services typically do not support such functionality. We design a system that provides digital oblivion for users of online social networks. Participants form a peer-based agent community, which agree on protecting the privacy of individuals who request images to be forgotten. The system distributes and maintains up-to-date information on oblivion requests, and implements a filtering functionality when accessing an underlying online social network. We describe digital oblivion in terms of authentication of user-to-content relations and identify two user-to-content relations that are particularly relevant for digital oblivion. Finally, we design a family of protocols that provide digital oblivion with respect to these user-to-content relations, within the community that are implementing the protocol. Our protocols leverage a combination of digital signatures, watermarking, image tags, and trust management. No collaboration is required from the social network provider, although the system could also be incorporated as a standard feature of the social network.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2013
Keywords
Right to be forgotten; Digital oblivion
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-105283 (URN)10.1109/PST.2013.6596043 (DOI)000333820400014 ()978-1-4673-5839-2 (ISBN)
Conference
Eleventh Annual International Conference on Privacy, Security and Trust (PST), 10-12 July 2013, Tarragona, Spain
Available from: 2014-03-15 Created: 2014-03-15 Last updated: 2018-01-11Bibliographically approved
Ball, S., Bamberg, J., Devillers, A. & Stokes, K. (2013). An alternative way to generalise the pentagon. Journal of combinatorial designs (Print), 21(4), 163-179
Open this publication in new window or tab >>An alternative way to generalise the pentagon
2013 (English)In: Journal of combinatorial designs (Print), ISSN 1063-8539, E-ISSN 1520-6610, Vol. 21, no 4, p. 163-179Article in journal (Refereed) Published
Abstract [en]

We introduce the concept of a pentagonal geometry as a generalization of the pentagon and the Desargues configuration, in the same vein that the generalized polygons share the fundamental properties of ordinary polygons. In short, a pentagonal geometry is a regular partial linear space in which for all points x, the points not collinear with the point x, form a line. We compute bounds on their parameters, give some constructions, obtain some nonexistence results for seemingly feasible parameters and suggest a cryptographic application related to identifying codes of partial linear spaces.

Place, publisher, year, edition, pages
John Wiley & Sons, 2013
Keywords
generalized pentagon, generalized polygon, partial linear space, combinatorial configuration, distance regular graph
National Category
Discrete Mathematics
Identifiers
urn:nbn:se:liu:diva-91459 (URN)10.1002/jcd.21325 (DOI)
Available from: 2013-04-25 Created: 2013-04-25 Last updated: 2017-12-06
Stokes, K. (2013). Graph k-Anonymity through k-Means and as Modular Decomposition. In: SECURE IT SYSTEMS, NORDSEC 2013: . Paper presented at 18th Nordic Conference on Secure IT Systems, NordSec 2013; Ilulissat; Greenland (pp. 263-278). Springer Berlin/Heidelberg, 8208
Open this publication in new window or tab >>Graph k-Anonymity through k-Means and as Modular Decomposition
2013 (English)In: SECURE IT SYSTEMS, NORDSEC 2013, Springer Berlin/Heidelberg, 2013, Vol. 8208, p. 263-278Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we discuss k-anonymous graphs in terms of modular decomposition and we present two algorithms for the k-anonymization of graphs with respect to neighborhoods. This is the strictest definition of k-anonymity for graphs. The first algorithm is an adaptation of the k-means algorithm to neighborhood clustering in graphs. The second algorithm is distributed of message passing type, and therefore enables user-privacy: the individuals behind the vertices can jointly protect their own privacy. Although these algorithms are not optimal in terms of information loss, they are a first example of algorithms that provide k-anonymization of graphs with respect to the strictest definition, and they are simple to implement.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2013
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 8208
Keywords
k-anonymity; graph; modular decomposition; message passing; distributed algorithm; k-means; user-privacy
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:liu:diva-110507 (URN)10.1007/978-3-642-41488-6_18 (DOI)000340414300018 ()978-3-642-41487-9 (ISBN)978-3-642-41488-6 (ISBN)
Conference
18th Nordic Conference on Secure IT Systems, NordSec 2013; Ilulissat; Greenland
Available from: 2014-09-12 Created: 2014-09-12 Last updated: 2018-02-06
Torra, V., Stokes, K. & Narukawa, Y. (2012). An extension of fuzzy measures to multisets and its relation to distorted probabilities. IEEE transactions on fuzzy systems, 20(6), 1032-1045
Open this publication in new window or tab >>An extension of fuzzy measures to multisets and its relation to distorted probabilities
2012 (English)In: IEEE transactions on fuzzy systems, ISSN 1063-6706, E-ISSN 1941-0034, Vol. 20, no 6, p. 1032-1045Article in journal (Refereed) Published
Abstract [en]

Fuzzy measures are monotonic set functions on a reference set; they generalize probabilities replacing the additivity condition by monotonicity. The typical application of these measures is with fuzzy integrals. Fuzzy integrals integrate a function with respect to a fuzzy measure, and they can be used to aggregate information from a set of sources (opinions from experts or criteria in a multicriteria decision-making problem). In this context, background knowledge on the sources is represented by means of the fuzzy measures. For example, interactions between criteria are represented by means of nonadditive measures. In this paper, we introduce fuzzy measures on multisets. We propose a general definition, and we then introduce a family of fuzzy measures for multisets which we show to be equivalent to distorted probabilities when the multisets are restricted to proper sets

Place, publisher, year, edition, pages
IEEE, 2012
Keywords
prime, fuzzy measure, distorted probability, multiset
National Category
Other Mathematics
Identifiers
urn:nbn:se:liu:diva-91464 (URN)10.1109/TFUZZ.2012.2191413 (DOI)
Available from: 2013-04-25 Created: 2013-04-25 Last updated: 2017-12-06
Stokes, K. (2012). k-Anonimidad para grafos. Paper presented at XII Spanish Meeting on Cryptology and Information Security (RECSI 2012), 4-7 September 2012, Donostia-San Sebastián, Spain.
Open this publication in new window or tab >>k-Anonimidad para grafos
2012 (Spanish)Conference paper, Published paper (Other academic)
Keywords
grafo, anonimidad, privacidad en bases de datos
National Category
Computer Sciences Information Systems Discrete Mathematics
Identifiers
urn:nbn:se:liu:diva-91473 (URN)
Conference
XII Spanish Meeting on Cryptology and Information Security (RECSI 2012), 4-7 September 2012, Donostia-San Sebastián, Spain
Available from: 2013-04-25 Created: 2013-04-25 Last updated: 2018-01-11
Stokes, K. & Farràs, O. (2012). Linear spaces and transversal designs:k-anonymous combinatorial configurations for anonymous database search. Designs, Codes and Cryptography, 71(3), 503-524
Open this publication in new window or tab >>Linear spaces and transversal designs:k-anonymous combinatorial configurations for anonymous database search
2012 (English)In: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 71, no 3, p. 503-524Article in journal (Refereed) Published
Abstract [en]

Anonymous database search protocols allow users to query a database anonymously. This can be achieved by letting the users form a peer-to-peer community and post queries on behalf of each other. In this article we discuss an application of combinatorial configurations (also known as regular and uniform partial linear spaces) to a protocol for anonymous database search, as defining the key-distribution within the user community that implements the protocol. The degree of anonymity that can be provided by the protocol is determined by properties of the neighborhoods and the closed neighborhoods of the points in the combinatorial configuration that is used. Combinatorial configurations with unique neighborhoods or unique closed neighborhoods are described and we show how to attack the protocol if such configurations are used. We apply k-anonymity arguments and present the combinatorial configurations with k-anonymous neighborhoods and with k-anonymous closed neighborhoods. The transversal designs and the linear spaces are presented as optimal configurations among the configurations with k-anonymous neighborhoods and k-anonymous closed neighborhoods, respectively.

Place, publisher, year, edition, pages
Springer, 2012
Keywords
combinatorial design, anonymity, configuration, partial linear space, anonymous database search
National Category
Computer Sciences Information Systems Discrete Mathematics
Identifiers
urn:nbn:se:liu:diva-91457 (URN)10.1007/s10623-012-9745-8 (DOI)
Available from: 2013-04-25 Created: 2013-04-25 Last updated: 2018-01-11Bibliographically approved
Stokes, K. & Torra, V. (2012). Multiple releases of k-anonymous data sets and k-anonymous relational databases. International Journal of Uncertainty Fuzziness and Knowledge-Based Systems, 20(6), 839
Open this publication in new window or tab >>Multiple releases of k-anonymous data sets and k-anonymous relational databases
2012 (English)In: International Journal of Uncertainty Fuzziness and Knowledge-Based Systems, ISSN 0218-4885, Vol. 20, no 6, p. 839-Article in journal (Refereed) Published
Abstract [en]

In data privacy, the evaluation of the disclosure risk has to take into account the fact that several releases of the same or similar information about a population are common. In this paper we discuss this issue within the scope of k-anonymity. We also show how this issue is related to the publication of privacy protected databases that consist of linked tables. We present algorithms for the implementation of k-anonymity for this type of data.

Place, publisher, year, edition, pages
World Scientific Publishing, 2012
Keywords
Data privacy; disclosure risk; k-anonymity; databases
National Category
Information Systems
Identifiers
urn:nbn:se:liu:diva-91456 (URN)10.1142/S0218488512400260 (DOI)
Available from: 2013-04-25 Created: 2013-04-25 Last updated: 2018-01-11
Stokes, K. & Torra, V. (2012). n-Confusion: a generalization of k-anonymity. Paper presented at Fifth International Workshop on Privacy and Anonymity on Information Society (PAIS 2012), 30 March 2012, Berlin, Germany.
Open this publication in new window or tab >>n-Confusion: a generalization of k-anonymity
2012 (English)Conference paper, Published paper (Other academic)
National Category
Computer Sciences Information Systems
Identifiers
urn:nbn:se:liu:diva-91476 (URN)
Conference
Fifth International Workshop on Privacy and Anonymity on Information Society (PAIS 2012), 30 March 2012, Berlin, Germany
Available from: 2013-04-25 Created: 2013-04-25 Last updated: 2018-01-11
Organisations

Search in DiVA

Show all publications