搜索结果: 1-10 共查到“军队指挥学 Fair Exchange”相关记录10条 . 查询时间(0.045 秒)
Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation
multi-party fair exchange fair computation optimistic model,
2016/1/4
Multi-party fair exchange (MFE) and fair secure multi-party computation (fair
SMPC) are under-studied fields of research, with practical importance. We examine
MFE scenarios where every participant ...
We study various classical secure computation problems in the context of fairness, and relate them with each other. We also systematically study fair sampling problems (i.e., inputless functionalities...
Improving Cut-and-Choose in Verifiable Encryption and Fair Exchange Protocols using Trusted Computing Technology
Cut-and-Choose Verifiable Encryption Fair Exchange Protocols Trusted Computing Technology
2009/9/11
Cut-and-choose is used in interactive zero-knowledge protocols in which a prover answers a series
of random challenges that establish with high probability that the prover is honestly following the d...
Optimistic fair exchange (OFE) allows two parties to fairly exchange their items without requiring
an online trusted party. Previous works focus on the setting in which the two parties are
individua...
Framework for Analyzing Optimistic Fair Exchange with Distributed Arbiters
Framework Analyzing Optimistic Fair Exchange Distributed Arbiters
2009/6/11
We nominate Alptekin K¨upc¸ ¨u for the Best Student Paper Award
Abstract
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has
something that Bob ...
Usable Optimistic Fair Exchange
Optimistic Fair Exchange sacrificing performance digital files
2009/6/9
Fairly exchanging digital content is an everyday problem. It has been shown that fair
exchange cannot be done without a trusted third party (called the Arbiter). Yet, even with a trusted
party, it i...
Constructing Optimistic Fair Exchange Protocols from Committed Signatures
Committed signature scheme optimistic fair exchange protocols strong RSA assumption
2009/4/9
In PODC 2003, Park et al. [32] first introduce a connection
between fair exchange and sequential two-party multi-signature scheme
and provide a novel method of constructing fair exchange protocol by...
Breaking and Repairing Optimistic Fair Exchange from PODC 2003
Optimistic Fair Exchange PODC multisignature schemes
2009/4/9
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair
exchange, based on RSA signatures. We show that their protocol is totally breakable already in the registration...
Fair Exchange Signature Schemes
FESS Concurrent Signature Schnorr Signature Electronic Commerce
2008/9/3
In this paper we propose a new class of Fair Exchange Sig-
nature Scheme(FESS) that allows two players to exchange digital signa-
tures in a fair way. Our signature scheme is a general idea and has ...
Optimistic Fair Exchange in a Multi-user Setting
Optimistic Fair Exchange Multi-user Setting
2008/8/28
This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-user setting guarantees ...