Methods and systems for secure data exchange

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 advent of internet and mass communication, two public-key cryptographic algorithms have shared the monopoly of data encryption and authentication: Diffie-Hellman and RSA. However, in the last few years, progress made in quantum physics -- and mo ...

Billions of people now have conversations daily over the Internet. A large portion of this communication takes place via secure messaging protocols that offer "end-to-end encryption'" guarantees and resilience to compromise like the widely-used Double Ratc ...

In this paper, we propose Rocca-S, an authenticated encryption scheme with a 256-bit key and a 256-bit tag targeting 6G applications bootstrapped from AES. Rocca-S achieves an encryption/decryption speed of more than 200 Gbps in the latest software environ ...

A method for aggregating digital signatures comprises the following steps carried out by a signature aggregator: receiving first data packages from signers, each first data package comprising a signer identifier, a payload, and a payload signature; verifyi ...

In this paper, we propose a reduced-order modeling strategy for two-way Dirichlet-Neumann parametric coupled problems solved with domain-decomposition (DD) sub-structuring methods. We split the original coupled differential problem into two sub-problems wi ...

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

Diffusion-based generative methods have proven effective in modeling trajectories with offline datasets. However, they often face computational challenges and can falter in generalization, especially in capturing temporal abstractions for long- horizon tas ...

Conventional techniques for purifying macromolecular conjugates often require complex and costly installments that are inaccessible to most laboratories. In this work, we develop a one-step micropreparative method based on a trilayered polyacrylamide gel e ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

Molecular quantum dynamics simulations are essential for understanding many fundamental phenomena in physics and chemistry. They often require solving the time-dependent Schrödinger equation for molecular nuclei, which is challenging even for medium-sized ...

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. We establish communication lower bounds that determine ...

Driven by the need for more efficient and seamless integration of physical models and data, physics -informed neural networks (PINNs) have seen a surge of interest in recent years. However, ensuring the reliability of their convergence and accuracy remains ...

The invention relates to methods for the preparation of method of preparation of Tau aggregates, including fibrils, fibrillar species, soluble and insoluble oligomeric species, new Tau aggregates and uses thereof. The invention further relates to the uses ...

We describe a novel method to compute the components of dynamo tensors from direct magnetohydrodynamic (MHD) simulations. Our method relies upon an extension and generalization of the standard H & ouml;gbom CLEAN algorithm widely used in radio astronomy to ...

In the framework of Impagliazzo's five worlds, a distinction is often made between two worlds, one where public-key encryption exists (Cryptomania), and one in which only one-way functions exist (MiniCrypt). However, the boundaries between these worlds can ...

With the looming threat of large-scale quantum computers, a fair portion of recent cryptographic research has focused on examining cryptographic primitives from the perspective of a quantum adversary. Shor's 1994 result revealed that quantum computers can ...

The Bitcoin architecture heavily relies on the ECDSA signature scheme which is broken by quantum adversaries as the secret key can be computed from the public key in quantum polynomial time. To mitigate this attack, bitcoins can be paid to the hash of a pu ...

The Supersingular Isogeny Diffie-Hellman (SIDH) protocol has been the main and most efficient isogeny-based encryption protocol, until a series of breakthroughs led to a polynomial-time key-recovery attack. While some countermeasures have been proposed, th ...

Electromagnetic forces and torques enable many key technologies, including optical tweezers or dielectrophoresis. Interestingly, both techniques rely on the same physical process: the interaction of an oscillating electric field with a particle of matter. ...

We propose and implement a multiparty homomorphic encryption (MHE) scheme with a t-out-of -N-threshold access-structure that is efficient and does not require a trusted dealer in the common random string model. We construct this scheme from the ring-learni ...

Methods and systems for secure data exchange

Chat with Graph Search

Secure and Efficient Cryptographic Algorithms in a Quantum World

On the Theory and Practice of Modern Secure Messaging

An Ultra-High Throughput AES-Based Authenticated Encryption Scheme for 6G: Design and Implementation

Rapidly verifiable aggregate signatures

A Reduced Order Model for Domain Decompositions with Non-conforming Interfaces

Efficient Continual Finite-Sum Minimization

SIMPLE HIERARCHICAL PLANNING WITH DIFFUSION

Micropreparative Gel Electrophoresis for Purification of Nanoscale Bioconjugates

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

High-order geometric integrators for the variational Gaussian wavepacket dynamics and application to vibronic spectra at finite temperature

COMMUNICATION LOWER BOUNDS AND OPTIMAL ALGORITHMS FOR MULTIPLE TENSOR-TIMES-MATRIX COMPUTATION

Residual-based attention in physics-informed neural networks

Method of preparation of amyloidogenic protein aggregates and uses thereof

Iterative removal of sources to model the turbulent electromotive force

Public-Key Encryption with Quantum Keys

Security in the Presence of Quantum Adversaries

Making Classical (Threshold) Signatures Post-quantum for Single Use on a Public Ledger

New SIDH Countermeasures for a More Efficient Key Exchange

Electromagnetic Forces and Torques: From Dielectrophoresis to Optical Tweezers

An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption