Publications associées à Résistance aux collisions

Daniel Patrick Collins, Subhadeep Banik, Willi Meier

A near collision attack against the Grain v1 stream cipher was proposed by Zhang et al. in Eurocrypt 18. The attack uses the fact that two internal states of the stream cipher with very low hamming distance between them, produce similar keystream sequences ...

2023

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

Serge Vaudenay, Laurane Chloé Angélina Marco, Abdullah Talayhan

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

2023

On Succinct Non-interactive Arguments in Relativized Worlds

Alessandro Chiesa

Succinct non-interactive arguments of knowledge (SNARKs) are cryptographic proofs with strong efficiency properties. Applications of SNARKs often involve proving computations that include the SNARK verifier, a technique called recursive composition. Unfort ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Alessandro Chiesa, Siqi Liu

Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the construction of efficient cryptographic proofs. We present an IOP that simultaneously achieves the properties of zer ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Communication Complexity of Collision

Mika Tapani Göös, Siddhartha Jain

The Collision problem is to decide whether a given list of numbers (x_1,…,x_n) ∈ [n]ⁿ is 1-to-1 or 2-to-1 when promised one of them is the case. We show an n^Ω(1) randomised communication lower bound for the natural two-party version of Collision where Ali ...

Leibniz-Zentrum für Informatik2022

Persistent random walks of charged particles across magnetic field lines

Ambrogio Fasoli, Ivo Furno, Paolo Ricci, Marcelo Baquero Ruiz, Fabian Manke

We investigate the time evolution of the mean location and variance of a charged particle subject to random collisions that are Poisson distributed. The particle moves on a plane and is subject to a magnetic field applied perpendicular to the plane, so it ...

AMER PHYSICAL SOC2020

Bidirectional Asynchronous Ratcheted Key Agreement with Linear Complexity

Serge Vaudenay, Fatma Betül Durak

Following up mass surveillance and privacy issues, modern secure communication protocols now seek more security such as forward secrecy and post-compromise security. They cannot rely on an assumption such as synchronization, predictable sender/receiver rol ...

Springer2019

A moment-based model for plasma dynamics at arbitrary collisionality

Rogério Manuel Cabete De Jesus Jorge

Despite significant development over the last decades, a model able to describe the periphery region of magnetic confinement fusion devices, extending from the edge to the far scrape-off layer, is still missing. This is because this region is characterized ...

EPFL2019

A Moment‐Based Kinetic Model for Efficient Numerical Implementation

Paolo Ricci, Rogério Manuel Cabete De Jesus Jorge, Baptiste Jimmy Frei

A drift-kinetic and a gyrokinetic model able to describe the plasma dynamics in the tokamak periphery are presented, which take into account electromagnetic fluctuations at all relevant scales, allowing for comparable amplitudes of background and fluctuati ...

2019

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.

Résistance aux collisions

Near Collision Attack Against Grain V1

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

On Succinct Non-interactive Arguments in Relativized Worlds

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Communication Complexity of Collision

Tweaking Key-Alternating Feistel Block Ciphers

Persistent random walks of charged particles across magnetic field lines

Bidirectional Asynchronous Ratcheted Key Agreement with Linear Complexity

A moment-based model for plasma dynamics at arbitrary collisionality

A Moment‐Based Kinetic Model for Efficient Numerical Implementation

Graph Chatbot

Chattez avec Graph Search

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Near Collision Attack Against Grain V1

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

On Succinct Non-interactive Arguments in Relativized Worlds

Tweaking Key-Alternating Feistel Block Ciphers

A Moment‐Based Kinetic Model for Efficient Numerical Implementation

Communication Complexity of Collision

Bidirectional Asynchronous Ratcheted Key Agreement with Linear Complexity

A moment-based model for plasma dynamics at arbitrary collisionality

Persistent random walks of charged particles across magnetic field lines