Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 10
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Trustworthy privacy-preserving car-generated announcements in vehicular ad hoc networks

  • Daza, Vanesa
  • Domingo-Ferrer, Josep
  • Sebe, Francesc
  • Viejo, Alexandre
Vehicular ad hoc networks (VANETs) allow vehicle-to-vehicle communication and, in particular, vehicle-generated announcements. Provided that the trustworthiness of such announcements can be guaranteed, they can greatly increase the safety of driving. A new system for vehicle-generated announcements is presented that is secure against external and internal attackers attempting to send fake messages. Internal attacks are thwarted by using an endorsement mechanism based on threshold signatures. Our system outperforms previous proposals in message length and computational cost. Three different privacy-preserving variants of the system are also described to ensure that vehicles volunteering to generate and/or endorse trustworthy announcements do not have to sacrifice their privacy., This work was partly supported by the Spanish Government through projects TSI2007-65406-C03-01 ”E-AEGIS” and CONSOLIDER INGENIO 2010 CSD2007- 00004 ”ARES”, and by the Government of Catalonia under grant 2005 SGR 00446.
Repositori Obert UdL
Publicación Artículo científico (JournalArticle)

Design of a P2P network that protects users’ privacy in front of Web Search Engines

  • Romero-Tris, Cristina
  • Castellà Martínez, Damià
  • Viejo Galicia, Alexandre
  • Castellà Roca, Jordi
  • Solsona Tehàs, Francesc
  • Mateo-Sanz, Josep María
Web Search Engines store and analyze queries made by their users in order to build their profiles and offer them personalized search results (i.e., results are ranked according to each user’s preferences). Even though this service is positive for the users, their profiles may contain sensitive information that can threaten their privacy. Literature in this field stresses the existence of a trade-off between the level of privacy achieved and the quality of service received. Current proposals try to maximize this trade-off, yet we argue that there is still room for improvement. In this paper, we present a new approach which improves the trade-off by grouping users who share similar profiles. Moreover, our new proposal is based on a hybrid P2P architecture that outperforms current schemes in terms of scalability. The proposed system has been tested in terms of performance and privacy achieved, using real data from the AOL dataset. Simulation results show that: (i) the system protects users’ privacy when they behave honestly, and penalizes selfish users; (ii) it supports a large number of users; (iii) the runtime required to group users is affordable; and (iv) groups are dynamic and their topology is unpredictable, which we argue that is positive from the privacy point of view., This work was partly supported by the Spanish Ministry of Science and Innovation (through Projects eAEGIS TSI2007-65406-C03-01, CO-PRIVACY TIN2011-27076- C03-01, ARES-CONSOLIDER INGENIO 2010 CSD2007-00004, Audit Transparency Voting Process IPT-430000-2010-31 and Ballot Next IPT-2012-0603-430000) and by the Government of Catalonia (under Grant 2009 SGR 1135). Francesc Solsona and Damià Castellà are funded by the MEyC under Contract TIN2011-28689-C02-02. Francesc Solsona is a member of the research group 2009 SGR145, funded by Government of Catalonia.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Trustworthy privacy-preserving car-generated announcements in vehicular ad hoc networks

  • Daza, Vanesa
  • Domingo-Ferrer, Josep
  • Sebe, Francesc
  • Viejo, Alexandre
Vehicular ad hoc networks (VANETs) allow vehicle-to-vehicle communication and, in particular, vehicle-generated announcements. Provided that the trustworthiness of such announcements can be guaranteed, they can greatly increase the safety of driving. A new system for vehicle-generated announcements is presented that is secure against external and internal attackers attempting to send fake messages. Internal attacks are thwarted by using an endorsement mechanism based on threshold signatures. Our system outperforms previous proposals in message length and computational cost. Three different privacy-preserving variants of the system are also described to ensure that vehicles volunteering to generate and/or endorse trustworthy announcements do not have to sacrifice their privacy., This work was partly supported by the Spanish Government through projects TSI2007-65406-C03-01 ”E-AEGIS” and CONSOLIDER INGENIO 2010 CSD2007- 00004 ”ARES”, and by the Government of Catalonia under grant 2005 SGR 00446.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Design of a P2P network that protects users’ privacy in front of Web Search Engines

  • Romero-Tris, Cristina
  • Castellà Martínez, Damià
  • Viejo Galicia, Alexandre
  • Castellà Roca, Jordi
  • Solsona Tehàs, Francesc
  • Mateo-Sanz, Josep María
