Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por autor "López Rodríguez, Damián"

Mostrando ítems 1-20 de 34

Página siguiente

A polynomial double reversal minimization algorithm for deterministic finite automata

Vázquez-De-Parga Andrade, Manuel; García Gómez, Pedro; López Rodríguez, Damián (Elsevier, 2013-05)

We here propose a polynomial-time deterministic finite automaton minimization algorithm directly derived from Brzozowski’s double reversal algorithm. To do so, we take into account the framework by Brzozowski and Tamm, to ...
A Solidity implementation of TAVS

Larriba-Flor, Antonio Manuel; López Rodríguez, Damián (Frontiers Media S.A., 2023-03-01)

[EN] We present a Solidity smart contract implementation of the TAVS e-voting protocol. The Two Authorities Electronic Voting Scheme (TAVS) is a voting scheme that achieves universal verifiability with a reduced time-complexity ...
A split-based incremental deterministic automata minimization algorithm

García Gómez, Pedro; Vázquez-De-Parga Andrade, Manuel; Velasco, Jairo A.; López Rodríguez, Damián (Springer, 2014-10-24)

We here study previous results due to Hopcroft and Almeida et al. to propose an incremental split-based deterministic automata minimization algorithm whose average running-time does not depend on the size of the alphabet. ...
A sufficient condition to polynomially compute a minimum separating DFA

Vázquez-De-Parga Andrade, Manuel; García Gómez, Pedro; López Rodríguez, Damián (Elsevier, 2016-11-20)

The computation of a minimal separating automaton (MSA) for regular languages has been studied from many different points of view, from synthesis of automata or Grammatical Inference to the minimization of incompletely ...
A two authorities electronic vote scheme

Larriba-Flor, Antonio Manuel; Sempere Luna, José María; López Rodríguez, Damián (Elsevier, 2020-10)

[EN] In this paper we propose a new electronic multi-authority voting system based on blind signatures. We focus on the open problem of the efficiency of electronic voting systems. Most of the proposed systems rely on ...
Adivinando passwords. Una propuesta para su búsqueda eficiente

Mor Michael, Alejandro (Universitat Politècnica de València, 2019-09-09)

[ES] El acceso a los sistemas informáticos está desde siempre ligado a la utilización de palabras de paso o passwords. Por motivos de seguridad, los passwords se han almacenado de forma oculta en los sistemas, siendo ...
Aplicación de políticas de seguridad y troubleshooting necesario para resolver incidencias en Firewalls de Nueva Generación

Fernández Cortés, Darío (Universitat Politècnica de València, 2022-09-20)

[ES] La seguridad en la red es fundamental en la actualidad debido al creciente aumento de amenazas y ataques, cada vez más sofisticados. En este trabajo se pretende realizar un análisis de los Firewalls de Nueva Generación, ...
Criptoanálisis paralelo de sistemas RSA

López Ribes, Jorge (Universitat Politècnica de València, 2018-10-22)

[ES] En este trabajo de fin de grado se realiza la implementación de un algoritmo para criptoanalizar de forma paralela sistemas RSA. Para ello se ha realizado un repaso de distintos algoritmos de factorización existentes, ...
Cultural Heritage and its Dissemination through Linguistic and Technical Learning in Higher Education

Gil-Salom, Daniela; Marzal-Calatayud, Eliseo; López-Rodríguez, Damián (Editorial Universitat Politècnica de València, 2023-06-16)

[EN] This paper presents the first results of the innovation and educational improvement project FUSIONA, which combines the transversal learning of German as a foreign language (GFL), the interdisciplinary learning, the ...
DFA minimization: Double reversal versus split minimization algorithms

García Gómez, Pedro; López Rodríguez, Damián; Vázquez-De-Parga Andrade, Manuel (Elsevier, 2015-06)

In this paper, we show the relationship between the two most widely used approaches for the minimization of deterministic finite automata: minimization by split of partitions and minimization by double reversal. Even though ...
DFA minimization: from Brzozowski to Hopcroft

García Gómez, Pedro; López Rodríguez, Damián; Vázquez-De-Parga Andrade, Manuel (Universitat Politècnica de València, 2013-03-14)

Minimization of automata is a classic problem in Computer Sci- ence which is still studied nowadays. In this paper, we first propose a polynomial minimization method directly derived from Brzozowski¿s algorithm, and second, ...
Diseño e implementación de un sistema de voto electrónico

Moreno Moreno, Carlos (Universitat Politècnica de València, 2016-09-09)

[ES] En este trabajo se lleva a cabo el diseño e implementación de un sistema de voto electrónico, analizando para ello características deseables, distintas aproximaciones realizadas en otros países, así como distintos ...
Distributed Cryptographic Protocols

Larriba Flor, Antonio Manuel (Universitat Politècnica de València, 2023-10-16)

[ES] La confianza es la base de las sociedades modernas. Sin embargo, las relaciones basadas en confianza son difíciles de establecer y pueden ser explotadas fácilmente con resultados devastadores. En esta tesis exploramos ...
Distributed Trust, a Blockchain Election Scheme

Larriba Flor, Antonio Manuel; Cerdà i Cucó, Aleix; Sempere Luna, José María; López Rodríguez, Damián (IOS Press, 2021)

[EN] Voting systems are as useful as people are willing to use them. Although many electronic election schemes have been proposed through the years, and some real case scenarios have been tested, people still do not trust ...
Efficient deterministic finite automata split-minimization derived from Brzozowski's algorithm

García Gómez, Pedro; López Rodríguez, Damián; Vázquez-De-Parga Andrade, Manuel (World Scientific Publishing, 2014-09)

Minimization of deterministic finite automata is a classic problem in Computer Science which is still studied nowadays. In this paper, we relate the different split-minimization methods proposed to date, or to be proposed, ...
Estudio de técnicas de bootstrapping en el aprendizaje de lenguajes formales

Jardón Chornet, Rogelio (Universitat Politècnica de València, 2019-10-08)

[ES] En el presente trabajo se va a estudiar la influencia del uso de técnicas de bootstrapping a la hora de implementar métodos para el aprendizaje de lenguajes formales. Estas técnicas se usarán para seleccionar y reducir ...
From regular expressions to smaller NFAs

García Gómez, Pedro; López Rodríguez, Damián; Ruiz Ochando, José; Álvarez Vargas, Gloria Inés (Elsevier, 2011-09)

Several methods have been developed to construct -free automata that represent a regular expression. Among the most widely known are the position automaton (Glushkov), the partial derivatives automaton (Antimirov) and the ...
Grammatical inference of directed acyclic graph languages with polynomial time complexity

Gallego, Antonio-Javier; López Rodríguez, Damián; Calera-Rubio, Jorge (Elsevier, 2018)

[EN] In this paper we study the learning of graph languages. We extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. We propose a grammatical inference ...
How to grant anonymous access

Larriba, Antonio M.; López Rodríguez, Damián (Institute of Electrical and Electronics Engineers, 2023)

[EN] In this paper, we propose three protocols to share, among a set of N competing entities, the responsibility to grant anonymous access to a resource. The protocols we propose vary in their settings to take into account ...
Implementación distribuida de un protocolo de voto electrónico

Roselló Ibáñez, Óscar (Universitat Politècnica de València, 2023-09-27)

[ES] Los sistemas de voto electrónico son cada día más comunes, facilitando a los electores el proceso y/o permitiendo la reducción logística en determinados escenarios. En este proyecto se considera un protocolo de voto ...