Pasar al contenido principal

Resultados relacionados

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

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

Interactive VPL-based global illumination on the GPU using fuzzy clustering

  • Colom, Arnau
  • Marques, Ricardo
  • Santos, Luís Paulo
Physically-based synthesis of high quality imagery, including global illumination light transport phenomena, results in a significant workload, which makes interactive rendering a very challenging task. We propose a VPL-based ray tracing approach that runs entirely in the GPU and achieves interactive frame rates while handling global illumination light transport phenomena. This approach is based on clustering both shading points and VPLs and computing visibility only among clusters’ representatives. A new massively parallel K-means clustering algorithm, enables efficient execution in the GPU. Rendering artifacts, that could result from the piecewise constant approximation of the VPLs/shading points visibility function introduced by the clustering, are smoothed away by resorting to an innovative approach based on fuzzy clustering and weighted interpolation of the visibility function. The effectiveness of the proposed approach is experimentally verified for a collection of scenes, with frame rates larger than 3 fps and up to 25 fps being demonstrated., As Serra Húnter Fellow, Ricardo Marques acknowledges the support of the Serra Húnter Programme. This work is partially funded by TIN2018-095232-B-C21, MUSAE Horizon Europe project (#101070421) and CERCA Programme/Generalitat de Catalunya. This work is financed by National Funds through the Portuguese funding agency, FCT - Fundação para a Ciência e a Tecnologia, within project LA/P/0063/2020. Arnau Colom and Ricardo Marques acknowledge the support of the European Union’s Horizon 2020 Research and Innovation Programme under Grant Agreement No 856879 (Present Project).
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

A trust module for the interaction with virtual charachters

  • Boldrin, Luca
  • Daza, Vanesa
  • De Prisco, Roberto
  • Cortiñas Rovira, Sergi
  • Sivo, Saverio
This paper describes the architecture of a trust module for the interaction between human users and virtual characters. The module is part of a bigger project whose goal is that of creating virtual and truly realistic characters capable of interacting with human users. An example of such a virtual character is a computer rendered museum clerk that interacts with visitors. The role of the security module in the envisioned scenarios is that of providing trust, mainly regarding the identity of the human user, but also about the “identity” of the virtual character. In this paper we design (and describe the implementation) of an architecture in which human users identities are checked through face recognition and handled with verifiable credentials managed through a public blockchain. The project has been funded by the European Union and is under realization., The security module described in this paper is part of a bigger project, currently under realization, funded by H2020 from the European Commission: PRESENT - Photoreal REaltime Sentient ENTity - H2020-ICT-2018-20/H2020-ICT-2018- 3. Grant Agreement: 856879.
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Updateable inner product argument with logarithmic verifier and applications

  • Daza, Vanesa
  • Ràfols, Carla
  • Zacharakis, Alexandros
Comunicació presentada a: 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography celebrat del 4 al 7 de maig de 2020 a Edimburg, Escòcia., We propose an improvement for the inner product argument of Bootle et al. (EUROCRYPT’16). The new argument replaces the unstructured common reference string (the commitment key) by a structured one. We give two instantiations of this argument, for two different distributions of the CRS. In the designated verifier setting, this structure can be used to reduce verification from linear to logarithmic in the circuit size. The argument can be compiled to the publicly verifiable setting in asymmetric bilinear groups. The new common reference string can easily be updateable. The argument can be directly used to improve verification of Bulletproofs range proofs (IEEE SP’18). On the other hand, to use the improved argument to prove circuit satisfiability with logarithmic verification, we adapt recent techniques from Sonic (ACM CCS’19) to work with the new common reference string. The resulting argument is secure under standard assumptions (in the Random Oracle Model), in contrast with Sonic and recent works that improve its efficiency (Plonk, Marlin, AuroraLight), which, apart from the Random Oracle Model, need either the Algebraic Group Model or Knowledge Type assumptions., The project that gave rise to these results received the support of a fellowship from “la Caixa” Foundation (ID 100010434). The fellowship code is LCF/BQ/DI18/11660053. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 713673. First author was supported by Project RTI2018-102112-B-I00 (AEI/FEDER,UE) and this paper is part of a project that has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 856879.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

New privacy practices for blockchain software

  • Bellés-Muñoz, Marta
  • Baylina, Jordi
  • Daza, Vanesa
  • Muñoz-Tapia, José L.
In this article, we present the software tools we have implemented to bring complex privacy technologies closer to developers and to facilitate the implementation of privacyenabled blockchain applications., This research is supported by the Ethereum Foundation Ecosystem Support, privacy and security in blockchain (RISEBLOCK, Id: PID2019-110224RB-I00), intelligent, interoperable, integrative and deployable open source MARKETplace with trusted and secure software tools for incentivizing the industry data economy (i3-MARKET, European Commission, H2020, Id: 871754), a software architecture for rate-control over integrated satellite-terrestrial networks (ARPASAT, Id: TEC2015-70197-R), Information Security Group (ISG, Id: 2014-SGR-1504), Photoreal REaltime Sentient ENTity (PRESENT, European Commission, H2020, Id: 856879), and Técnicas avanzadas de cadenas de bloques para la internet de las cosas (Id: RTI2018-102112-B-I00).
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

ZPiE: Zero-knowledge proofs in embedded systems

  • Salleras, Xavier
  • Daza, Vanesa
Zero-Knowledge Proofs (ZKPs) are cryptographic primitives allowing a party to prove to another party that the former knows some information while keeping it secret. Such a premise can lead to the development of numerous privacy-preserving protocols in different scenarios, like proving knowledge of some credentials to a server without leaking the identity of the user. Even when the applications of ZKPs were endless, they were not exploited in the wild for a couple of decades due to the fact that computing and verifying proofs was too computationally expensive. However, the advent of efficient schemes (in particular, zk-SNARKs) made this primitive to break into the scene in fields like cryptocurrencies, smart-contracts, and more recently, self-sovereign scenarios: private-by design identity management and authentication. Nevertheless, its adoption in environments like the Internet of Things (IoT) remains unexplored due to the computational limitations of embedded systems. In this paper, we introduce ZPiE, a C library intended to create ZKP applications to be executed in embedded systems. Its main feature is portability: it can be compiled, executed, and used out-of-the-box in a wide variety of devices. Moreover, our proof-of-concept has been proved to work smoothly in different devices with limited resources, which can execute state-of-the-art ZKP authentication protocols., This research was funded by Project RTI2018-102112-B-100 (AEI/FEDER, UE) and H2020 PRESENT Grant Agreement Nº 856879.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

A perceptually-validated metric for crowd trajectory quality evaluation

  • Cabrero Daniel, Beatriz
  • Marques, Ricardo
  • Hoyet, Ludovic
  • Pettré, Julien
  • Blat, Josep
Simulating crowds requires controlling a very large number of trajectories and is usually performed using crowd motion algorithms for which appropriate parameter values need to be found. The study of the relation between parametric values for simulation techniques and the quality of the resulting trajectories has been studied either through perceptual experiments or by comparison with real crowd trajectories. In this paper, we integrate both strategies. A quality metric, QF, is proposed to abstract from reference data while capturing the most salient features that affect the perception of trajectory realism. QF weights and combines cost functions that are based on several individual, local and global properties of trajectories. These trajectory features are selected from the literature and from interviews with experts. To validate the capacity of QF to capture perceived trajectory quality, we conduct an online experiment that demonstrates the high agreement between the automatic quality score and non-expert users. To further demonstrate the usefulness of QF, we use it in a data-free parameter tuning application able to tune any parametric microscopic crowd simulation model that outputs independent trajectories for characters. The learnt parameters for the tuned crowd motion model maintain the influence of the reference data which was used to weight the terms of QF., With partial support of the EU funded project PRESENT, H2020-ICT-2018-3-856879. As Serra Húnter Fellow, Ricardo Marques acknowledges the support of the Serra Húnter Programme to this work.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

FORT: right-proving and attribute-blinding self-sovereign authentication

  • Salleras, Xavier
  • Rovira, Sergi
  • Daza, Vanesa
Nowadays, there are a plethora of services that are provided and paid for online, such as video streaming subscriptions, car-share, vehicle parking, purchasing tickets for events, etc. Online services usually issue tokens that are directly related to the identities of their users after they sign up to a platform; users need to authenticate themselves by using the same credentials each time they use the service. Likewise, when using in-person services, such as going to a concert, after paying for this service, the user usually receives a ticket, which proves that he/she has the right to use that service. In both scenarios, the main concerns surround the centralization of these systems and that they do not ensure customers’ privacy. The involved service providers are trusted third parties—authorities that offer services and handle private data about users. In this paper, we designed and implemented FORT, a decentralized system that allows customers to prove their rights to use specific services (either online or in-person) without revealing sensitive information. To achieve decentralization, we proposed a solution where all of the data are handled by a blockchain. We describe and uniquely identify users’ rights using non-fungible tokens (NFTs), and possession of these rights is demonstrated by using zero-knowledge proofs—cryptographic primitives that allow us to guarantee customers’ privacy. Furthermore, we provide benchmarks of FORT, which show that our protocol is efficient enough to be used in devices with low computing resources, such as smartphones or smartwatches, which are devices commonly used in our use case scenario, Project RTI2018-102112-B-100 (AEI/FEDER, UE) and H2020 PRESENT grant agreement no. 856879.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

A trust module for the interaction with virtual charachters

  • Boldrin, Luca
  • Daza, Vanesa
  • De Prisco, Roberto
  • Cortiñas Rovira, Sergi
  • Sivo, Saverio
This paper describes the architecture of a trust module for the interaction between human users and virtual characters. The module is part of a bigger project whose goal is that of creating virtual and truly realistic characters capable of interacting with human users. An example of such a virtual character is a computer rendered museum clerk that interacts with visitors. The role of the security module in the envisioned scenarios is that of providing trust, mainly regarding the identity of the human user, but also about the “identity” of the virtual character. In this paper we design (and describe the implementation) of an architecture in which human users identities are checked through face recognition and handled with verifiable credentials managed through a public blockchain. The project has been funded by the European Union and is under realization., The security module described in this paper is part of a bigger project, currently under realization, funded by H2020 from the European Commission: PRESENT - Photoreal REaltime Sentient ENTity - H2020-ICT-2018-20/H2020-ICT-2018- 3. Grant Agreement: 856879.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Interactive VPL-based global illumination on the GPU using fuzzy clustering

  • Colom, Arnau
  • Marques, Ricardo
  • Santos, Luís Paulo
Physically-based synthesis of high quality imagery, including global illumination light transport phenomena, results in a significant workload, which makes interactive rendering a very challenging task. We propose a VPL-based ray tracing approach that runs entirely in the GPU and achieves interactive frame rates while handling global illumination light transport phenomena. This approach is based on clustering both shading points and VPLs and computing visibility only among clusters’ representatives. A new massively parallel K-means clustering algorithm, enables efficient execution in the GPU. Rendering artifacts, that could result from the piecewise constant approximation of the VPLs/shading points visibility function introduced by the clustering, are smoothed away by resorting to an innovative approach based on fuzzy clustering and weighted interpolation of the visibility function. The effectiveness of the proposed approach is experimentally verified for a collection of scenes, with frame rates larger than 3 fps and up to 25 fps being demonstrated., As Serra Húnter Fellow, Ricardo Marques acknowledges the support of the Serra Húnter Programme. This work is partially funded by TIN2018-095232-B-C21, MUSAE Horizon Europe project (#101070421) and CERCA Programme/Generalitat de Catalunya. This work is financed by National Funds through the Portuguese funding agency, FCT - Fundação para a Ciência e a Tecnologia, within project LA/P/0063/2020. Arnau Colom and Ricardo Marques acknowledge the support of the European Union’s Horizon 2020 Research and Innovation Programme under Grant Agreement No 856879 (Present Project).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

FORT: right-proving and attribute-blinding self-sovereign authentication

  • Salleras, Xavier
  • Rovira, Sergi
  • Daza, Vanesa
Nowadays, there are a plethora of services that are provided and paid for online, such as video streaming subscriptions, car-share, vehicle parking, purchasing tickets for events, etc. Online services usually issue tokens that are directly related to the identities of their users after they sign up to a platform; users need to authenticate themselves by using the same credentials each time they use the service. Likewise, when using in-person services, such as going to a concert, after paying for this service, the user usually receives a ticket, which proves that he/she has the right to use that service. In both scenarios, the main concerns surround the centralization of these systems and that they do not ensure customers’ privacy. The involved service providers are trusted third parties—authorities that offer services and handle private data about users. In this paper, we designed and implemented FORT, a decentralized system that allows customers to prove their rights to use specific services (either online or in-person) without revealing sensitive information. To achieve decentralization, we proposed a solution where all of the data are handled by a blockchain. We describe and uniquely identify users’ rights using non-fungible tokens (NFTs), and possession of these rights is demonstrated by using zero-knowledge proofs—cryptographic primitives that allow us to guarantee customers’ privacy. Furthermore, we provide benchmarks of FORT, which show that our protocol is efficient enough to be used in devices with low computing resources, such as smartphones or smartwatches, which are devices commonly used in our use case scenario, Project RTI2018-102112-B-100 (AEI/FEDER, UE) and H2020 PRESENT grant agreement no. 856879.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

New privacy practices for blockchain software

  • Bellés-Muñoz, Marta
  • Baylina, Jordi
  • Daza, Vanesa
  • Muñoz-Tapia, José L.
In this article, we present the software tools we have implemented to bring complex privacy technologies closer to developers and to facilitate the implementation of privacyenabled blockchain applications., This research is supported by the Ethereum Foundation Ecosystem Support, privacy and security in blockchain (RISEBLOCK, Id: PID2019-110224RB-I00), intelligent, interoperable, integrative and deployable open source MARKETplace with trusted and secure software tools for incentivizing the industry data economy (i3-MARKET, European Commission, H2020, Id: 871754), a software architecture for rate-control over integrated satellite-terrestrial networks (ARPASAT, Id: TEC2015-70197-R), Information Security Group (ISG, Id: 2014-SGR-1504), Photoreal REaltime Sentient ENTity (PRESENT, European Commission, H2020, Id: 856879), and Técnicas avanzadas de cadenas de bloques para la internet de las cosas (Id: RTI2018-102112-B-I00).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

ZPiE: Zero-knowledge proofs in embedded systems

  • Salleras, Xavier
  • Daza, Vanesa
Zero-Knowledge Proofs (ZKPs) are cryptographic primitives allowing a party to prove to another party that the former knows some information while keeping it secret. Such a premise can lead to the development of numerous privacy-preserving protocols in different scenarios, like proving knowledge of some credentials to a server without leaking the identity of the user. Even when the applications of ZKPs were endless, they were not exploited in the wild for a couple of decades due to the fact that computing and verifying proofs was too computationally expensive. However, the advent of efficient schemes (in particular, zk-SNARKs) made this primitive to break into the scene in fields like cryptocurrencies, smart-contracts, and more recently, self-sovereign scenarios: private-by design identity management and authentication. Nevertheless, its adoption in environments like the Internet of Things (IoT) remains unexplored due to the computational limitations of embedded systems. In this paper, we introduce ZPiE, a C library intended to create ZKP applications to be executed in embedded systems. Its main feature is portability: it can be compiled, executed, and used out-of-the-box in a wide variety of devices. Moreover, our proof-of-concept has been proved to work smoothly in different devices with limited resources, which can execute state-of-the-art ZKP authentication protocols., This research was funded by Project RTI2018-102112-B-100 (AEI/FEDER, UE) and H2020 PRESENT Grant Agreement Nº 856879.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Updateable inner product argument with logarithmic verifier and applications

  • Daza, Vanesa
  • Ràfols, Carla
  • Zacharakis, Alexandros
Comunicació presentada a: 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography celebrat del 4 al 7 de maig de 2020 a Edimburg, Escòcia., We propose an improvement for the inner product argument of Bootle et al. (EUROCRYPT’16). The new argument replaces the unstructured common reference string (the commitment key) by a structured one. We give two instantiations of this argument, for two different distributions of the CRS. In the designated verifier setting, this structure can be used to reduce verification from linear to logarithmic in the circuit size. The argument can be compiled to the publicly verifiable setting in asymmetric bilinear groups. The new common reference string can easily be updateable. The argument can be directly used to improve verification of Bulletproofs range proofs (IEEE SP’18). On the other hand, to use the improved argument to prove circuit satisfiability with logarithmic verification, we adapt recent techniques from Sonic (ACM CCS’19) to work with the new common reference string. The resulting argument is secure under standard assumptions (in the Random Oracle Model), in contrast with Sonic and recent works that improve its efficiency (Plonk, Marlin, AuroraLight), which, apart from the Random Oracle Model, need either the Algebraic Group Model or Knowledge Type assumptions., The project that gave rise to these results received the support of a fellowship from “la Caixa” Foundation (ID 100010434). The fellowship code is LCF/BQ/DI18/11660053. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 713673. First author was supported by Project RTI2018-102112-B-I00 (AEI/FEDER,UE) and this paper is part of a project that has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 856879.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A perceptually-validated metric for crowd trajectory quality evaluation

  • Cabrero Daniel, Beatriz
  • Marques, Ricardo
  • Hoyet, Ludovic
  • Pettré, Julien
  • Blat, Josep
Simulating crowds requires controlling a very large number of trajectories and is usually performed using crowd motion algorithms for which appropriate parameter values need to be found. The study of the relation between parametric values for simulation techniques and the quality of the resulting trajectories has been studied either through perceptual experiments or by comparison with real crowd trajectories. In this paper, we integrate both strategies. A quality metric, QF, is proposed to abstract from reference data while capturing the most salient features that affect the perception of trajectory realism. QF weights and combines cost functions that are based on several individual, local and global properties of trajectories. These trajectory features are selected from the literature and from interviews with experts. To validate the capacity of QF to capture perceived trajectory quality, we conduct an online experiment that demonstrates the high agreement between the automatic quality score and non-expert users. To further demonstrate the usefulness of QF, we use it in a data-free parameter tuning application able to tune any parametric microscopic crowd simulation model that outputs independent trajectories for characters. The learnt parameters for the tuned crowd motion model maintain the influence of the reference data which was used to weight the terms of QF., With partial support of the EU funded project PRESENT, H2020-ICT-2018-3-856879. As Serra Húnter Fellow, Ricardo Marques acknowledges the support of the Serra Húnter Programme to this work.