Alonso González
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Alonso González has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Carla Ràfols
Universitat Pompeu Fabra
2 shared publications Alejandro Hevia
Universidad de Chile
1 shared publication- Alejandro Hevia
University of Chile
1 shared publication
Latest Publications
- 1 February 2018
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 28 (2) , 141-154
A second note on the feasibility of generalized universal composability
Yao et al. (A note on the feasibility of generalized universal composability. Theory and Applications of Models of Computation pp. 474-485, 2007; A note on the feasibility of generalised universal composability. Mathematical Structures in Computer Science, 19 (1), pp. 193-205) claimed a potential limitation on the class of protocols that could be securely implemented in the generalized universal composability (GUC) framework proposed by Canetti et al. (Universally composable security with global setup. Lecture Notes in Computer Science, pp. 61-85, 2007). Specifically, Yao et al. presented a concrete attack on a GUC Zero Knowledge (GUCZK) protocol, a natural adaptation Blum's ZK proof for Directed Hamiltonicity using the general GUC feasibility of Canetti et al. (Universally composable security with global setup. Lecture Notes in Computer Science, pp. 61-85, 2007). Interestingly, the attack was not analysed in the GUC model in Yao et al. (A note on the feasibility of generalised universal composability. Mathematical Structures in Computer Science 19 (1), pp. 193-205, 2009) but in the FUC model, a new UC-like framework proposed in the same work. Nonetheless, Yao et al. (A note on the feasibility of generalised universal composability. Mathematical Structures in Computer Science 19 (1), pp. 193-205, 2009) argued that, in light of this attack, GUC would lose its concurrent general composability and proof of knowledge properties. Concretely, they argue that GUC composability would now be with respect to some adversaries with limited access to external arbitrary protocols. In this work, we show that the claimed attack from Yao et al. is indeed harmless and does not contradict the security of the mentioned GUCZK protocol, thus restoring the general feasibility for GUC.
- 1 February 2018
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 28 (2) , 141-154
A second note on the feasibility of generalized universal composability
Yao et al. (A note on the feasibility of generalized universal composability. Theory and Applications of Models of Computation pp. 474-485, 2007; A note on the feasibility of generalised universal composability. Mathematical Structures in Computer Science, 19 (1), pp. 193-205) claimed a potential limitation on the class of protocols that could be securely implemented in the generalized universal composability (GUC) framework proposed by Canetti et al. (Universally composable security with global setup. Lecture Notes in Computer Science, pp. 61-85, 2007). Specifically, Yao et al. presented a concrete attack on a GUC Zero Knowledge (GUCZK) protocol, a natural adaptation Blum's ZK proof for Directed Hamiltonicity using the general GUC feasibility of Canetti et al. (Universally composable security with global setup. Lecture Notes in Computer Science, pp. 61-85, 2007). Interestingly, the attack was not analysed in the GUC model in Yao et al. (A note on the feasibility of generalised universal composability. Mathematical Structures in Computer Science 19 (1), pp. 193-205, 2009) but in the FUC model, a new UC-like framework proposed in the same work. Nonetheless, Yao et al. (A note on the feasibility of generalised universal composability. Mathematical Structures in Computer Science 19 (1), pp. 193-205, 2009) argued that, in light of this attack, GUC would lose its concurrent general composability and proof of knowledge properties. Concretely, they argue that GUC composability would now be with respect to some adversaries with limited access to external arbitrary protocols. In this work, we show that the claimed attack from Yao et al. is indeed harmless and does not contradict the security of the mentioned GUCZK protocol, thus restoring the general feasibility for GUC.
- 9 June 2016
- Published by Springer Nature
- p. 427-444
New Techniques for Non-interactive Shuffle and Range Arguments
- 9 June 2016
- Published by Springer Nature
- p. 427-444
New Techniques for Non-interactive Shuffle and Range Arguments
- 1 January 2015
- Published by Springer Nature
- p. 605-629
QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions
- 1 January 2015
- Published by Springer Nature
- p. 605-629
QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions