liu.seSök publikationer i DiVA
Ändra sökning
Avgränsa sökresultatet
1 - 23 av 23
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Ball, Simeon
    et al.
    Universitat Politècnica de Catalunya, Barcelona, Spain.
    Bamberg, John
    The University of Western Australia, Crawley, WA, Australia.
    Devillers, Alice
    The University of Western Australia, Crawley, WA, Australia.
    Stokes, Klara
    Universitat Rovira i Virgili, Tarragona, Spain.
    An alternative way to generalise the pentagon2013Ingår i: Journal of combinatorial designs (Print), ISSN 1063-8539, E-ISSN 1520-6610, Vol. 21, nr 4, s. 163-179Artikel i tidskrift (Refereegranskat)
    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.

  • 2.
    Bras-Amorós, Maria
    et al.
    Universitat Rovira i Virgili, Catalonia, Spain.
    Domingo-Ferrer, Josep
    Universitat Rovira i Virgili, Catalonia, Spain.
    Stokes, Klara
    Universitat Rovira i Virgili, Catalonia, Spain.
    Configuraciones combinatóricas y recuperación privada de información por pares2009Konferensbidrag (Övrigt vetenskapligt)
  • 3.
    Bras-Amorós, Maria
    et al.
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain.
    Stokes, Klara
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain.
    On the existence of combinatorial configurations2010Ingår i: 3rd International Workshop on Optimal Networks Topologies, 2010, 2010, s. 145-167Konferensbidrag (Övrigt vetenskapligt)
  • 4.
    Bras-Amorós, Maria
    et al.
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain .
    Stokes, Klara
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain .
    The semigroup of combinatorial configurations2012Ingår i: Semigroup Forum, ISSN 0037-1912, E-ISSN 1432-2137, Vol. 84, nr 1, s. 91-96Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We elaborate on the existence and construction of the so-called combinatorial configurations. The main result is that for fixed degrees the existence of such configurations is given by a numerical semigroup. The proof is constructive giving a method to obtain combinatorial configurations with parameters large enough.

  • 5.
    Bras-Amorós, Maria
    et al.
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain.
    Stokes, Klara
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain.
    Greferath, Marcus
    University College Dublin, Ireland.
    Problems related to combinatorial configurations with applications to P2P-user private information retrieval2010Konferensbidrag (Övrigt vetenskapligt)
  • 6.
    Stokes, Klara
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Graph k-Anonymity through k-Means and as Modular Decomposition2013Ingår i: SECURE IT SYSTEMS, NORDSEC 2013, Springer Berlin/Heidelberg, 2013, Vol. 8208, s. 263-278Konferensbidrag (Refereegranskat)
    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.

  • 7.
    Stokes, Klara
    Universitat Rovira i Virgili, Catalonia, Spain.
    k-Anonimidad para grafos2012Konferensbidrag (Övrigt vetenskapligt)
  • 8.
    Stokes, Klara
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain .
    Numerical semigroups from combinatorial configurations2012Konferensbidrag (Övrigt vetenskapligt)
  • 9.
    Stokes, Klara
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Bras-Amoros, Maria
    University of Rovira and Virgili, Spain.
    Patterns in semigroups associated with combinatorial configurations2014Ingår i: RIEMANN AND KLEIN SURFACES, AUTOMORPHISMS, SYMMETRIES AND MODULI SPACES, AMER MATHEMATICAL SOC , 2014, Vol. 629, s. 323-333Konferensbidrag (Refereegranskat)
    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.

  • 10.
    Stokes, Klara
    et al.
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain.
    Bras-Amorós, Maria
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain.
    Associating a numerical semigroup to the triangle-free configurations2011Ingår i: Advances in Mathematics of Communications, ISSN 1930-5346, E-ISSN 1930-5338, Vol. 5, nr 2, s. 351-371Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    It is proved that a numerical semigroup can be associated to the triangle-free -configurations, and some results on existence are deduced. For example it is proved that for any there exists infinitely many -configurations. Most proofs are given from a graph theoretical point of view, in the sense that the configurations are represented by their incidence graphs. An application to private information retrieval is described.

  • 11.
    Stokes, Klara
    et al.
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain.
    Bras-Amorós, Maria
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain.
    Combinatorial structures for an anonymous database search protocol2011Konferensbidrag (Övrigt vetenskapligt)
  • 12.
    Stokes, Klara
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Bras-Amorós, Maria
    Universitat Rovira i Virgili, Spain.
    Linear non-homogenous patterns and prime power generators in numerical semigroups associated to combinatorial configurations2014Ingår i: Semigroup Forum, ISSN 0037-1912, E-ISSN 1432-2137, Vol. 44, nr 1, s. 11-20Artikel i tidskrift (Refereegranskat)
    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.

  • 13.
    Stokes, Klara
    et al.
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain.
    Bras-Amorós, Maria
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain.
    On query self-submission in peer-to-peer user-private information retrieval2011Ingår i: PAIS '11 Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society, ACM Press, 2011Konferensbidrag (Refereegranskat)
    Abstract [en]

    User-private information retrieval (UPIR) is the art of retrieving information without telling the information holder who you are. UPIR is sometimes called anonymous keyword search. This article discusses a UPIR protocol in which the users form a peer-to-peer network over which they collaborate in protecting the privacy of each other. The protocol is known as P2P UPIR. It will be explained why the P2P UPIR protocol may have a flaw in the protection of the privacy of the client in front of the server. Two alternative variations of the protocols are discussed. One of these will prove to resolve the privacy flaw discovered in the original protocol. Hence the aim of this article is to propose a modification of the P2P UPIR protocol. It is justified why the projective planes are still the optimal configurations for P2P UPIR for the modified protocol.

  • 14.
    Stokes, Klara
    et al.
    Universitat Rovira i Virgili, Catalonia, Spain.
    Bras-Amorós, Maria
    Universitat Rovira i Virgili, Catalonia, Spain.
    Optimal configurations for peer-to-peer user-private information retrieval2010Ingår i: Computers and Mathematics with Applications, ISSN 0898-1221, E-ISSN 1873-7668, Vol. 59, nr 4, s. 1568-1577Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    User-private information retrieval systems should protect the user’s anonymity when performing queries against a database, or they should limit the servers capacity of profiling users. Peer-to-peer user-private information retrieval (P2P UPIR) supplies a practical solution: the users in a group help each other in doing their queries, thereby preserving their privacy without any need of the database to cooperate. One way to implement the P2P UPIR uses combinatoric configurations to administrate the keys needed for the private communication between the peers.

    This article is devoted to the choice of the configuration in this system. First of all we characterize the optimal configurations for the P2P UPIR and see the relationship with the projective planes as described in finite geometry. Then we give a very efficient construction of such optimal configurations, i.e. finite projective planes. We finally check that the involved graphs are Ramanujan graphs, giving an additional justification of the optimality of the constructed configurations.

  • 15.
    Stokes, Klara
    et al.
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain .
    Bras-Amorós, Maria
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain .
    The semigroup of combinatorial configurations2010Konferensbidrag (Övrigt vetenskapligt)
  • 16.
    Stokes, Klara
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    A Peer-to-Peer Agent Community for Digital Oblivion in Online Social Networks2013Ingår i: Privacy, Security and Trust (PST), 2013 Eleventh Annual International Conference, Institute of Electrical and Electronics Engineers (IEEE), 2013, s. 103-110Konferensbidrag (Refereegranskat)
    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.

  • 17.
    Stokes, Klara
    et al.
    Universitat Rovira i Virgili, Spain.
    Farràs, Oriol
    Universitat Rovira i Virgili, Spain.
    Linear spaces and transversal designs:k-anonymous combinatorial configurations for anonymous database search2012Ingår i: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 71, nr 3, s. 503-524Artikel i tidskrift (Refereegranskat)
    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.

  • 18.
    Stokes, Klara
    et al.
    Universitat Oberta de Catalunya, Barcelona, Spain.
    Torra, Vicenç
    Consejo Superior de Investigaciones Científicas (CSIC), Spain.
    Multiple releases of k-anonymous data sets and k-anonymous relational databases2012Ingår i: International Journal of Uncertainty Fuzziness and Knowledge-Based Systems, ISSN 0218-4885, Vol. 20, nr 6, s. 839-Artikel i tidskrift (Refereegranskat)
    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.

  • 19.
    Stokes, Klara
    et al.
    Universitat Rovira i Virgili, Tarragona, Spain.
    Torra, Vicenç
    Universitat Aut`onoma de Barcelona, Spain.
    n-Confusion: a generalization of k-anonymity2012Konferensbidrag (Övrigt vetenskapligt)
  • 20.
    Stokes, Klara
    et al.
    Universitat Rovira i Virgili, Tarragona, Spain.
    Torra, Vicenç
    Universitat Aut`onoma de Barcelona, Spain.
    On some clustering approaches for graphs2011Ingår i: Fuzzy Systems (FUZZ), 2011, IEEE , 2011, s. 409-415Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper we discuss some tools for graph perturbation with applications to data privacy. We present and analyse two different approaches. One is based on matrix decomposition and the other on graph partitioning. We discuss these methods and show that they belong to two traditions in data protection: noise addition/microaggregation and k-anonymity.

  • 21.
    Stokes, Klara
    et al.
    Universitat Rovira i Virgili, Tarragona, Spain.
    Torra, Vicenç
    Universitat Aut`onoma de Barcelona, Spain.
    On the Relationship Between Clustering and Coding Theory2012Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper we discuss the relations between clustering and error correcting codes. We show that clustering can be used for constructing error correcting codes. We review the previous works found in the literature about this issue, and propose a modification of a previous work that can be used for code construction from a set of proposed codewords.

  • 22.
    Stokes, Klara
    et al.
    Universitat Rovira i Virgili, Tarragona, Catalonia, Spain .
    Torra, Vicenç
    IIIA, Institut d’Investigació en Intel ligència Artificial CSIC, Bellaterra, Catalonia, Spain .
    Reidentification and k-anonymity: a model for disclosure risk in graphs2012Ingår i: Soft Computing - A Fusion of Foundations, Methodologies and Applications, ISSN 1432-7643, E-ISSN 1433-7479, Vol. 16, nr 10, s. 1657-1670Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this article we provide a formal framework for reidentification in general. We define n-confusion as a concept for modeling the anonymity of a database table and we prove that n-confusion is a generalization of k-anonymity. After a short survey on the different available definitions of k-anonymity for graphs we provide a new definition for k-anonymous graph, which we consider to be the correct definition. We provide a description of the k-anonymous graphs, both for the regular and the non-regular case. We also introduce the more flexible concept of (k, l)-anonymous graph. Our definition of (k, l)-anonymous graph is meant to replace a previous definition of (k, l)-anonymous graph, which we here prove to have severe weaknesses. Finally, we provide a set of algorithms for k-anonymization of graphs.

  • 23.
    Torra, Vicenç
    et al.
    Universitat Aut`onoma de Barcelona, Spain.
    Stokes, Klara
    Universitat Rovira i Virgili, Tarragona, Spain.
    Narukawa, Yasuo
    Toho Gakuen, Tokyo, Japan.
    An extension of fuzzy measures to multisets and its relation to distorted probabilities2012Ingår i: IEEE transactions on fuzzy systems, ISSN 1063-6706, E-ISSN 1941-0034, Vol. 20, nr 6, s. 1032-1045Artikel i tidskrift (Refereegranskat)
    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

1 - 23 av 23
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf