| 1. |
- Stokes, Klara, et al.
(författare)
-
On query self-submission in peer-to-peer user-private information retrieval
- 2011
-
Ingår i: PAIS '11 Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society. - New York, NY, USA : ACM Press. - 9781450306119
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 2. |
- Stokes, Klara, et al.
(författare)
-
Optimal configurations for peer-to-peer user-private information retrieval
- 2010
-
Ingår i: Computers and Mathematics with Applications. - : Elsevier. - 0898-1221 .- 1873-7668. ; 59:4, s. 1568-1577
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 3. |
|
|
| 4. |
- Bras-Amorós, Maria, et al.
(författare)
-
On the existence of combinatorial configurations
- 2010
-
Ingår i: 3rd International Workshop on Optimal Networks Topologies, 2010. - 9788476535653 ; , s. 145-167
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 5. |
|
|
| 6. |
|
|
| 7. |
- Bras-Amorós, Maria, et al.
(författare)
-
The semigroup of combinatorial configurations
- 2012
-
Ingår i: Semigroup Forum. - : Springer. - 0037-1912 .- 1432-2137. ; 84:1, s. 91-96
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 8. |
- Stokes, Klara, et al.
(författare)
-
Associating a numerical semigroup to the triangle-free configurations
- 2011
-
Ingår i: Advances in Mathematics of Communications. - : American Institute of Mathematical Sciences (AIMS). - 1930-5346 .- 1930-5338. ; 5:2, s. 351-371
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 9. |
|
|
| 10. |
|
|
