Publication

Hidden collisions on DSS

Publications associées (45)

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

On the boundedness of n-folds with κ(X) = n - 1

Stefano Filipazzi

In this note, we study certain sufficient conditions for a set of minimal klt pairs ( X, triangle) with kappa ( X, triangle) = dim( X ) - 1 to be bounded. ...

European Mathematical Soc-Ems2024

Near Collision Attack Against Grain V1

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

On the Effectiveness of Time Travel to Inject COVID-19 Alerts

Serge Vaudenay, Martin Vuagnoux

Digital contact tracing apps allow to alert people who have been in contact with people who may be contagious. The Google/Apple Exposure Notification (GAEN) system is based on Bluetooth proximity estimation. It has been adopted by many countries around the ...

Springer, Cham2021

EPFL Library Research Data Management Fastguides

Francesco Varrato, Antoine Louis Claude Masson, Eliane Ninfa Blumer, Sitthida Samath, Fantin Reichler, Jérôme Julien Chaptinel

This is a set of 11 1-sheet guides, providing abridged notions, advice and references for quick and practical research data management: #01 Research Data: the basics #02 FAIR Data Principles #03 Cost of Research Data Management #04 File Formats #05 Metadat ...

2019

A lower bound on opaque sets

János Pach

It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar ...

ELSEVIER SCIENCE BV2019

On the Hardness of the Strongly Dependent Decision Problem

Martin Biely

We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characterization of the SDD problem based on point-set topology. For partially synchro ...

ASSOC COMPUTING MACHINERY2019

A proof of a sumset conjecture of Erdős

Florian Karl Richter

In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C of infinite subsets of ℕ , settling a conjecture of Erdős. The proof features two different decompositions of an arbitrary bounded sequence into a structured ...

2019

PCB and circuit design for piezoelectric-NEMS characterization

Nanoelectromechanical resonators (NEMS) are being developed from more than two decades from now. The fabrication techniques as well as metrology ones are constantly improving, allowing a possible democratization of their uses in the consumer and industrial ...

2017

Insect-Inspired Mechanical Resilience for Multicopters

Dario Floreano, Stefano Mintchev, Sébastien Douglas de Rivaz

The ease of use and versatility of drones has contributed to their deployment in several fields, from entertainment to search and rescue. However, drones remain vulnerable to collisions due to pilot mistakes or various system failures. This paper presents ...

Ieee-Inst Electrical Electronics Engineers Inc2017

An Improved Upper Bound for the ErdAs-Szekeres Conjecture

Let ES(n) denote the minimum natural number such that every set of ES(n) points in general position in the plane contains n points in convex position. In 1935, ErdAs and Szekeres proved that ES. In 1961, they obtained the lower bound , which they conjectur ...

Springer2016