Iniciativa IMDEA
Resumen: This study investigates the security landscape of space mission protocols, examining standards set by the Consultative C...
Resumen: The limited scripting capabilities in Bitcoin-like cryptocurrencies have forced implementations of smart contracts as mu...
Resumen: This talk will explore a general protocol for securely realizing atomic swaps across cryptocurrencies. In atomic swaps, ...
Resumen: Smart contracts are distributed applications on blockchains that implement advanced financial instruments, such as decen...
Resumen: Linear Temporal Logic (LTL) is one of the most common formalisms for expressing properties of systems in formal verifica...
Resumen: Non-Interactive Verifiable Secret Sharing (NI-VSS) is a technique for distributing a secret among a group of individuals...
Resumen: Polynomial programs are imperative programs with real-valued variables, i.e. imperative programs in which all expression...
Resumen: Knox is a new framework that enables developers to build hardware security modules (HSMs) with high assurance through fo...
Resumen: In this talk we demonstrate decidability for the intuitionistic modal logic S4 first formulated by Fischer Servi [1]. Th...
Resumen: Phishing is one of the most common forms of social engineering attacks and is regularly used by criminals to compromise ...
Resumen: Cryptographic voting protocols have recently seen much interest from practitioners due to their use in countries such as...
Resumen: In this talk, I will introduce and motivate a well-studied probabilistic variant of the classic inclusion problem betwee...
Resumen: Recently, in June, our group submitted a new proposal, namely FAEST, to the current NIST PQ signature (additional round)...
Resumen: Guillermo Errezil will talk about the work, goals and collaborations of Formal Vindication.
Resumen: Although in many occasions the protection of information systems is achieved by implementing obscure procedures, the pro...
Resumen: In this talk, we present a new framework, called polyhedral abstraction, for checking safety properties on Petri nets, t...
Resumen: Non-Interactive Zero-Knowledge proofs (NIZKs) allow a prover to convince a verifier about the validity of a claim withou...
Resumen: In this talk, we give a brief introduction to probabilistic programming and present Zar: a formally verified compiler pi...
Resumen: Many proofs of interactive cryptographic protocols (e.g., as in Universal Composability) operate by proving the protocol...
Resumen: The continuously increasing interest in intelligent autonomous systems underlines the need for new developments in cyber...
Resumen: Computer systems and software play a vital role in the functioning of our society. Ensuring their security is of utmost ...
Resumen: Autonomous Systems offer hope towards moving away from mechanized, unsafe, manual, often inefficient practices. Last dec...
Resumen: Secure Multiparty Computation (MPC) allows a set of mutually distrusting parties to jointly perform a computation on the...
Resumen: Open Access (OA) is a mechanism that allows for free and immediate access to research results and data. It aims to enhan...
Resumen: The most widely studied language for expressing statements in the context of Zero-Knowledge (ZK) proofs is arithmetic ci...
Resumen: Non-volatile main memory (NVMM) is a new tier in the memory hierarchy that offers jointly the durability of spinning dis...
Resumen: Self-adaptation is often defined as the ability of systems to alter at runtime their behaviour in response to changes in...
Resumen: The context-free language (CFL) reachability problem on graphs (as well as a closely related problem of language emptine...
Resumen: Smart contracts are immutable programs deployed on the blockchain that can manage significant assets. Because of this, v...
