Keeping Authorities “Honest or Bust” with Decentralized Witness Cosigning

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Since the complex engineered system involves multi-disciplinary, co-simulation is the key technique to the performance analysis. However, the co-simulation is hindered by heterogeneous sub-systems and ununified environments. In this paper, a Cognitive Twin ...

Machine intelligence greatly impacts almost all domains of our societies. It is profoundly changing the field of mechanical engineering with new technical possibilities and processes. The education of future engineers also needs to adapt in terms of techni ...

A computer-implemented method and a distributed computer system (100) for privacy- preserving distributed training of a global model on distributed datasets (DS1 to DSn). The system has a plurality of data providers (DP1 to DPn) being communicatively coupl ...

Light enables to see the world around us, while playing a key role in our biological functioning. During the last decades, light has become an important research topic for chronobiologists and neuroscientists, and their findings are increasingly interwoven ...

We consider the problem of secret key generation from correlated Gaussian random variables in the finite blocklength regime. Such keys could be used to encrypt communication in IoT networks, and have provable secrecy guarantees in contrast to classic crypt ...

The US National Institute of Standards and Technology (NIST) recently announced the public-key cryptosystems (PKC) that have passed to the second round of the post-quantum standardization process. Most of these PKC come in two flavours: a weak IND-CPA vers ...

Following up mass surveillance and privacy issues, modern secure communication protocols now seek strong security, such as forward secrecy and post-compromise security, in the face of state exposures. To address this problem, ratcheting was thereby introdu ...

Recent works have demonstrated the possibility of extracting secrets from a cryptographic core running on an FPGA by means of remote power analysis attacks. To mount these attacks, an adversary implements a voltage fluctuation sensor in the FPGA logic, rec ...

After ratcheting attracted attention mostly due to practical real-world protocols, recently a line of work studied ratcheting as a primitive from a theoretic point of view. Literature in this line, pursuing the strongest security of ratcheting one can hope ...

This paper presents an extension to PathFinder FPGA routing algorithm, which enables it to deliver FPGA designs free from risks of crosstalk attacks. Crosstalk side-channel attacks are a real threat in large designs assembled from various IPs, where some I ...

Keeping Authorities “Honest or Bust” with Decentralized Witness Cosigning

Chat with Graph Search

Co-simulation of complex engineered systems enabled by a cognitive twin architecture

Automated Design: A Journey Across Modelling, Optimization, and Education

System and method for privacy-preserving distributed training of machine learning models on distributed datasets

Alertness in work environments : on the role of indoor daylight exposure

On Polar Coding For Finite Blocklength Secret Key Generation Over Wireless Channels

Classical Misuse Attacks on NIST Round 2 PQC: The Power of Rank-Based Schemes

Symmetric Asynchronous Ratcheted Communication with Associated Data

Are Cloud FPGAs Really Vulnerable to Power Analysis Attacks?

Determining the Core Primitive for Optimally Secure Ratcheting

Closing Leaks: Routing Against Crosstalk Side-Channel Attacks