(In)Security of an Efficient Fingerprinting Scheme with Symmetric and Commutative Encryption of IWDW 2005

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.

In contrast to vast academic efforts to study AI security, few real-world reports of AI security incidents exist. Released incidents prevent a thorough investigation of the attackers' motives, as crucial information about the company and AI application is ...

Given two elliptic curves and the degree of an isogeny between them, finding the isogeny is believed to be a difficult problem—upon which rests the security of nearly any isogeny-based scheme. If, however, to the data above we add information about the beh ...

This paper presents a first implementation of gradient, divergence, and particle tracing schemes for the EMC3 code, a stochastic 3D plasma fluid code widely employed for edge plasma and impurity transport modeling in tokamaks and stellarators. These scheme ...

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

The sum of two n-bit pseudorandom permutations is known to behave like a pseudorandom function with n bits of security. A recent line of research has investigated the security of two public n-bit permutations and its degree of indifferentiability. Mandal e ...

We generalize the celebrated results of Bernhard Riemann and Gaston Darboux: we give necessary and sufficient conditions for a bilinear form to be flat. More precisely, we give explicit necessary and sufficient conditions for a tensor field of type (0, 2) ...

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

Field-programmable gate arrays (FPGAs) have become critical components in many cloud computing platforms. These devices possess the fine-grained parallelism and specialization needed to accelerate applications ranging from machine learning to networking an ...

The pervasive adoption of field-programmable gate arrays (FPGAs) in both cyber-physical systems and the cloud has raised many security issues. Being integrated circuits, FPGAs are susceptible to fault and power side-channel attacks, which require physical ...

Time-synchronization attacks on phasor measurement units (PMUs) pose a real threat to smart grids; it was shown that they are feasible in practice and that they can have a nonnegligible negative impact on state estimation, without triggering the bad data d ...

Given the need for efficient high-performance computing, computer architectures combining CPUs, GPUs, and FPGAs are nowadays prevalent. However, each of these components suffers from electrical-level security risks. Moving to heterogeneous systems, with th ...

As IoT applications gain widespread adoption, it becomes important to design and implement IoT protocols with security. Existing research in protocol security reveals that the majority of disclosed protocol vulnerabilities are caused by incorrectly impleme ...

Advances in mobile computing have paved the way for new types of distributed applications that can be executed solely by mobile devices on Device-to-Device (D2D) ecosystems (e.g., crowdsensing). Sophisticated applications, like cryptocurrencies, need distr ...

Long global gyrokinetic turbulence simulations are particularly challenging in situations where the system deviates strongly from its initial state and when fluctuation levels are high, for example, in strong gradient regions. For particle-in-cell simulati ...

The currently ongoing NIST LWC project aims at identifying new standardization targets for lightweight authenticated encryption with associated data (AEAD) and (optionally) lightweight cryptographic hashing. NIST has deemed it important for performance and ...

It has been common knowledge that for a stream cipher to be secure against generic TMD tradeoff attacks, the size of its internal state in bits needs to be at least twice the size of the length of its secret key. In FSE 2015, Armknecht and Mikhalev however ...

Due to the rapidly growing number of devices that need to communicate securely, there is still significant interest in the development of efficient encryption schemes. It is important to maintain a portfolio of different constructions in order to enable a ...

We consider the Dynamical Low Rank (DLR) approximation of random parabolic equations and propose a class of fully discrete numerical schemes. Similarly to the continuous DLR approximation, our schemes are shown to satisfy a discrete variational formulation ...

Non fungible tokens (NFTs) are used to define the ownership of digital assets. More recently, there has been a surge of platforms to auction digital art as well as other digital assets in form of image, video, and audio content of all sorts. Although NFTs ...

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

(In)Security of an Efficient Fingerprinting Scheme with Symmetric and Commutative Encryption of IWDW 2005

Chat with Graph Search

When Your AI Becomes a Target: AI Security Incidents and Best Practices

Isogeny Problems with Level Structure

Toward plasma drifts in EMC3: Implementation of gradient, divergence, and particle tracing schemes

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

Revisiting the Indifferentiability of the Sum of Permutations

Bernhard Riemann 1861 revisited: existence of flat coordinates for an arbitrary bilinear form

Public-Key Encryption with Quantum Keys

A Visionary Look at the Security of Reconfigurable Cloud Computing

Evaluating, Exploiting, and Hiding Power Side-Channel Leakage of Remote FPGAs

Security Measures for Grids Against Rank-1 Undetectable Time-Synchronization Attacks

Electrical-Level Attacks on CPUs, FPGAs, and GPUs: Survey and Implications in the Heterogeneous Era

PROFACTORY: Improving IoT Security via Formalized Protocol Customization

Toward Mobile Distributed Ledgers

Gyrokinetic simulations of turbulence and zonal flows driven by steep profile gradients using a delta-f approach with an evolving background Maxwellian

Power Yoga: Variable-Stretch Security of CCM for Energy-Efficient Lightweight IoT

Atom: A Stream Cipher with Double Key Filter

Towards Efficient LPN-Based Symmetric Encryption

Stability properties of a projector-splitting scheme for dynamical low rank approximation of random parabolic equations

Towards a secure and trustworthy imaging with non-fungible tokens

Symmetric Asynchronous Ratcheted Communication with Associated Data