Publication

A Gapless Post-quantum Hash Proof System in the Hamming Metric

Related publications (46)

Graph Chatbot

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.

Scaling Functional Synthesis and Repair

Emmanouil Koukoutos

Program synthesis was first proposed a few decades ago, but in the last decade it has gained increased momentum in the research community. The increasing complexity of software has dictated the urgent need for improved supporting tools that verify the soft ...

EPFL2019

Dual-Band Circularly Polarized Transmitarray Antenna for Satellite Communications at (20 to 30) GHz

Juan Ramon Mosig, Maria Garcia Vigueras, Joana Rita Alves dos Santos Silva, Santiago Capdevila Cascante, Hamed Hasani

A novel dual-band polarization-independent transmitarray is introduced in this paper for communication systems in Ka-band. Thanks to its unit-cell topology, the transmitarray antenna demonstrates almost complete independent performance at two design freque ...

2019

Implications of Position in Cryptography

Handan Kilinç Alper

In our daily lives, people or devices frequently need to learn their location for many reasons as some services depend on the absolute location or the proximity. The outcomes of positioning systems can have critical effects e.g., on military, emergency. Th ...

EPFL2018

Design and Evaluation of a Bowden-Cable-Based Remote Actuation System for Wearable Robotics

Roger Gassert, Olivier Lambercy

Wearable robots can assist motor-impaired individuals in activities of daily living, but weight is paramount for usability. Proximally placed actuators and remote actuation systems (RAS) minimize weight on users' extremities. State-of-the-art RAS employ pn ...

2018

CORPORA DELICTI, The Significant Detail. The Corpus Delicti is the evidence of a crime. The term denotes the formation of a proof that allows the unmasking of a perpetrator. In the realm of interpretation and language, it could reveal matter on which an ac ...

MANSLAB2017

Exponentially long orbits in Hopfield neural networks

Wulfram Gerstner, Johanni Michael Brea, Samuel Pavio Muscinelli

We show that Hopfield neural networks with synchronous dynamics and asymmetric weights admit stable orbits that form sequences of maximal length. For N units, these sequences have length T = 2^N; that is, they cover the full state space. We present a mathe ...

Massachusetts Institute of Technology Press2017

Proof-of-Personhood: Redemocratizing Permissionless Cryptocurrencies

Bryan Alexander Ford, Linus Gasser, Eleftherios Kokoris Kogias, Philipp Svetolik Jovanovic, Nicolas Gailly, Maria Fernanda Borge Chavez

Permissionless blockchain-based cryptocurrencies commonly use proof-of-work (PoW) or proof-of-stake (PoS) to ensure their security, e.g. to prevent double spending attacks. However, both approaches have disadvantages: PoW leads to massive amounts of wasted ...

IEEE2017

Cloaking using complementary media was suggested by Lai et al. in [8]. The study of this problem faces two difficulties. Firstly, this problem is unstable since the equations describing the phenomenon have sign changing coefficients, hence the ellipticity ...

2016

The aim of this short note is twofold. First, we give a sketch of the proof of a recent result proved by the authors in the paper [7] concerning existence and uniqueness of renormalized solutions of continuity equations with unbounded damping coefficient. ...

2016

Polynomiality of Hurwitz numbers, Bouchard-Marino conjecture, and a new proof of the ELSV formula

Nicolas Gerson Orantin

In this paper we give a new proof of the ELSV formula. First, we refine an argument of Okounkov and Pandharipande in order to prove (quasi-)polynomiality of Hurwitz numbers without using the ELSV formula (the only way to do that before used the ELSV formul ...

Academic Press Inc Elsevier Science2015