Publication

Optimistic Fair Exchange based on Publicly Verifiable Secret Sharing

Serge Vaudenay, Gildas Avoine
2004
Conference paper

Abstract

In this paper we propose an optimistic two-party fair exchange protocol which does not rely on a centralized trusted third party. Instead, the fairness of the protocol relies on the honesty of part of the neighbor participants. This new concept, which is based on a generic verifiable secret sharing scheme, is particularly relevant in networks where centralized authority can neither be used on-line nor off-line.

Official source

https://infoscience.epfl.ch/record/99463?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

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.

Optimistic Fair Exchange based on Publicly Verifiable Secret Sharing

Graph Chatbot

Chat with Graph Search

Predicting party switching through machine learning and open data

Formal Analysis of Distance Bounding with Secure Hardware

Scalable Bias-Resistant Distributed Randomness

Predicting party switching through machine learning and open data

Scalable Bias-Resistant Distributed Randomness

Formal Analysis of Distance Bounding with Secure Hardware