Web Search Engines store and analyze queries made by their users in order to build their profiles and offer them personalized search results (i.e., results are ranked according to each user’s preferences). Even though this service is positive for the users, their profiles may contain sensitive information that can threaten their privacy. Literature in this field stresses the existence of a trade-off between the level of privacy achieved and the quality of service received. Current proposals try to maximize this trade-off, yet we argue that there is still room for improvement. In this paper, we present a new approach which improves the trade-off by grouping users who share similar profiles. Moreover, our new proposal is based on a hybrid P2P architecture that outperforms current schemes in terms of scalability. The proposed system has been tested in terms of performance and privacy achieved, using real data from the AOL dataset. Simulation results show that: (i) the system protects users’ privacy when they behave honestly, and penalizes selfish users; (ii) it supports a large number of users; (iii) the runtime required to group users is affordable; and (iv) groups are dynamic and their topology is unpredictable, which we argue that is positive from the privacy point of view., This work was partly supported by the Spanish Ministry of Science and Innovation (through Projects eAEGIS TSI2007-65406-C03-01, CO-PRIVACY TIN2011-27076- C03-01, ARES-CONSOLIDER INGENIO 2010 CSD2007-00004, Audit Transparency Voting Process IPT-430000-2010-31 and Ballot Next IPT-2012-0603-430000) and by the Government of Catalonia (under Grant 2009 SGR 1135). Francesc Solsona and Damià Castellà are funded by the MEyC under Contract TIN2011-28689-C02-02. Francesc Solsona is a member of the research group 2009 SGR145, funded by Government of Catalonia.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Planar vector fields with a given set of orbits

  • Llibre, Jaume|||0000-0002-9511-5999
  • Ramírez, Rafael Orlando|||0000-0002-4958-0291
  • Sadovskaia, Natalia
We determine all the C 1 planar vector fields with a given set of orbits of the form y - y(x) = 0 satisfying convenient assumptions. The case when these orbits are branches of an algebraic curve is also study. We show that if a quadratic vector field admits a unique irreducible invariant algebraic curve g(x, y) = S∑j=0 aj (x)y S-j = 0 with S branches with respect to the variable y, then the degree of the polynomial g is at most 4S.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

The 16th Hilbert problem restricted to circular algebraic limit cycles

  • Llibre, Jaume|||0000-0002-9511-5999
  • Ramírez, Rafael Orlando|||0000-0002-4958-0291
  • Ramírez, Valentín
  • Sadovskaia, Natalia
We prove the following two results. First every planar polynomial vector field of degree S with S invariant circles is Darboux integrable without limit cycles. Second a planar polynomial vector field of degree S admits at most S - 1 invariant circles which are algebraic limit cycles. In particular we solve the 16th Hilbert problem restricted to algebraic limit cycles given by circles, because a planar polynomial vector field of degree S has at most S - 1 algebraic limit cycles given by circles, and this number is reached.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

An inverse approach to the center problem

  • Llibre, Jaume|||0000-0002-9511-5999
  • Ramírez, Rafael Orlando|||0000-0002-4958-0291
  • Ramírez, Valentín
We consider analytic or polynomial vector fields of the form X=(-y+X)∂∂x+(x+Y)∂∂y, where X= X(x, y)) and Y= Y(x, y)) start at least with terms of second order. It is well-known that X has a center at the origin if and only if X has a Liapunov-Poincaré local analytic first integral of the form H=12(x2+y2)+∑j=3∞Hj, where H = H (x, y) is a homogenous polynomial of degree j. The classical center-focus problem already studied by Poincaré consists in distinguishing when the origin of X is either a center or a focus. In this paper we study the inverse center problem, i.e. for a given analytic function H of the previous form defined in a neighborhood of the origin, we determine the analytic or polynomial vector field X for which H is a first integral. Moreover, given an analytic function V=1+∑j=1∞Vj in a neighborhood of the origin, where V is a homogenous polynomial of degree j, we determine the analytic or polynomial vector field X for which V is a Reeb inverse integrating factor. We study the particular case of centers which have a local analytic first integral of the form H=12(x2+y2)(1+∑j=1∞Υj), in a neighborhood of the origin, where Υ is a homogenous polynomial of degree j for j≥ 1. These centers are called weak centers, they contain the uniform isochronous centers and the isochronous holomorphic centers, but they do not coincide with the class of isochronous centers. We have characterized the expression of an analytic or polynomial differential system having a weak center at the origin We extended to analytic or polynomial differential systems the weak conditions of a center given by Alwash and Lloyd for linear centers with homogeneous polynomial nonlinearities. Furthermore the centers satisfying these weak conditions are weak centers.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Center problem for Λ-Ω differential systems

  • Llibre, Jaume|||0000-0002-9511-5999
  • Ramírez, Rafael Orlando|||0000-0002-4958-0291
  • Ramírez, Valentín
