María Isabel González Vasco

Prof. María Isabel González Vasco

MACIMTE, Universidad Rey Juan Carlos

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 February 2007 in International Journal of Information Security
Verified
Journal Article
Closed access
PDF file
JBJens-Matthias Bohli
Jens-Matthias Bohli
María Isabel González VascoMaría Isabel González Vasco
María Isabel González Vasco
RSRainer Steinwandt
Rainer Steinwandt

1 January 2003 in Experimental Mathematics
Verified
Journal Article
Closed access
María Isabel González VascoMaría Isabel González Vasco
María Isabel González Vasco
MRMartin Rötteler
Martin Rötteler
RSRainer Steinwandt
Rainer Steinwandt
Logarithmic signaturesare a special type of group factorizations, introduced as basic components of certain cryptographic keys. Thus, short logarithmic signatures are of special interest. We deal with the question of finding logarithmic signatures of minimal length in finite groups. In particular, such factorizations exist for solvable, symmetric, and alternating groups. We show how to use the known examples to derive minimal length logarithmic signatures for other groups. Namely, we prove the existence of such factorizations for several classical groups and—in parts by direct computation—for all groups of order <175560 (= ord(J 1), where J 1 is Janko's first sporadic simple group). Whether there exists a minimal length logarithmic signature for each finite group still remains an open question.

1 January 2007
Verified
Book Chapter
Closed access
PDF file
MAMichel Abdalla
Michel Abdalla
JBJens-Matthias Bohli
Jens-Matthias Bohli
María Isabel González VascoMaría Isabel González Vasco
María Isabel González Vasco
RSRainer Steinwandt
Rainer Steinwandt

1 January 2001
Verified
Book Chapter
Closed access
PDF file
María Isabel González VascoMaría Isabel González Vasco
María Isabel González Vasco
ISIgor E. Shparlinski
Igor E. Shparlinski

1 July 2007 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
RCRegino Criado
Regino Criado
JFJ. Flores
J. Flores
María Isabel González VascoMaría Isabel González Vasco
María Isabel González Vasco
JPJ. Pello
J. Pello

25 March 2021 in Entropy
Verified
Journal Article
Open access
PDF file
CGCARLOS EDUARDO GONZALEZ GUILLEN
CARLOS EDUARDO GONZALEZ GUILLEN
María Isabel González VascoMaría Isabel González Vasco
María Isabel González Vasco
FJFloyd Johnson
Floyd Johnson
APAngel Luis Perez Del Pozo
Angel Luis Perez Del Pozo
Identification schemes are interactive cryptographic protocols typically involving two parties, a prover, who wants to provide evidence of their identity and a verifier, who checks the provided evidence and decides whether or not it comes from the intended prover. Given the growing interest in quantum computation, it is indeed desirable to have explicit designs for achieving user identification through quantum resources. In this paper, we comment on a recent proposal for quantum identity authentication from Zawadzki. We discuss the applicability of the theoretical impossibility results from Lo, Colbeck and Buhrman et al. and formally prove that the protocol must necessarily be insecure. Moreover, to better illustrate our insecurity claim, we present an attack on Zawadzki’s protocol and show that by using a simple strategy an adversary may indeed obtain relevant information on the shared identification secret. Specifically, through the use of the principal of conclusive exclusion on quantum measurements, our attack geometrically reduces the key space resulting in the claimed logarithmic security being reduced effectively by a factor of two after only three verification attempts.