Efficiency of optimistic fair exchange using trusted devices

Dashti, Mohammad Torabi

doi:10.1145/2168260.2168263

Cited by 6 publications

(2 citation statements)

References 23 publications

(27 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a result, a protocol is required to guarantee that no party can cheat during the RD procedure. This issue has been addressed well in the literature of fair-exchange protocols (e.g., [20], [25], [26]), especially for wireless environments. Regardless of the differences among such protocols, there are two involved parties (called Alice and Bob), and one entity as a mediator (Trusted Third Party (TTP)) in "optimistic" class of these protocols.…”

Section: Transaction Protocolmentioning

confidence: 99%

LORD: Leader-based framework for Resource Discovery in Mobile Device Clouds

Asghari,

Kao,

Lotfi

et al. 2013

Preprint

View full text Add to dashboard Cite

show abstract

Section: Transaction Protocolmentioning

confidence: 99%

LORD: Leader-based framework for Resource Discovery in Mobile Device Clouds

Asghari,

Kao,

Lotfi

et al. 2013

Preprint

View full text Add to dashboard Cite

show abstract

“…Trusted devices have been applied in a range of situations: for instance to solve the fair exchange problem [46], [47], to provide secure storage primitives [48] and in secure multiparty computation [49]. Trusted sensors have been considered recently by several authors [44], [50], [51].…”

Section: Background and Related Workmentioning

confidence: 99%

Bootstrapping trust in networked measurement systems with secure sensors

Jónsson

Vigfússon

2012

2012 IEEE Sensors Applications Symposium Proceedings

View full text Add to dashboard Cite

Abstract-Aggregation of local sensor observations is a widely used and powerful approach to estimating the global state of large networked systems. However, guaranteeing the integrity of the aggregate remains an open problem, in particular for dynamic networked systems. We consider this problem in a single aggregator model -a system of several networked sensors and one inherently trusted collector. We argue that algorithmic approaches are insufficient in the general case and propose a simple, yet effective, solution based on the principles of trusted systems. I. INTRODUCTIONInformed decision making based on quantifiable information is contingent on accurate, high-quality measurements. We focus on networked measurement systems, in which sensors propagate local observations to a single collector in order to produce an aggregate -an approximate global view of the system [2]. In particular, we consider the integrity of the aggregation process in networked measurement systems in the presence of corrupt sensors, controlled by an insider adversary, whose goal is to stealthily [3] influence the global aggregate computed. We define such systems in a broad sense, encompassing diverse paradigms, such as wireless sensor networks [4], large-scale network monitoring systems [5] and industrial control systems.The integrity of the entire aggregation process must be considered in the context of the consuming application and its operators. Our opinion is that the only applications which can tolerate arbitrary inputs, and hence, arbitrary aggregates, are trivial ones suitable only for the most basic of tasks. Critical aggregation examples include military applications of sensor networks [6], [7], public safety command and control [8] and nuclear plant monitoring [9]. We can also consider applications where money is at stake, such as accurate metering for utilities.We ask the following question: can the aggregation process be secured in the general case of arbitrary data types and aggregation functions and in dynamic networks, while at the same time giving sufficiently strong integrity guarantees? In our view, this is infeasible unless one assumes some means of establishing a basis of trust at the sensor itself: we need some sort of integrity guarantees up front at the time the

show abstract

Optimal Fair Computation

Guerraoui

Wang

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A computation scheme among n parties is fair if no party obtains the computation result unless all other n − 1 parties obtain the same result. A fair computation scheme is optimistic if n honest parties can obtain the computation result without resorting to a trusted third party.We prove, for the first time, a tight lower bound on the message complexity of optimistic fair computation for n parties among which n − 1 can be malicious in an asynchronous network. We do so by relating the optimal message complexity of optimistic fair computation to the length of the shortest permutation sequence in combinatorics.

show abstract

Efficiency of optimistic fair exchange using trusted devices

Cited by 6 publications

References 23 publications

LORD: Leader-based framework for Resource Discovery in Mobile Device Clouds

LORD: Leader-based framework for Resource Discovery in Mobile Device Clouds

Bootstrapping trust in networked measurement systems with secure sensors

Optimal Fair Computation

Contact Info

Product

Resources

About