Concept

Key management

Publications associées (602)

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

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 ...

Philadelphia2024

Precoding for High-Throughput Satellite Communication Systems: A Survey

Malek Khammassi

With the expanding demand for high data rates and extensive coverage, high throughput satellite (HTS) communication systems are emerging as a key technology for future communication generations. However, current frequency bands are increasingly congested. ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Creating the conditions for Western European petroculture: The Marshall Plan, the politics of the OEEC, and the transition from coal to oil

Nicolas Christophe Chachereau

In the postwar years, petroleum products pervaded more and more aspects of Western European life. In this article, we study the origins of this pervasive petroculture through the lens of the Marshall Plan/European Recovery Program (ERP), its Refinery Expan ...

2023

Revealing the Structure of Tryptophan in Microhydrated Complexes by Cold Ion Spectroscopy

Natalia Nagornova, Andrei Zviagin, Ruslan Yamaletdinov, Manuel Dömer

The geometry of biomolecules isolated in the gas phaseusuallydiffers substantially from their native structures in aqueous solution,which are the only ones truly relevant to life science. To connectthe high resolution of cold ion spectroscopy that can be a ...

AMER CHEMICAL SOC2023

Authenticated private information retrieval

Bryan Alexander Ford, Simone Maria Stefano Colombo, Henry Nathaniel Corrigan-Gibbs, Kirill Nikitin

This paper introduces protocols for authenticated private information retrieval. These schemes enable a client to fetch a record from a remote database server such that (a) the server does not learn which record the client reads, and (b) the client either ...

Berkeley2023

Electromagnetic Forces and Torques: From Dielectrophoresis to Optical Tweezers

Olivier Martin, Marco Riccardi

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. ...

AMER CHEMICAL SOC2023

New SIDH Countermeasures for a More Efficient Key Exchange

Tako Boris Fouotsa, Andrea Basso

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 ...

Springer2023

PAE: Towards More Efficient and BBB-Secure AE from a Single Public Permutation

Ritam Bhaumik

Four recent trends have emerged in the evolution of authenticated encryption schemes: (1) Regarding simplicity, the adoption of public permutations as primitives allows for sparing a key schedule and the need for storing round keys; (2) using the sums of p ...

Springer2023

Untangling the influence of Antarctic and Southern Ocean life on clouds

Julia Schmale, Hélène Paule Angot, Jenny Thomas, Markus Frey

Polar environments are among the fastest changing regions on the planet. It is a crucial time to make significant improvements in our understanding of how ocean and ice biogeochemical processes are linked with the atmosphere. This is especially true over A ...

2023

Berry curvature dipole generation and helicity-to-spin conversion at symmetry-mismatched heterointerfaces

Peng Chen, Xupeng Yang

The Berry curvature dipole (BCD) is a key parameter that describes the geometric nature of energy bands in solids. It defines the dipole-like distribution of Berry curvature in the band structure and plays a key role in emergent nonlinear phenomena. The th ...

NATURE PORTFOLIO2023

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search