The Λ-Ω systems are the real planar polynomial differential equations of degree m x˙=-y(1+Λ)+xΩ,y˙=x(1+Λ)+yΩ, where Λ=Λ(x,y) and Ω=Ω(x,y) are polynomials of degree at most m-1 such that Λ(0,0)=Ω(0,0)=0. We study the center problem for these Λ-Ω systems. Any planar vector field with linear type center can be written as a Λ-Ω system if and only if the Poincaré-Liapunov first integral is of the form F= [Formula presented] (x+y)(1+O(x,y)). These kind of linear type centers are called weak centers, they contain the class of centers studied by Alwash and Lloyd [1], and also contain the uniform isochronous centers, and the holomorphic isochronous centers, but they do not coincide with the all class of isochronous centers. The main objective of this paper is to study the center problem for two particular classes of Λ-Ω systems of degree m. First if Λ=μ(ax-ay), and Ω=ax+ay+Ω, where μ,a,a are constants and Ω=Ω(x,y) is a homogenous polynomial of degree m-1, then we prove the following results. (i) These Λ-Ω systems have a weak center at the origin if and only if (μ+m-2)(a +a )=0, and ∫02πΩ(cos⁡t,sin⁡t)dt=0; (ii) If m=2,3,4,5,6 and (μ+m-2)(a +a )≠0, then the given Λ-Ω systems have a weak center at the origin if and only if these systems after a linear change of variables (x,y)⟶(X,Y) are invariant under the transformations (X,Y,t)⟶(-X,Y,-t). Second if Λ=ax+ay, and Ω=Ω, where a,a are constants and Ω=Ω(x,y) is a homogenous polynomial of degree m-1, then we prove the following results. (i) These Λ-Ω systems have a weak center at the origin if and only if a=a=0, and ∫02πΩ(cos⁡t,sin⁡t)dt=0; (ii) If m=2,3,4,5 and a +a ≠0, then the given Λ-Ω systems have a weak center at the origin if and only if these systems after a linear change of variables (x,y)⟶(X,Y) are invariant under the transformations (X,Y,t)⟶(-X,Y,-t). We observe that the main difficulty to prove results (ii) for m>6 is related with the huge computations necessary for proving them.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Center problem for generalized Λ-Ω differential systems

  • Llibre, Jaume|||0000-0002-9511-5999
  • Ramírez, Rafael Orlando|||0000-0002-4958-0291
  • Ramírez, Valentín
The Λ-Ω differential systems are the real planar polynomial differential equations of degree m of the form ˙ x = -y(1 + Λ) + xΩ, ˙ y = x(1 + Λ) + yΩ, where Λ = Λ(x,y) and Ω = Ω(x,y) are polynomials of degree at most m-1 such that Λ(0,0) = Ω(0,0) = 0. We study the center problem for these Λ-Ω systems. A planar vector field with linear type center can be written as an Λ-Ω system if and only if the Poincaré-Liapunov first integral is of the form F = 1 2 (x2 + y2)(1 + O(x,y)). The main objective of this paper is to study the center problem for Λ-Ω systems of degree m with Λ = µ(a2x - a1y), and Ω = a1x + a2y + m-1 ∑ j=2 Ωj, where µ, a1, a2 are constants and Ωj = Ωj(x,y) is a homogenous polynomial of degree j, for j = 2,...,m-1. We prove the following results. Assuming that m = 2,3,4,5 and (µ + (m-2))(a2 1 + a2 2) ̸= 0 and m-2 ∑ j=2 Ωj ̸= 0 then the Λ-Ω system has a weak center at the origin if and only if these systems after a linear change of variables (x,y) -→ (X,Y ) are invariant under the transformations (X,Y,t) -→ (-X,Y,-t). If (µ + (m-2))(a2 1 + a2 2) = 0 and m-2 ∑ j=1 Ωj = 0 then the origin is a weak center. We observe that the main difficulty to prove this result for m.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Integrability by separation of variables