Publications related to Zero-knowledge proof

Practical & Provably Secure Distance-Bounding

From contactless payments to remote car unlocking, many applications are vulnerable to relay attacks. Distance bounding protocols are the main practical countermeasure against these attacks. At FSE 2013, we presented SKI as the first family of provably sec ...

2013

A Non-interactive Range Proof with Constant Communication

Rafik Chaabouni, Helger Lipmaa

In a range proof, the prover convinces the verifier in zero-knowledge that he has encrypted or committed to a value a ∈ [0,H] where H is a public constant. Most of the previous non-interactive range proofs have been proven secure in the random oracle model ...

Springer Berlin Heidelberg2012

Scalable and Secure Polling in Dynamic Distributed Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Hamza Harkous, Florian Huc

We consider the problem of securely conducting a poll in synchronous dynamic networks equipped with a Public Key Infrastructure (PKI). Whereas previous distributed solutions had a communication cost of O(n^2) in an n nodes system, we present SPP (Secure an ...

2012

The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks

Serge Vaudenay, Aikaterini Mitrokotsa, Asli Bay, Iosif-Daniel Spulber

The communication between an honest prover and an honest verifier can be intercepted by a malicious man-in-the-middle (MiM), without the legitimate interlocutors noticing the intrusion. The attacker can simply relay messages from one party to another, even ...

Springer,2012

Quantification of "Fuzzy" Chemical Concepts: A Computational Perspective

Matthew Wodrich, Jérôme Florian Gonthier

Chemists recurrently utilize "fuzzy'' chemical concepts (e.g. atomic charges, the chemical bond, strain, aromaticity, branching, etc.), which lack unique quantitative assessments but, nonetheless, are frequently employed as tools for understanding the intr ...

Royal Society of Chemistry2012

Scalable and Secure Aggregation in Distributed Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Hamza Harkous, Florian Huc

We consider the problem of computing an aggregation function in a \emph{secure} and \emph{scalable} way. Whereas previous distributed solutions with similar security guarantees have a communication cost of

O(n^3)

, we present a distributed protocol that r ...

CoRR2011

Faster and Smoother - VSH Revisited

Juraj Sarinay

We reconsider the provably collision resistant Very Smooth Hash and propose a small change in the design aiming to improve both performance and security. While the original proofs of security based on hardness of factoring or discrete logarithms are preser ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Adaptive Message Authentication for Multi-Hop Networks

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Nikodin Ristanovic, Panagiotis Papadimitratos, Georgios Theodorakopoulos

Recent benchmarks indicate that the use of public key cryptography results in non negligible verification times on platforms with limited processing power. In this paper, we focus on multi-hop Inter-Vehicle Communication and show that the increase in messa ...

2011

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.

Scalable and Secure Aggregation in Distributed Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Hamza Harkous, Florian Huc

O(n^3)

, we present a distributed protocol that r ...

CoRR2011

Zero-knowledge proof

Practical & Provably Secure Distance-Bounding

A Non-interactive Range Proof with Constant Communication

Scalable and Secure Polling in Dynamic Distributed Networks

The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks

Quantification of "Fuzzy" Chemical Concepts: A Computational Perspective

Design and Analysis of Multi-Block-Length Hash Functions

Scalable and Secure Aggregation in Distributed Networks

Set membership proofs in data processing systems

Faster and Smoother - VSH Revisited

Adaptive Message Authentication for Multi-Hop Networks

Graph Chatbot

Chat with Graph Search

Practical & Provably Secure Distance-Bounding

Quantification of "Fuzzy" Chemical Concepts: A Computational Perspective

Design and Analysis of Multi-Block-Length Hash Functions

The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks

A Non-interactive Range Proof with Constant Communication

Scalable and Secure Polling in Dynamic Distributed Networks

Faster and Smoother - VSH Revisited

Scalable and Secure Aggregation in Distributed Networks

Set membership proofs in data processing systems

Adaptive Message Authentication for Multi-Hop Networks