Pasar al contenido principal

FORMAL ANALYSIS AND VERIFICATION OF POST-QUANTUM CRYPTOGRAPHIC PROTOCOLS

PCI2020-120708-2

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos Programación Conjunta Internacional
Año convocatoria 2020
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

Protocol Dialects as Formal Patterns

  • Galán, D.
  • Meadows, C.
  • Meseguer, J.
  • García-Valero, Víctor|||0000-0003-0681-1130
  • Escobar Román, Santiago|||0000-0002-3550-4781
[EN] A protocol dialect is a lightweight method to obfuscate the communication exchanges between legitimate protocol users to make it hard for malicious users to interact with legitimate ones. So far, dialects have been based on a single obfuscation transformation, which we call a lingo. In this work dialects are generalized to become protocol and lingo generic. In this way they can be composed with other dialects for greater security. We present a formal semantics of dialects as formal patterns, i.e., as protocol transformations formalized in rewriting logic. We also present several attacker models and explain how our generalized notion of dialect can be used to harden dialects against such attackers., S. Escobar and V. Garcia have been partially supported by the grant PID2021-122830OB-C42 funded by MCIN/AEI/10.13039/501100011033 and ERDF A way of making Europe, by the grant CIPROM/2022/6 funded by Generalitat Valenciana, and by the grant PCI2020-120708-2 funded by MICIN/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/PRTR. D. Galan, V. Garcia, C. Meadows, and J. Meseguer have been partially supported by ONR Code 311.
Docta Complutense
Publicación Contribución de congreso (ConferenceOutput)

Equational Unification and Matching, and Symbolic Reachability Analysis in Maude 3.2 (System Description)

  • Durán, Francisco
  • Eker, Steven
  • Escobar, Santiago
  • Martí Oliet, Narciso
  • Meseguer, José
  • Rubio Cuéllar, Rubén Rafael
  • Talcott, Carolyn
Equational unification and matching are fundamental mechanisms in many automated deduction applications. Supporting them efficiently for as wide as possible a class of equational theories, and in a typed manner supporting type hierarchies, benefits many applications; but this is both challenging and nontrivial. We present Maude 3.2’s efficient support of these features as well as of symbolic reachability analysis of infinite-state concurrent systems based on them.