Pasar al contenido principal

Resultados relacionados

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

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.
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 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.