Forgery-Resilience for Digital Signature Schemes

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.

Current cryptographic solutions will become obsolete with the arrival of large-scale universal quantum computers. As a result, the National Institute of Standards and Technology supervises a post-quantum standardization process which involves evaluating ca ...

Isogeny-based cryptography is an instance of post-quantum cryptography whose fundamental problem consists of finding an isogeny between two (isogenous) elliptic curves E and E′. This problem is closely related to that of computing the endomorphism ring of ...

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

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

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

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

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

We propose a 2-round blind signature protocol based on the random oracle heuristic and the hardness of standard lattice problems (Ring/Module-SIS/LWE and NTRU) with a signature size of 22 KB. The protocol is round-optimal and has a transcript size that can ...

Witness encryption is a cryptographic primitive which encrypts a message under an instance of an NP language and decrypts the ciphertext using a witness associated with that instance. In the current state of the art, most of the witness encryption construc ...

Post-quantum cryptography is a branch of cryptography which deals with cryptographic algorithms whose hardness assumptions are not based on problems known to be solvable by a quantum computer, such as the RSA problem, factoring or discrete logarithms. This ...

We give a construction of an efficient one-out-of-many proof system, in which a prover shows that he knows the pre-image for one element in a set, based on the hardness of lattice problems. The construction employs the recent zero-knowledge framework of Ly ...

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 alkali-silica reaction (ASR), also known as concrete cancer, is one of the most prevalent causes of concrete degradation. In this chemical reaction, amorphous silica in the aggregates reacts with alkalis in the pore solution. By absorbing water, hydrop ...

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

In the digital era, users share their personal data with service providers to obtain some utility, e.g., access to high-quality services. Yet, the induced information flows raise privacy and integrity concerns. Consequently, cautious users may want to prot ...

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

Several works published over the last two decades have shown for a stylized set-up with homogeneous users that metering-based priority (MBP) schemes may generate Pareto improving departure time adjustments similar to those induced by congestion pricing, bu ...

This paper investigates the phenomenon of cover spalling in reinforced concrete induced by bond or by the action of an inner pressure. This research is based on an experimental programme comprising a series of bond tests and a series of tests with inner-pr ...

Results that do not confirm expectations are generally referred to as 'negative' results. While essential for scientific progress, they are too rarely reported in the literature - Brain-Machine Interface (BMI) research is no exception. This led us to organ ...

Forgery-Resilience for Digital Signature Schemes

Chat with Graph Search

Side-channel analysis of isogeny-based key encapsulation mechanisms and hash-based digital signatures

Exploring SIDH-Based Signature Parameters

Secure and Efficient Cryptographic Algorithms in a Quantum World

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

On the Theory and Practice of Modern Secure Messaging

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

Security in the Presence of Quantum Adversaries

New SIDH Countermeasures for a More Efficient Key Exchange

Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE

BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications

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

Efficient Meso-Scale Modeling of Alkali-Silica-Reaction Damage in Concrete

Towards Efficient LPN-Based Symmetric Encryption

Privacy and Integrity Preserving Computations with CRISP

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

Impacts of Metering-Based Dynamic Priority Schemes

Spalling of concrete cover induced by reinforcement

Turning negative into positives! Exploiting 'negative' results in Brain-Machine Interface (BMI) research